论文信息 - Minimizing maximum lateness on one machine : Computational experience and some applications

Minimizing maximum lateness on one machine : Computational experience and some applications

Summary We consider the problem of scheduling jobs on a single machine subject to given release dates and precedence constraints, in order to minimize maximum lateness. The algorithms of Baker and Su (Naval Res. Logist. Quart. 21 (1974) 171–176) and of McMahon and Florian (Operations Res. 23 (1975) 475–482) for the problem without precedence constraints are extended to the general case. An extensive computational comparison establishes the superiority of the latter algorithm. We describe applications to the theory of job-shop scheduling and to a practical scheduling situation.

[1] John M. Charlton,et al. A Generalized Machine-Scheduling Algorithm , 1970 .

[2] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .

[3] Michael Florian,et al. An Implicit Enumeration Algorithm for the Machine Sequencing Problem , 1971 .

[4] M. I. Dessouky,et al. The One-Machine Sequencing Problem with Early Starts and Due Dates , 1972 .

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

[6] G. Thompson,et al. Algorithms for Solving Production-Scheduling Problems , 1960 .

[7] Graham McMahon,et al. On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[8] M. Florian,et al. On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem , 1973 .

[9] W. A. Horn. Some simple scheduling algorithms , 1974 .

[10] John M. Charlton,et al. A Method of Solution for General Machine-Scheduling Problems , 1970, Oper. Res..

[11] Kenneth R. Baker,et al. Sequencing with due-dates and early start times to minimize maximum tardiness , 1974 .

[12] Eugene L. Lawler,et al. Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[13] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .