• 한국경영과학회지
• /
• 제17권1호
• /
• pp.41-41
• /
• 1992

In the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

• 기술사
• /
• 제16권3호
• /
• pp.5-23
• /
• 1983

On the Seoul Metropolitan Subway Construction of No. 3, 4 Line, the total length is 57 Km and it is now undergoing almost 55％ progress. The working method is classified into Open Cut of 70% and the rest of 30% tunnelling method in the 48 job site. Above tunnelling method is execute by American Steel Support System and the rest of 10 job site carried out by New Austria Tunnelling Method. This paper describes Blasting Standardizations works on the above Tunnelling ' Open Cut Method under big slogan, first safety, second execution. As a superintendent, I strived standardization of works with Better powder, Better Drills ' Better Pattern. Geological structure of Seoul area is composed by Jurassic Granite and also the above rockgroup are over burden by Alluviums as a Unconformity. First of all, I carried out the standard amount of powder and burden through experimental standard blasting by each powder as following Blasting works in the subway construction is surrounding shop Building, under pass the city river and also under pass highest building basement floor. I made allowable Blasting Vibration Value by West-Germany Vornorm DIN 4150, Teil 3 and should measure each blasting works as fellows all of powder is used basically Low-Gravity and Low Velocity such as Slurry, Ammonium Nitrate ' Finex I, II. for Smooth Blasting Instead of Gelatin Dynamite. Electric Detonation Cap is used basically M/S Delay Cup instead of Electric delay ' Simultaneous cap. I applied following formula V=KW3/4 $D^{-2}$ V=Particle Velocity (Cm/sec) K=Ginh Huh's Value W=Delay Charge (Kg) D=Distance(m) In the Open Cut, within 1m distance from H-pile I made to use the Concrete breaker, as following V=7W/$^{0.5}$V/$^{-1.75}$ On the Concentrate Building area, I advise to use Light class drill ø36m Bit and advance 1.1m per round blasting the three boom jumbo drill over ø45mm used only suburb of city.e Light class drill ø36m Bit and advance 1.1m per round blasting the three boom jumbo drill over ø45mm used only suburb of city.

• 지능정보연구
• /
• 제13권4호
• /
• pp.121-135
• /
• 2007

문제의 제약조건을 명확히 표현하고 휴리스틱 탐색에 의하여 스케쥴링을 형성하는 제약조건 중심의 스케쥴링 기법은 실세계의 스케쥴링 문제에 성공적으로 적용되어 왔다. 하지만, 기존의 제약조건 중심의 스케쥴링 연구에서 스케쥴링의 목적을 표현하고 최적화하는데 관련된 연구는 부족한 상황이다. 특히 비용 목적함수는 다양한 비즈니스 계획의 효과를 분석하는 기업의사결정에서 매우 중요 하다고 평가된다. 이 연구의 목적은 자원 용량이나 일시적인 제약조건을 만족하면서 지연비용 및 재고비용을 포함한 스케쥴링의 전체 비용을 명확하게 표현하고 최적화하는 것이다. 비용기반 스케쥴링 프레임워크에서, 동일한 작업 내에 일시적인 제약조건을 만들어 가면서 비용함수를 개선해 나가는 비용 전파 알고리즘을 제시하였다.

• 한국유통학회지:유통연구
• /
• 제13권1호
• /
• pp.79-96
• /
• 2008

본 연구는 최근에 마케팅분야에서 주목받고 있는 연구영역인 시장지향성이 판매조직의 성과에 긍정적인 영향을 미치는 이유에 대한 설명을 하기 위하여 기업의 시장지향성이 판매원관련 변수들(고객지향성, 직무만족, 그리고 조직몰입)과 고객관련 변수들(서비스품질, 서비스가치, 고객만족, 그리고 고객충성도)을 매개로 하여 성과로 나타남을 설명할 목적으로 수행되었다. 백화점에서 영업활동을 하는 다양한 매장의 점포관리자들을 대상으로 하여 설문조사를 한 결과, 기업의 시장지향성은 판매직원을 통해 고객에게 전해지며, 기업의 시장지향성을 통해 긍정적으로 증가된 판매원관련 변수들이 고객에게 전해지는 서비스품질, 고객만족, 그리고 고객충성도를 증가시킴으로써 성과를 향상시킴을 밝혔다. 또한, 지금까지 판매원관련 변수들과 고객관련 변수들의 순서나 인과관제에 대한 명확한 모형이 존재하지 않았는데, 본 연구를 통하여 판매원관련 변수들과 고객관련 변수들 내에서의 각각의 관제뿐만 아니라 두 집단변수들 간의 연결고리를 명확하게 제시한 이론적 공헌을 갖는다. 지금까지 선행연구의 결과와 같이 본 연구결과를 통해서도 시장지향성은 성과에 긍정적인 영향을 주는 것이 명확한 것으로 나타났고, 이 과정에서 판매원관련 변수들과 고객관련 변수들이 어떻게 영향을 주는지를 명확하게 밝힌 점을 참고로 하여, 앞으로 기업들은 시장지향성을 더욱 강조하고 이와 관련된 판매원관련 변수들과 고개관련 변수들의 작용을 이해함으로써 더 높은 성과를 얻을 수 있을 것이다.

