Answers are grounded in this paper and cite their sources.
We consider the problem of minimizing the maximum lateness in a m-machine flow shop subject to release dates. The objective of this paper is to develop a new branch-and-bound algorithm to solve exactly this strongly NP-hard problem. The proposed branch-and-bound algorithm encompasses several features including a procedure for adjusting heads and tails, heuristics, and a lower bounding procedure, which is based on the exact solution of the two-machine flow shop problem with time lags, ready times, and delivery times. Extensive computational experiments show that instances with up to 6000 operations can be solved exactly in a moderate CPU time.
No takes yet. Share an insight, caveat, or question.
Haouari et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: