Answers are grounded in this paper and cite their sources.
n jobs are to be processed on two or three machines. Each job must be processed in sequence, first on machine I than on machine II, etc. For each job, setup time, processing time, and removal time is known in each machine. Algorithms are developed which determine an optimal sequence that minimizes the total elapsed time. Numerical examples illustrate the algorithms.
No takes yet. Share an insight, caveat, or question.
Sule et al. (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: