论文信息 - ON THE BOUND OF MAKESPANS AND ITS APPLICATION IN M MACHINE SCHEDULING PROBLEM - 字舞流文

ON THE BOUND OF MAKESPANS AND ITS APPLICATION IN M MACHINE SCHEDULING PROBLEM

Ichiro Nabeshima | Ichiro Nabeshima | I. Nabeshima

[1] 鍋島一郎. Branch and Bound Algorithms for Optimal Sequencing of Jobs Through Machines where Passing is Allowed , 1966 .

[2] Z. A. Lomnicki,et al. Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[3] E. Ignall,et al. Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[4] Z. A. Lomnicki. A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

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