Survey of scheduling research involving due date determination decisions

Abstract We attempt to present in this paper a critical review of a particular segment of scheduling research in which the due to date assignment decision is of primary interest. The literature is classified into the static and dynamic job shop situations. The static job shop is analyzed from two different perspectives: the due date is constrained to be greater than or equal to makespan, and the optimal due date and optimal sequence are to be determined when the method of assigning due dates is specified. The literature on dynamic job shops is also reviewed under two broad categories. First, we discuss all the literature concerned with comparative and investigative studies to identify the most desirable due date assignment method. Second, we discuss the literature dealing with determination of optimal due dates. We note that computer simulation and analytical methods are two common approaches for the second type of problems. We observe that while the static single-machine problem with constant or common due dates has been well researched, very little or no work has been done on the dynamic multi-machine problem with sophisticated due date assignment methods. Finally, we identify and suggest some worthwhile areas for future research.

[1]  John R. King,et al.  Production Scheduling , 1988, Computer-Aided Production Management.

[2]  Jwm Will Bertrand,et al.  A comparison of due-date selection rules , 1981 .

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

[4]  R. M. Hodgson,et al.  JOB SHOPS SCHEDULING WITH DUE DATES , 1967 .

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

[6]  Parviz Ghandforoush,et al.  An Algorithm for the Single-Machine Sequencing Problem to Minimize Total Tardiness , 1983 .

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

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

[9]  Gary L. Ragatz,et al.  A framework for the study of due date management in job shops , 1984 .

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

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

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

[13]  T.C.E. Cheng.  Optimal slack due-date determination and sequencing , 1986 .

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

[15]  K. R. Baker,et al.  An investigation of due-date assignment rules with constrained tightness , 1981 .

[16]  Uday S. Karmarkar,et al.  Lot Sizes, Lead Times and In-Process Inventories , 1987 .

[17]  John J. Kanet,et al.  Note-On Anomalies in Dynamic Ratio Type Scheduling Rules: A Clarifying Analysis , 1982 .

[18]  Abraham Seidmann,et al.  Due date selection procedures for job-shop simulation , 1983 .

[19]  T.C.E. Cheng.  On Optimal Common Due-Date Determination , 1986 .

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

[21]  T.C.E. Cheng.  Optimal constant due-date assignment and sequencing , 1988 .

[22]  Jwm Will Bertrand,et al.  A dynamic priority rule for scheduling against due-dates , 1982 .

[23]  M. A. Quaddus.  ON THE DUALITY APPROACH TO OPTIMAL DUE DATE DETERMINATION AND SEQUENCING IN A JOB SHOP , 1987 .

[24]  T. Cheng.  A Note on the Common Due-Date Assignment Problem , 1986 .

[25]  Said Ashour,et al.  A GASP simulation study of job-shop scheduling , 1972 .

[26]  T.C.E. Cheng.  Minimizing the average deviation of job completion times about a common due-date: An extension , 1987 .

[27]  T.C.E. Cheng.  Optimal due-date assignment for a single machine sequencing problem with random processing times , 1986 .

[28]  T.C.E. Cheng.  Optimal due-date assignment in a job shop† , 1986 .

[29]  Abraham Seidmann,et al.  Due Date Assignment for Production Systems , 1981 .

[30]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[31]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[32]  T.C.E. Cheng.  Optimal due-date determination and sequencing with random processing times , 1987 .

[33]  T.C.E. Cheng,et al.  Due-date determination for an single-machine shop with SPT dispatching , 1986 .

[34]  C. R. Bector,et al.  V-shape property of optimal sequence of jobs about a common due date on a single machine , 1989, Comput. Oper. Res..

[35]  T. Cheng.  Integration of priority dispatching and due-date assignment in a job shop , 1988 .

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

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

[38]  T.C.E. Cheng.  Optimal total-work-content-power due-date determination and sequencing , 1987 .

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

[40]  G. Ragatz,et al.  A simulation analysis of due date assignment rules , 1984 .

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

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

[43]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

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

[45]  J. Bertrand.  The Effect of Workload Dependent Due-Dates on Job Shop Performance , 1983 .

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

[47]  James K. Weeks.  A Simulation Study of Predictable Due-Dates , 1979 .

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

[49]  T.C.E. Cheng.  Analytical determination of optimal TWK due-dates in a job shop , 1985 .

[50]  C. Jones.  An Economic Evaluation of Job Shop Dispatching Rules , 1973 .

[51]  T. C. E. Cheng.  A note on preemptive-due-date scheduling with minimum Makespan , 1985 .

[52]  James K. Weeks,et al.  A Simulation Study of Operating Policies in a Hypothetical Dual-Constrained Job Shop , 1976 .

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

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

[55]  Shigeji Miyazaki,et al.  Combined scheduling system for reducing job tardiness in a job shop , 1981 .

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

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