Skip to main content
Log in

On a New Class of Parallel Sequencing Situations and Related Games

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper considers a special class of sequencing situations with two parallel machines in which each agent has precisely two jobs to be processed, one on each machine. The costs of an agent depend linearly on the final completion time of his jobs. We describe a procedure that provides an optimal processing order of the jobs for some particular classes. Furthermore, we study cooperative games arising from these sequencing situations. Our main result will be on the balancedness of these games.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P. Borm, G. Fiestras-Janeiro, H. Hamers, E. Sánchez and M. Voorneveld, On the convexity of games corresponding to sequencing situations with due dates, European Journal of Operational Research 136 (2002) 616-634.

    Google Scholar 

  2. P. Calleja, P. Borm, H. Hamers and F. Klijn, On a new class of parallel sequencing situations and related games, CentER Discussion Paper 2001-03, Tilburg University, The Netherlands.

  3. I. Curiel, G. Pederzoli and S. Tijs, Sequencing games, European Journal of Operational Research 40 (1989) 344-351.

    Google Scholar 

  4. I. Curiel, J. Potters, V. Rajendra Prasad, S. Tijs and B. Veltman, Cooperation in one machine sequencing, Zeitschrift für Operations Research 38 (1993) 113-129.

    Google Scholar 

  5. I. Curiel, J. Potters, V. Rajendra Prasad, S. Tijs and B. Veltman, Sequencing and cooperation, Operation Research 42 (1994) 566-568.

    Google Scholar 

  6. H. Hamers, P. Borm and S. Tijs, On games corresponding to sequencing situations with ready times, Mathematical Programming 70 (1995) 1-13.

    Google Scholar 

  7. H. Hamers, F. Klijn and J. Suijs, On the balancedness of multimachine sequencing games, European Journal of Operational Research 119 (1999) 678-691.

    Google Scholar 

  8. A. Van den Nouweland, M. Krabbenborg and J. Potters, Flowshops with a dominant machine, European Journal of Operational Research 62 (1992) 38-46.

    Google Scholar 

  9. W. Smith, Various optimizers for single-stage production, Naval Research Logistic Quarterly 3 (1956) 59-66.

    Google Scholar 

  10. S. Tijs, T. Parthasarathy, J. Potters and V. Rajendra Prassad, Permutation games, OR Spectrum 6 (1984), 119-123.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Calleja, P., Borm, P., Hamers, H. et al. On a New Class of Parallel Sequencing Situations and Related Games. Annals of Operations Research 109, 265–277 (2002). https://doi.org/10.1023/A:1016360404530

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016360404530

Navigation