Completion time variance minimization on a single machine is difficult

  title={Completion time variance minimization on a single machine is difficult},
  author={Wieslaw Kubiak},
  journal={Oper. Res. Lett.},
Consider a single machine and, n + 1 independent jobs with processing times: P1 -< " " " < Pn <en+ 1, all available for processing at time zero. The problem is to schedule the jobs nonpreemptively on the machine in such a way that the variance of job completion time is minimized. This model was originally proposed by Merten and Muller [11]. It was motivated by computer file organization problems where it is important to minimize the variance of retrieval times for data files references by the… CONTINUE READING
45 Citations
13 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 45 extracted citations


Publications referenced by this paper.
Showing 1-10 of 13 references

Proof of a conjecture of Schrage about the completion time variance problem

  • N. G. Hall, W. Kubiak
  • Oper. Res
  • 1991
1 Excerpt

Variance minimization in single machine systems: Complexity and algorithm", Research Report, Department of Mathematics, University of Western Australia

  • X. Cai
  • 1991
1 Excerpt

SWEAT - A program for a scheduling problem with earliness and tardiness penalties

  • H. G. Kahlbacher
  • Europ. J. Oper. Res
  • 1989
1 Excerpt

Minimizing variation of flow time in single machine systems

  • J. J. Kanet
  • Management Sci
  • 1981
1 Excerpt

Minimizing waiting time variance in the single machine problem

  • S. Eilon, I. G. Chowdhury
  • Management Sci
  • 1977
1 Excerpt

Similar Papers

Loading similar papers…