• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2008년도 추계학술대회
• /
• pp.35-39
• /
• 2008

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• 한국품질경영학회:학술대회논문집
• /
• 한국품질경영학회 2009년도 추계학술대회
• /
• pp.131-135
• /
• 2009

This paper considers the sequencing of products in car assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality and computation time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• 대한안전경영과학회지
• /
• 제5권1호
• /
• pp.69-82
• /
• 2003

The sequence which minimizes overall utility work in car assembly lines reduces the cycle time, the number of utility workers, and the risk of conveyor stopping. This study suggests mathematical formulation of the sequencing problem to minimize overall utility work, and present a genetic algorithm which can provide a near optimal solution in real time. To apply a genetic algorithm to the sequencing problem in car assembly lines, the representation, selection methods, and genetic parameters are studied. Experiments are carried out to compare selection methods such as roullette wheel selection, tournament selection and ranking selection. Experimental results show that ranking selection method outperforms the others in solution quality, whereas tournament selection provides the best performance in computation time.

• 대한안전경영과학회지
• /
• 제4권3호
• /
• pp.95-105
• /
• 2002

This paper considers the sequencing of products in car assembly lines under Just-In-Time systems. Under Just-In-Time systems, the most important goal for the sequencing problem is to keep a constant rate of usage every part used by the systems. In this paper, tabu search technique for this problem is proposed. Tabu search is a heuristic method which can provide a near optimal solution in real time. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality and computation time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2004년도 추계학술대회
• /
• pp.1-5
• /
• 2004