A survey of the state-of-the-art of common due date assignment and scheduling research

Abstract We aim at providing a unified framework of the common due date assignment and scheduling problems in the deterministic case by surveying the literature concerning the models involving single machine and parallel machines. The problems with due date determination have received considerable attention in the last 15 years due to the introduction of new methods of inventory management such as just-in-time (JIT) concepts. The common due date model corresponds, for instance, to an assembly system in which the components of the product should be ready at the same time, or to a shop where several jobs constitute a single customer's order. In the problems under consideration, the objective is to find an optimal value of the common due date and the related optimal schedule in order to optimize a given criterion based on the due date and the completion times of jobs. The results on the algorithms and complexity of the common due date assignment and scheduling problems are summarized.

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

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

[3]  Qi Hao,et al.  Common due-date determination and sequencing using tabu search , 1996, Comput. Oper. Res..

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

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

[6]  T.C.E. Cheng.  A DUALITY APPROACH TO OPTIMAL DUE-DATE DETERMINATION , 1985 .

[7]  C. R. Bector,et al.  Optimal schedule on a single machine using various due date determination methods , 1990 .

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

[9]  Hüseyin Sarper,et al.  Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem , 1995 .

[10]  Sheldon Epstein,et al.  Optimal common due-date with completion time tolerance , 1996, Comput. Oper. Res..

[11]  Sheldon Epstein,et al.  Optimal common due-date with limited completion time , 1991, Comput. Oper. Res..

[12]  V. S. Tanaev,et al.  Scheduling Theory: Multi-Stage Systems , 1994 .

[13]  Han Hoogeveen,et al.  Earliness-Tardiness Scheduling Around Almost Equal Due Dates , 1992, INFORMS J. Comput..

[14]  S. Sethi,et al.  Equivalence of Mean Flow Time Problems and Mean Absolute Deviation Problems , 1990 .

[15]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[16]  Gur Mosheiov,et al.  Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs , 1994, Oper. Res. Lett..

[17]  J. A. Ventura,et al.  Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times , 1994 .

[18]  Meral Azizoglu,et al.  Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates , 1997 .

[19]  Prabuddha De,et al.  On the Multiple-machine Extension to a Common Due-date Assignment and Scheduling Problem , 1991 .

[20]  T. Cheng.  Minimizing the maximum deviation of job completion time about a common due-date , 1987 .

[21]  Seiki Kyan,et al.  DETERMINISTIC SCHEDULING IN COMPUTER SYSTEMS: A SURVEY , 1988 .

[22]  Alan G. Merten,et al.  Variance Minimization in Single Machine Sequencing Problems , 1972 .

[23]  Dirk Biskup,et al.  Common due date assignment for scheduling on a single machine with jointly reducible processing times , 2001 .

[24]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[25]  R.-K. Li,et al.  Integrating order release control with due-date assignment rules , 1997 .

[26]  Ranga V. Ramasesh.  Dynamic job shop scheduling: A survey of simulation research , 1990 .

[27]  Prabuddha De,et al.  On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..

[28]  Martin Feldmann,et al.  Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches , 2003 .

[29]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

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

[31]  Surya D. Liman,et al.  Common due window size and location determination in a single machine scheduling problem , 1998, J. Oper. Res. Soc..

[32]  Wieslaw Kubiak,et al.  Completion time variance minimization on a single machine is difficult , 1993, Oper. Res. Lett..

[33]  Kevin J. Dooley,et al.  Dynamic rules for due-date assignment , 1991 .

[34]  James K. Weeks,et al.  A Methodology for Assigning Minimum Cost Due-Dates , 1977 .

[35]  T.C.E. Cheng.  An alternative proof of optimality for the common due-date assignment problem , 1988 .

[36]  T.C.E. Cheng.  Optimal constant due-date determination and sequencing of n jobs on a single machine , 1991 .

[37]  Zhi-Long Chen,et al.  Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs , 1996 .

