论文信息 - Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem

Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem

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.

Z. A. Lomnicki | A. P. G. Brown | A. P. G. Brown

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

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

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

[4] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[5] S. Vajda,et al. Symposium on Monte Carlo Methods , 1957, The Mathematical Gazette.

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