论文信息 - On the Scheduling of Jobs on a Number of Identical Machines.

On the Scheduling of Jobs on a Number of Identical Machines.

Abstract : Several theoretical results are developed to obtain an efficient branch-and-bound algorithm for the sequencing problem when all jobs are available to process at time zero and are independent (i.e., there are no precedence relationships among jobs). The branch-and-bound algorithm and its computational results are given for the case of linear penalty functions. The computational experiences are very encouraging. The computer times required to solve the problems are very short and most problems become optimal at the early stages of computation. (Author)

Salah E. Elmaghraby | Sung H. Park

[1] Philip M. Wolfe,et al. Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach , 1969 .

[2] Shimon Even,et al. Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .

[3] Colin L. Moodie,et al. A Branch and Bound Algorithm for Minimizing Cost in Project Scheduling , 1971 .

[4] James G. Root. Scheduling with Deadlines and Loss Functions on k Parallel Machines , 1965 .

[5] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .

[6] N. Agin. Optimum Seeking with Branch and Bound , 1966 .

[7] G. W. Snedecor. Statistical Methods , 1964 .

[8] L. G. Mitten,et al. Efficient Solution Procedures for Certain Scheduling and Sequencing Problems , 1973 .

[9] Michael H. Rothkopf,et al. Scheduling Independent Tasks on Parallel Processors , 1966 .

[10] Linus Schrage,et al. Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..