Minimization of squared deviation of completion times about a common due date

We discuss a non-preemptive single-machine job sequencing problem where the objective is to minimize the sum of squared deviation of completion times of jobs from a common due date. There are three versions of the problem--tightly restricted, restricted and unrestricted. Separate dynamic programming formulations have already been suggested for each of these versions, but no unified approach is available. We have proposed a pseudo-polynomial DP solution and a polynomial heuristic for general instance. Computational results show that tightly restricted instances of up to 600 jobs can be solved in less than 6 s. General instances of up to 80 jobs take less than 2s.

[1]  Anup K. Sen,et al.  Single machine weighted earliness-tardiness penalty problem with a common due date , 2001, Comput. Oper. Res..

[2]  Jose A. Ventura,et al.  Minimizing single-machine completion time variance , 1995 .

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

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

[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]  Prabuddha De,et al.  Scheduling about a common due date with earliness and tardiness penalties , 1990, Comput. Oper. Res..

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

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

[9]  Xiaoqiang Cai,et al.  Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem , 1999 .

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

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

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

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

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

[15]  T. C. Edwin Cheng,et al.  Multi-machine Scheduling with Variance Minimization , 1998, Discret. Appl. Math..

[16]  Jose A. Ventura,et al.  Scheduling about a given common due date to minimize mean squared deviation of completion times , 1996 .

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

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

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