Scheduling Jobs with Sequence Dependent Setups on Coupled Lines
This paper introduces the problem of scheduling a set of jobs with sequence dependent setup times on a machine with a pair of coupled processing lines, i.e., both lines must be operated simultaneously. A heuristic procedure is developed to find a good schedule which then is used as a starting point for a tabu search. A mixed integer programming formulation of the problem is also given. Computational results on real-world problems are presented.
Unable to display preview. Download preview PDF.