Answers are grounded in this paper and cite their sources.
This paper addresses the two-machine flowshop problem where the setup, processing, and removal times of the jobs are separated and are independent of the job sequence. This problem is considered with maximum lateness as a measure of performance. Elimination criteria are established for both the classical and ordered flowshops, and optimal sequences are obtained for special ordered flowshops.
No takes yet. Share an insight, caveat, or question.
Allahverdi et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: