Edward Ignall1, Linus Schrage1
1Cornell University, Ithaca, New York
Tóm tắt
The branch-and-bound technique of Little, et al. and Land and Doig is presented and then applied to two flow-shop scheduling problems. Computational results for up to 9 jobs are given for the 2-machine problem when the objective is minimizing the mean completion time. This problem was previously untreated. Results for up to 10 jobs, including comparisons with other techniques, are given for the 3-machine problem when the objective is minimizing the makespan.
