• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.1
• /
• pp.13-13
• /
• 1988

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.533-549
• /
• 1996

This paper is concerned with a sequencing problem in mixed model assembly lines, which is important to efficient utilization of the lines. In the problem, we deal with the two objectives of minimizing the risk of stoppage and leveling part usage, and consider sequence-dependent setup time. In this paper, we present a genetic algorithm(GA) suitable for the multi-objective optimization problem. The aim of multi-objective optimization problems is to find all possible non-dominated solutions. The proposed algorithm is compared with existing multi-objective GAs such as vector evaluated GA, Pareto GA, and niched Pareto GA. The results show that our algorithm outperforms the compared algorithms in finding good solutions and diverse non-dominated solutions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.34-35
• /
• 1999

• Korean Management Science Review
• /
• v.11 no.1
• /
• pp.91-106
• /
• 1994

In mixed model assembly lines, products are assembled seqeuntially that have different combination of options specified by customers. In just in time (JIT) environment, production smoothing becomes an important issue for sub-lines which supply the necessary parts to each workstation of the assembly line. Another important issue is to avoid line stopping caused by work overload in workstations. To find a sequence which minimizes the costs associated with line stoppage and the option parts inventory level, a nonlinear mixed integer programming is formulated. Recognizing the limit of the Branch and Bound technique in large sized problems, a heuristic solution procedure is proposed. The performance of the heuristic is compared with the Branch and Bound technique through randomly generated test problems. The computational results indicate that on the average the heuristic solutions deviate approximately 3.6% from the optimal solutions.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.25-48
• /
• 1996

Mixed Model Assembly Lines (MMALs) are increasingly used to produce differentiated products on a single assembly line without work-in-process storage, Usually, a typical MMAL consists of a number of (1) stations doing exactly the same operation on every job, (2) stations involving operations with different choices, and (3) stations offering operations that are not performed on every job, or that are performed on every job but with many options. For stations of the first type there is no sequencing problem at all. However, for the second type a set-up cost is incurred each time the operation switches from one choice to another. At the third type of stations, different models, requring different amounts and choices of assembly work, creates an uneven flow of work along the line and variations in the work load at these stations. When a subsequence of jobs requires more work load than the station can handle, it is necessary to help the operations at the station or to complete the work elsewhere. Therefore, a schedule which minimize the sum of set-up cost and utility work cost is desired. So this study has developed Fixed Random Ordering Rule (FROR), Fixed Ascending Ordering Rule (FAOR), Fixed Descending Ordering Rule, and Extended NHR (ENHR). ENHR is to choose optimal color ordering of each batch with NHR, and to decide job sequence of the batch with it, too. As the result of experiments, ENHR was the best heuristic algorithm. NHR is a new heuristic rule in which only the minimum addition of violations from both partial sequence and unassigned sequence at every branch could be considered. And this is a heuristic sequencing rule for the third type of stations at MMAL. This study developed one more heuristic algorithm to test the performance of NHR, which is named as Practical Heuristic Rule (PHR).

• IE interfaces
• /
• v.16 no.3
• /
• pp.352-361
• /
• 2003

Vehicle manufacturing plant is a typical mixed-model production system. Generally it consists of three main shops including body shop, painting shop and assembly shop in addition to engine shop. Each shop contains diverse manufacturing processes, all of which are integrated in a form of flow line. Due to the high pressure from the market requesting small-volume large variety production, production planning becomes very critical for the competitiveness of automotive industry. In order to save costs and production time, production planning system is requested to meet some designated requirements for each shop: to balance the work load in body and assembly shops, and to minimize the number of color changes in painting shop. In this context, we developed a sequencing module for a vehicle production planning system using the ILOG Solver Library. It is designed to take into account all the manufacturing constraints at a time with meeting hard constraints in body shop, minimizing the number of soft constraints violated in assembly shop, and minimizing the number of color changes in painting shop.

• IE interfaces
• /
• v.9 no.2
• /
• pp.47-59
• /
• 1996

자동차 조립공장의 생산은 혼류생산 (Mixed-Model Production)의 대표적인 형태로서 동일한 조립라인에서 다양한 사양의 차량들을 Batch생산이 아니라 각 사양의 생산량이 평준화되도록 생산을 하는 것이 특징이다. 그런데 도장라인에서 생산완료 된 순서는 혼류조립라에서의 평준화 생산에 적합하지 않은 상태이므로 조립라인에의 투입순서를 재작성하여 제어하여야 한다. 본 논문에서는 조립라인의 실시간 투입순서 작성 및 운영시스템을 자동화하여 성공적으로 운영한 사례를 소개하고자 한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.163-174
• /
• 1999

본 연구는 혼합모델 조립라인의 길이를 최적화하고 이 라인의 길이에서 완성시간을 최소화하는 새로운 제품투입순서를 결정하기 위하여 이단계법(two phase method)을 사용하였다. 최적화된 라인의 길이를 가지고 완성시간을 최소화하면 이 완성시간은 최적해이거나, 최적해에 가까운 근사해이고 이때 제품투입순서는 두 목적함수를 만족하는 새로운 투입순서이다. 제안된 이단계법으로 수식화한 모델들은 수치예를 통해 여러 가지 문제들을 실행한 결과 두 목적함수를 각각 실행시킨 결과보다 좋은 결과임을 증명하였다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.157-160
• /
• 2000

This study is concerned with how to optimize the Input sequence of product models with sequence -dependent setup time in Mixed-Model Assembly Line (MMAL) using conveyor system. Usually MMAL consists of a number of stations linked by conveyor belt and each station has a work zone limited by upstream and downstream boundaries. To avoid improper interference between operators in the adjacent stations and excess of machine moving range, operators are forced to complete their operations within their predetermined work zone. In this study, our goal is to determine sequence of models for minimizing the total work unfinished within their work zone. A generalized formulation of the product sequencing problem in MMAL is presented and we developed an optimal procedure using Branch & Bound. Also we developed a heuristic procedure using local search.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.11
• /
• pp.20-26
• /
• 1995

본 연구는 JIT생산시스템에서 혼합조립라인에 대한 제품순서게획에 대한 연구이다. 본 연구에서 고려하는 조립라인을 효과적으로 수행하기 위해서는 서로 다른 제품들을 조립하기 위한 제품순서가 결정되어야 한다. 필요한 제품을 적시에 적당한 양만큼 생산하는 JIT생산시스템에서의 제품 순서계획의 목적은 라인에서 소비 되는 모든 부품들의 소비율을 일정하게 유지시키는 것이다. 본 연구에서는 부품소비율을 일정하게 유지시키 면서 동시에 순서계획수립시 계획파괴를 줄일수 있도록 그룹개념을 이용하여 순서계획문제를 정식화하고 이 에 대한 해법을 제시하였다. 본 연구에서 개발한 해법의 우수성을 평가하기 위해 총변동과 순서계획의 파괴빈도에 대한 실험을 통하여 기존해법과 비교한 결과 본 연구의 해법이 우수한 결과를 제공하였다.