Heuristic Method for Sequencing Problem in Mixed Model Assembly Lines with Setup Time

준비시간이 있는 혼합모델 조립라인에서 투입순서문제를 위한 탐색적 방법

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.