• 한국산업경영시스템학회:학술대회논문집
• /
• 한국산업경영시스템학회 2002년도 춘계학술대회
• /
• pp.237-242
• /
• 2002

The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. To cope with this problem, this paper deals with the development of an agent for selecting an optimal order set automatically. The main engine of selection agent is based on the typical job-shop scheduling model since our target domain is the injection molding company. To solve the problem, we have formulated it as IP (Integer Program) model, and it has been successfully implemented by ILOG and selection agent. And we have suggested an architecture of an agent for tackling web based order selection problems.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 춘계학술대회 논문집
• /
• pp.997-1000
• /
• 2005

Dynamic job shop environment requires not only more flexible capabilities of a CAPP system but higher utility of the generated process plans. In order to meet the requirements, this paper develops an algorithm that can select machines for the machining operations to be performed by predicting the machine loads. The developed algorithm is based on the multiple objective genetic algorithm that gives rise to a set of optimal solutions (in general, known as Pareto-optimal solutions). The objective shows a combination of the minimization of part movement and the maximization of machine utility balance. The algorithm is characterized by a new and efficient method for nondominated sorting, which can speed up the running time, as well as a method of two stages for genetic operations, which can maintain a diverse set of solutions. The performance of the algorithm is evaluated by comparing with another multiple objective genetic algorithm, called NSGA-II.

• 한국산학기술학회논문지
• /
• 제11권9호
• /
• pp.3232-3238
• /
• 2010

유연생산시스템은 고자동화 생산시스템일 뿐만 아니라, 사용자와 시장의 요구를 만족시키기 위해 유연한 생산시스템이 요구됨에 따라 작업배정규칙 할당에 있어서 시스템과 작업환경에 많은 제약을 받게 된다. 본 논문에서는 온톨로지 지식 기반의 작업환경을 고려한 유연생산시스템의 작업배경규칙 할당방법을 제시한다. 에이전트를 이용하여 작업장 환경과 작업내용을 모니터링하고, 이에 적합한 작업배정규칙을 온톨로지 지식으로부터 추론하여 시스템에 적용한다. 본 시스템 개발을 위해 멀티에이전트를 지원하는 $JADE^{TM}$ 플랫폼을 이용하였으며, 온톨로지는 Protege를 이용하여 개발되었다.

• 대한산업공학회지
• /
• 제25권1호
• /
• pp.35-46
• /
• 1999

The introduction of general purpose machining centers and the information system based on computer network has added a new control problem to the classical job shop control problems: a routing problem. A routing problem is to determine the machine on which a part will be processed. The modern manufacturing systems are given much system status information including the arrival time of the future parts via the computer network for automation. This paper presents and tests the performance of a routing procedure, LARP(Look-Ahead Routing Procedure) which uses look-ahead information on the future arrival of parts in the system. The manufacturing system considered in this paper has multi-stations which consists of general purpose machines and processes parts of different types. The application of LARP under many operating conditions shows that the reduction of part flow time and tardiness from the cases without using this information is up to 8% for flow time and 21% for tardiness. The procedure introduced here can be used for many highly automated systems such as an FMS and a semi-conductor fabrication system for routing where the arrivals of parts in the near future are known.

• 산업공학
• /
• 제16권3호
• /
• pp.375-381
• /
• 2003

To ensure competitiveness in the modern automotive market, process planning should be performed concurrently with new car developments. In automotive general assembly shops, thus, new business workflows and supporting environments are inevitable to reduce the manufacturing preparation time in developing a new car in the manner of concurrent and collaborative engineering. Since complete process planning for a whole general assembly system is a huge and complex job, several process planners should execute their planning jobs and share information. Therefore, each planner should provide others with his/her results with continuous on-line communication and cooperation. In this research, a web-based system for concurrent and collaborative process planning for automotive general assembly is developed. By using this system, savings in time and cost of assembly process planning are possible, and the reliability of the planning result is improved.

• 산업공학
• /
• 제11권3호
• /
• pp.89-101
• /
• 1998

The randomness of the input variables in simulation experiments produce output responses which are also realizations of random variables. The random responses make necessary the use of statistical inferences to adequately describe the stochastic nature of the output. The analysis of the simulation output of non-terminating simulations is frequently complicated by the autocorrelation of the output data and the effect of the initial conditions that produces biased estimates. The regenerative method has been developed to deal with some of the problems created by the random nature of the simulation experiments. It provides a simple solution to some tactical problems and can produce valid statistical results. However, not all processes can he modeled using the regenerative method. Other processes modeled as regenerative may not return to a given demarcating state frequently enough to allow for adequate statistical analysis. This paper shows how the state transformation concept was successfully used in a queueing model and a job shop model. Although the first example can be analyzed using the regenerative method. it has the problem of too few recurrences under certain conditions. The second model has the problem of no recurrences. In both cases, the state transformation increase the frequency of the demarcating state. It was shown that time state transformations are regenerative and produce more cycles than the best typical discrete demarcating state in a given run length.