Answers are grounded in this paper and cite their sources.
The "branch-and-bound" algorithm for the exact solution of a three-machine scheduling problem proposed by Lomnicki has been generalized to the case of an arbitrary number of machines (under the assumption of an identical order on all the machines) and it has been adapted for an electronic computer. The flow chart of this algorithm used in the programming of calculations has been given and the efficiency of the method has been illustrated by some experimental evaluations of optimum job sequencing.
No takes yet. Share an insight, caveat, or question.
Brown et al. (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: