Sequencing with Earliness and Tardiness Penalties: A Review

We consider the problem of scheduling n jobs to minimize the total earliness and tardiness penalty. We review the literature on this topic, providing a framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date. To this base we add such features as parallel machines, complex penalty functions and distinct due dates. We also consolidate many of the existing results by proving general forms of two key properties of earliness/tardiness models.

[1]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

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

[3]  Samuel Eilon,et al.  Minimising Waiting Time Variance in the Single Machine Problem , 1977 .

[4]  J. McNair.  A generalized model of optimal diets , 1979 .

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

[6]  John J. Kanet,et al.  Minimizing Variation of Flow Time in Single Machine Systems , 1981 .

[7]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[8]  Sushil K. Gupta,et al.  Minimizing a quadratic function of job lateness on a single machine , 1983 .

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

[10]  T. C. E. Cheng,et al.  Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine , 1984 .

[11]  Candace Arai Yano,et al.  Algorithms for single machine scheduling problems minimizing tardiness and earliness , 1986 .

[12]  Nicholas G. Hall.  Single- and multiple-processor models for minimizing completion time variance , 1986 .

[13]  Yih-Long Chang,et al.  MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .

[14]  M. Raghavachari.  A V-shape property of optimal schedule of jobs about a common due date , 1986 .

[15]  G. Leong,et al.  Single machine scheduling: A comparison of two solution procedures , 1987 .

[16]  Timothy D. Fry,et al.  A BI-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden , 1987, Comput. Oper. Res..

[17]  T. C. Edwin Cheng,et al.  An algorithm for the con due-date determination and sequencing problem , 1987, Comput. Oper. Res..

[18]  Yih-Long Chang,et al.  Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date , 1987 .

[19]  Yih-Long Chang,et al.  Minimizing Mean Squared Deviation of Completion Times About a Common Due Date , 1987 .

[20]  J. Blackstone,et al.  Minimizing Weighted Absolute Deviation in Single Machine Scheduling , 1987 .

[21]  Hamilton Emmons,et al.  Scheduling to a common due date on parallel uniform processors , 1987 .

[22]  Jerzy Kyparisis,et al.  Single machine scheduling research , 1987 .

[23]  M. Raghavachari,et al.  Deterministic and Random Single Machine Sequencing with Variance Minimization , 1987, Oper. Res..

[24]  M. Quaddus.  A Generalized Model of Optimal Due-Date Assignment by Linear Programming , 1987 .

[25]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[26]  Suresh Chand,et al.  Single machine scheduling to minimize weighted earliness subject to no tardy jobs , 1988 .

[27]  C. R. Bector,et al.  Determination of an optimal common due date and optimal sequence in a single machine job shop , 1988 .

[28]  T. C. Edwin Cheng,et al.  Optimal common due-date with limited completion time deviation , 1988, Comput. Oper. Res..

[29]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[30]  T. S. Abdul-Razaq,et al.  Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[31]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

[32]  Gary D. Scudder,et al.  On the Assignment of Optimal Due Dates , 1989 .

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

[34]  W. Szwarc.  Single-machine scheduling to minimize absolute deviation of completion times from a common due date , 1989 .

[35]  P. De,et al.  Note-A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date , 1989 .

[36]  Prabuddha De,et al.  Scheduling about a common due date with earliness and tardiness penalties , 1990, Comput. Oper. Res..