[38]  Han Hoogeveen,et al.  New Lower and Upper Bounds for Scheduling Around a Small Common Due Date , 1994, Oper. Res..

[39]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[40]  T.C.E. Cheng,et al.  A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines , 1989 .

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

[42]  Wieslaw Kubiak,et al.  A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem , 1999, Oper. Res..

[43]  P. De,et al.  Due‐date assignment and early/tardy scheduling on identical parallel machines , 1994 .

[44]  T. C. Edwin Cheng,et al.  Single-machine scheduling with a common due window , 2001, Comput. Oper. Res..

[45]  Yash P. Gupta,et al.  Minimizing flow time variance in a single machine system using genetic algorithms , 1993 .

[46]  Wieslaw Kubiak,et al.  Algorithms for Minclique Scheduling Problems , 1997, Discret. Appl. Math..

[47]  V. Tanaev,et al.  Scheduling theory single-stage systems , 1994 .

[48]  Tapan Sen,et al.  A state-of-art survey of static scheduling research involving due dates , 1984 .

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

[50]  T. C. Edwin Cheng.  A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem , 1990, Comput. Oper. Res..

[51]  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 .

[52]  Mikhail Y. Kovalyov.  Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case , 1997, Discret. Appl. Math..

[53]  Prabuddha De,et al.  CON due-date determination and sequencing , 1990, Comput. Oper. Res..

[54]  J. A. Hoogeveen,et al.  Combining column generation and laGrangean relaxation : an application to a single-machine common due date scheduling problem , 1998 .

[55]  Xiaoqiang Cai,et al.  Minimization of agreeably weighted variance in single machine systems , 1995 .

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

[57]  S. S. Panwalkar,et al.  Single-machine sequencing with controllable processing times , 1992 .

[58]  T. C. Edwin Cheng,et al.  Multiple-machine scheduling with earliness, tardiness and completion time penalties , 1999, Comput. Oper. Res..

[59]  Samuel Eilon,et al.  Due dates in job shop scheduling , 1976 .

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

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

[62]  S. S. Panwalkar,et al.  Determination of common due window location in a single machine scheduling problem , 1996 .

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

[64]  T.C.E. Cheng,et al.  SINGLE-MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND EARLINESS, TARDINESS AND COMPLETION TIME PENALTIES , 1999 .

[65]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[66]  T.C.E. Cheng,et al.  Due-date assignment and single machine scheduling with compressible processing times , 1996 .

[67]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[68]  P. De,et al.  Solving a generalized model for CON due date assignment and sequencing , 1994 .

[69]  Dirk Biskup,et al.  Single-machine scheduling with learning considerations , 1999, Eur. J. Oper. Res..

[70]  Chae Y. Lee,et al.  Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights , 1995 .

[71]  Parthasarati Dileepan.  Common due date scheduling problem with separate earliness and tardiness penalties , 1993, Comput. Oper. Res..

[72]  Wieslaw Kubiak,et al.  Scheduling shops to minimize the weighted number of late jobs , 1994, Oper. Res. Lett..

[73]  Jose A. Ventura,et al.  An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date , 1995, Oper. Res. Lett..

[74]  Bahram Alidaee,et al.  Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines , 1993 .

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

[76]  Nicholas G. Hall.  Scheduling Problems With Generalized Due Dates , 1986 .

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

[78]  Wlodzimierz Szwarc.  The weighted common due date single machine scheduling problem revisited , 1996, Comput. Oper. Res..

[79]  Charles H. Smith,et al.  Selecting allowance policies for improved job shop performance , 1993 .

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

[81]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[82]  Prabuddha De,et al.  Optimal Delivery Time Quotation and Order Sequencing , 1991 .

[83]  Chelliah Sriskandarajah,et al.  On the Complexity of Generalized Due Date Scheduling Problems , 1991 .

[84]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[85]  H. G. Kahlbacher.  Scheduling with monotonous earliness and tardiness penalties , 1993 .

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

[87]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[88]  Bahram Alidaee,et al.  Two parallel machine sequencing problems involving controllable job processing times , 1993 .

