Scheduling to minimize weighted earliness and tardiness about a common due-date

Abstract This paper examines the problem of sequencing a set of independent jobs on a single processor so as to minimize the sum of weighted absolute deviations of job completion times about a specified due-date. In contrast with prior research on this topic, no restriction is imposed on the due-date. The resulting problem is known to be computationally difficult. It is shown that the solution to this problem can be derived from solutions to different subproblems. Properties of these subproblems are identified and used to develop exact algorithm of pseudo-polynomial complexity. The same algorithms are modified to yield a fully polynomial approximation scheme with a constant performance guarantee. The paper also discusses interesting special cases which are amenable to easier solutions.

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

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

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

[4]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

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

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

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

[8]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[23]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

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