Scheduling about a common due date with earliness and tardiness penalties

Abstract This paper describes solution techniques for scheduling a set of independent jobs on a single machine where the objective is to minimize the mean squared deviation of the completion times about a common due date. A branch and bound algorithm is proposed and implemented using a recursive scheme. The algorithm is tested on job sets drawn from six different distributions of processing times. Computational experiments which compare this approach with the existing methodology indicate that the former is significantly faster and can solve much larger problems. A heuristic based upon the branch and bound algorithm is also presented which provides fast solutions with constant performance guarantees.

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

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

[3]  L. Schrage.  Minimizing the Time-in-System Variance for a Finite Jobset , 1975 .

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

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

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

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

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

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

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

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

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

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

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

[15]  B. J. Lageweg,et al.  Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

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

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

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