Answers are grounded in this paper and cite their sources.
The branch-and-bound technique has been applied to the three machine flow shop problem where the objective is to minimize makespan. A new method of obtaining the bound has been developed. Rules for ordering the machines and listing the jobs prior to application of the algorithm have been proposed. Computational results are given for a large number of job sets up to 10 jobs, and for a few cases up to 45 jobs.
No takes yet. Share an insight, caveat, or question.
McMahon et al. (1967) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: