Answers are grounded in this paper and cite their sources.
This paper describes an experimental comparison of flow-shop algorithms, motivated by the need to consolidate recent research on this topic. Using a set of test problems, it investigated various branch-and-bound and elimination strategies in a comparative study and then combined them to produce a new and efficient solution algorithm.
No takes yet. Share an insight, caveat, or question.
Kenneth R. Baker (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: