Multi-machine Scheduling with Variance Minimization

@article{Cai1998MultimachineSW,
  title={Multi-machine Scheduling with Variance Minimization},
  author={Xiaoqiang Cai and T. C. Edwin Cheng},
  journal={Discrete Applied Mathematics},
  year={1998},
  volume={84},
  pages={55-70}
}
This paper addresses the problem of scheduling n jobs on m identical parallel machines so as to minimize the completion time variance. Properties of optimal solutions are derived first. Then, complexity results are obtained, which show that the problem is NP-complete in the strong sense when m is arbitrary, and NP-complete in the ordinary sense when m is fixed. Two algorithms are proposed. The first algorithm can generate an optimal solution in time O(n2”P”(P P,)“-‘/[m”(m l)!]*), w h ere P is… CONTINUE READING

References

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

Variance minimization in single machine sequencing problems

  • M. E. Muller Merten
  • Discrete Appl . Math .
  • 1995

Minimizing the flow - time variance in single - machine systems

  • Y. P. Gupta Gupta, C. R. Bettor
  • Discrete and Combinatorial Mathematics
  • 1994

Proof of the conjecture of Schrage about the completion time variance problem, Oper

  • N. Hall, W. Kubiak
  • Res. Lett
  • 1991

Bettor, Minimizing the flow-time variance in single-machine systems

  • M. C. Gupta, C.R.Y.P. Gupta
  • J. Oper. Res. Sot
  • 1990

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

  • W. Kubiak Hall
  • J . Oper . Res . Sot .
  • 1990

Minimizing variation of flow time in single machine systems

  • J. J. Kanet
  • Management Sci
  • 1981

Similar Papers

Loading similar papers…