Minimizing single-machine completion time variance

In this article the problem of minimizing the completion time variance in n-job, single-machine scheduling is considered. The release times for all jobs are assumed to be zero. A new quadratic integer programming formulation is introduced. A Lagrangian relaxation LR procedure is developed to find a lower bound LB to the optimal objective value. When the number of jobs is between 100 and 500, our computational study shows that the lower bounds obtained by the LR procedure are very close to the best known objective values. A new heuristic algorithm is also described. The first phase of the heuristic algorithm is a construction procedure whose purpose is to identify a good initial sequence. The second phase is an improvement procedure based on pairwise interchanges. The new heuristic algorithm provides improved solutions compared to the best known heuristic.

[1]  Donald B. Johnson,et al.  The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns , 1982, J. Comput. Syst. Sci..

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

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

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

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

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

[7]  S. Agmon.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[8]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[9]  John J. Kanet,et al.  Minimizing Variation of Flow Time in Single Machine Systems , 1981 .

[10]  Jose A. Ventura,et al.  Computational development of a lagrangian dual approach for quadratic networks , 1991, Networks.

[11]  Wieslaw Kubiak,et al.  New Results on the Completion Time Variance Minimization , 1995, Discret. Appl. Math..

[12]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[13]  C. R. Bector,et al.  Minimizing the Flow-time Variance in Single-machine Systems , 1990 .

[14]  Wieslaw Kubiak,et al.  Proof of a conjecture of Schrage about the completion time variance problem , 1991, Oper. Res. Lett..

[15]  Paul H. Zipkin,et al.  Simple Ranking Methods for Allocation of One Resource , 1980 .

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

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

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

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

[20]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..