[89]  T.C.E. Cheng.  Common due-date assignment and scheduling for a single processor to minimize the number of tardy jobs , 1990 .

[90]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

[92]  S. T. Webster,et al.  The complexity of scheduling job families about a common due date , 1997, Oper. Res. Lett..

[93]  T. C. Edwin Cheng,et al.  Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs , 1993, Discret. Appl. Math..

[94]  Gerhard J. Woeginger,et al.  A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .

[95]  Wieslaw Kubiak,et al.  New Results on the Completion Time Variance Minimization , 1995, Discret. Appl. Math..

[96]  Suresh P. Sethi,et al.  Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..

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

[98]  Xiaoqiang Cai,et al.  Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties , 1997 .

[99]  Jatinder N. D. Gupta,et al.  Minimizing tardy jobs in a flowshop with common due date , 2000, Eur. J. Oper. Res..

[100]  Chung-Lun Li,et al.  The parallel machine min-max weighted absolute lateness scheduling problem , 1994 .

[101]  Chung-Yee Lee,et al.  Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date , 1991, Comput. Oper. Res..

[102]  Elliot D. Minor,et al.  Regression-based due date assignment rules for improved assembly shop performance , 1995 .

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

[104]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[105]  Chung Yee Lee,et al.  On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date , 1993 .

[106]  John J. Kanet,et al.  Single-machine scheduling with early and tardy completion costs , 1993 .

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

[108]  Malgorzata Sterna,et al.  Total Late Work Criteria for Shop Scheduling Problems , 2000 .

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

[110]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[111]  Gur Mosheiov,et al.  Simultaneous optimization of efficiency and performance balance measures in single‐machine scheduling problems , 1993 .

[112]  John B. Kidd,et al.  Toyota Production System , 1993 .

[113]  J. A. Hoogeveen,et al.  Scheduling around a small common due date , 1991 .

[114]  Martin Feldmann,et al.  Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates , 2001, Comput. Oper. Res..

[115]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .

[116]  Stephen R. Lawrence,et al.  Estimating flowtimes and setting due-dates in complex production systems , 1995 .

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

[118]  Costas P. Pappis,et al.  Scheduling under a common due-data on parallel unrelated machines , 1998, Eur. J. Oper. Res..

[119]  C. Pappis,et al.  Scheduling Under the Due Date Criterion with Varying Penalties for Lateness , 1993 .

[120]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[121]  Kevin J. Dooley,et al.  Mixing static and dynamic flowtime estimates for due-date assignment , 1993 .

[122]  D. B. Roman,et al.  Dynamic assignation of due-dates in an assembly shop based in simulation , 1996 .

[123]  Chengbin Chu,et al.  A State-of-the-Art Survey of Due Date Assignment and Scheduling Research: SLK, TWK and Other Due Date Assignment Models , 1998 .

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

[125]  T. C. Edwin Cheng,et al.  Batch Scheduling and Common Due-date Assignment on a Single Machine , 1996, Discret. Appl. Math..

[126]  L. P. Rees,et al.  Cost‐based due‐date assignment with the use of classical and neural‐network approaches , 1997 .

[127]  Meral Azizoglu,et al.  Scheduling job families about an unrestricted common due date on a single machine , 1997 .

[128]  Ross J. W. James.  Using tabu search to solve the common due date early/tardy machine scheduling problem , 1997, Comput. Oper. Res..

[129]  Prabuddha De,et al.  On the general solution for a class of early/tardy problems , 1993, Comput. Oper. Res..

[130]  T.C.E. Cheng,et al.  Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties , 1994 .

[131]  Nikos Karacapilidis,et al.  Form Similarities of the CON and SLK Due Date Determination Methods , 1995 .

[132]  Tang Guo-chun,et al.  Single machine scheduling with common due date assignment in a group technology environment , 1997 .

[133]  Nikos Karacapilidis,et al.  Optimization algorithms for a class of single machine scheduling problems using due date determination methods , 1995 .