论文信息 - Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems

Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems

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.

E. Ignall | L. Schrage

[1] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .

[2] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[3] Richard A. Dudek,et al. Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

[4] H. M. Wagner,et al. Approximate Solutions to the Three-Machine Scheduling Problem , 1964 .

[5] William L. Maxwell,et al. CLP-the Cornell list processor , 1965, CACM.