Scheduling to minimize tardiness

Abstract A procedure has been developed for finding optimal solutions to the problem of minimizing tardiness scheduling for a wide variety of constraints. As most practical problems are much larger than could be solved economically by this procedure, the idea of using the lower bound as a decision rule for developing a single, near-optimal solution was developed. The experiments on these decision rules showed that they might profitably be used in place of other rules for certain applications.

[1]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[2]  J. J. Kanet.  Minimizing the average deviation of job completion times about a common due date , 1981 .

[3]  Mesbah U. Ahmed,et al.  Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .

[4]  J. D. Irwin,et al.  An Improved Method for Scheduling Independent Tasks , 1971 .

[5]  Chris N. Potts,et al.  An adaptive branching rule for the permutation flow-shop problem , 1980 .

[6]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[7]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[8]  B. J. Lageweg,et al.  Minimizing maximum lateness on one machine : Computational experience and some applications , 1976 .

[9]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[10]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[11]  Jeffrey B. Sidney,et al.  Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1977, Oper. Res..

[12]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[13]  V. Srinivasan.  A hybrid algorithm for the one machine sequencing problem to minimize total tardiness , 1971 .

[14]  S. S. Panwalkar,et al.  Optimal assignment of due-dates for a single processor scheduling problem , 1981 .

[15]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[16]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[17]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[18]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[19]  Jeffrey R. Barker,et al.  Scheduling the General Job-Shop , 1985 .

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

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

[22]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

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

[24]  S. Lakshminarayan,et al.  Technical Note - Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1978, Oper. Res..

[25]  Kenneth R. Baker,et al.  An experimental comparison of solution algorithms for the single‐machine tardiness problem , 1974 .