Balancedness of Sequencing Games with Multiple Parallel Machines

  title={Balancedness of Sequencing Games with Multiple Parallel Machines},
  author={Marco Slikker},
  journal={Annals OR},
We provide simple constructive proofs of balancedness of classes of m-PS games, which arise from sequencing situations with m parallel machines. This includes the setting that is studied by Calleja et al. (2001) and Calleja et al. (2002), who provided a complex constructive proof and a simple non-constructive proof of balancedness of a restricted class of 2-PS games, respectively. Furthermore, we provide two counterexamples to illustrate that our balancedness results cannot be extended to a… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


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

Sequencing n products involving m independent jobs on m machines

  • A. Pritsker, L. Miller, R. Zinkl
  • A.I.I.E. Transactions, 3:49–60.
  • 1971
Highly Influential
7 Excerpts

Certain applications of the methods of linear programming to the theory of cooperative games (In Russian)

  • O. Bondareva
  • Problemy Kibernetiki, 10:119–139.
  • 1963
Highly Influential
5 Excerpts

Sequencing games: a survey

  • I. Curiel, H. Hamers, F. Klijn
  • Borm, P. and Peters, H., editors, Chapters in…
  • 2002
2 Excerpts

The PEGS-rule for probabilistic sequencing situations

  • H. Hamers, M. Slikker
  • Cahiers du Centre d’Études de Recherche Op…
  • 1995
2 Excerpts

Flow-shops with a dominant machine

  • A. van den Nouweland, M. Krabbenborg, J. Potters
  • European Journal of Operational Research,
  • 1992
2 Excerpts

Sequencing games

  • I. Curiel, G. Pederzoli, S. Tijs
  • European Journal of Operational Research, 40:344…
  • 1989
2 Excerpts

Similar Papers

Loading similar papers…