Machine scheduling with earliness, tardiness and non-execution penalties

The study of scheduling problems with earliness-tardiness (E/T) penalties is motivated by the just-in-time (JIT) philosophy, which supports the notion that earliness, as well as tardiness, should be discouraged. In this work, we consider several scheduling problems. We begin by generalizing a known polynomial time algorithm that calculates an optimal schedule for a given sequence of tasks, on a single machine, assuming that the tasks have distinct E/T penalty weights, distinct processing times and distinct due dates. We then present new results to problems, where tasks have common processing times. We also introduce a new concept in E/T scheduling problems, where we allow the non-execution of tasks and consequently, are penalized for each non-executed task. The notion of task's non-execution, coincides with the JIT philosophy in that every violation or a breach of an agreement, should be penalized. We develop polynomial time algorithms for special cases in E/T scheduling problems with non-execution penalties.

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

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

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

[4]  Ronald D. Armstrong,et al.  Single machine scheduling to minimize mean absolute lateness: A heuristic solution , 1990, Comput. Oper. Res..

[5]  Wlodzimierz Szwarc,et al.  Optimal timing schedules in earliness-tardiness single machine sequencing , 1995 .

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

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

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

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

[10]  Jae Young Choi,et al.  A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights , 1995, Comput. Oper. Res..

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

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

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

[14]  Maged M. Dessouky,et al.  Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties , 1998, Math. Oper. Res..

[15]  Ross J. W. James,et al.  A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem , 1997 .

[16]  B. J. Lageweg,et al.  Computer aided complexity classification of combinatorial problems : (preprint) , 1981 .

[17]  V. Sridharan,et al.  Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review , 2000, Oper. Res..

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

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

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

[21]  Candace Arai Yano,et al.  Minimizing mean tardiness and earliness in single machine scheduling problems with unequal due-dates , 1994 .

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

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

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

[25]  G HallNicholas,et al.  Earliness-tardiness scheduling problems , 1991 .

[26]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..

[27]  Warren B. Powell,et al.  A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem , 1999, Eur. J. Oper. Res..

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

[29]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

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

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

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

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

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

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

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

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

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

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