Annals of Operations Research

, Volume 137, Issue 1, pp 161–175 | Cite as

On the Convexity of Precedence Sequencing Games

Article

Abstract

In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. We show that these sequencing games are convex if the initial order of the jobs is a concatenation of chains.

Keywords

cooperative games sequencing situations 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borm, P., G. Fiestras-Janeiro, H. Hamers, E. Sanchez, and M. Voorneveld. (2002). “On the Convexity of Sequencing Games with DueDates.” European Journal of Operational Research 136, 616–634.CrossRefGoogle Scholar
  2. Calleja, P., P. Borm, H. Hamers, F. Klijn, and M. Slikker. (2002). “On a New Class of ParallelSequencing Situations and Related Games.” Annals of Operations Research 109, 265–277.CrossRefGoogle Scholar
  3. Curiel, I., G. Pederzoli, and S. Tijs. (1989). “Sequencing Games.” European Journal of Operational Research 40, 344–351.CrossRefGoogle Scholar
  4. Curiel, I., J. Potters, V. Rajendra Prasad, S. Tijs, and B. Veltman. (1994). “Sequencing and cooperation.” Operations Research 42, 566–568.Google Scholar
  5. Hamers, H., P. Borm, and S. Tijs. (1995). “On Games Corresponding to Sequencing Situations with Ready Times.” Mathematical Programming 70, 1–13.Google Scholar
  6. Hamers, H., F. Klijn, and J. Suijs. (1999). “On the Balancedness of Multimachine Sequencing Games.” European Journal of Operations Research 119, 678–691.CrossRefGoogle Scholar
  7. Hamers, H., J. Suijs, S. Tijs, and P. Borm. (1996) “The Split Core for Sequencing Games.” Games and Economic Behavior 15, 165–176.CrossRefGoogle Scholar
  8. Ichiishi, T. (1981). “Supermodularity: Applications to Convex Games and the Greedy Algorithm for LP.” Journal of Economic Theory 25, 283–286.CrossRefGoogle Scholar
  9. Maschler, M., B. Peleg, and L. Shapley. (1972). “The Kernel and Bargaining Set of Convex Games.” International Journal of Game Theory 2, 73–93.Google Scholar
  10. van den Nouweland, A., M. Krabbenborg, and J. Potters. (1992). “Flowshops with a Dominant Machine.” European Journal of Operations Research 62, 38–46.CrossRefGoogle Scholar
  11. Shapley, L. (1971). “Cores of Convex Games.” International Journal of Game Theory 1, 11–26.CrossRefGoogle Scholar
  12. Sidney, J. (1975). “Decomposition Algorithms or Single-Machine Sequencing with Precedence Relations andDeferral Costs.” Operations Research 23, 283–298.CrossRefGoogle Scholar
  13. Tijs, S. (1981). “Bounds for the Core and the τ-Value.” In O. Moeschlin and D. Pallaschke (eds.), Game Theory and Mathematical Economics,Amsterdam: North Holland Publishing Company, pp. 123–132.Google Scholar
  14. van Velzen B. and H. Hamers. (2003). “On the Balancedness of Relaxed Sequencing Games.” Mathematical Methods of Operations Research 57, 287–297.CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Center and Department of Econometrics and Operational ResearchTilburg UniversityThe Netherlands
  2. 2.Institut d'Anàlisi Econòmica (CSIC)Bellaterra (Barcelona)
  3. 3.Center and Department of Econometrics and Operational ResearchTilburg UniversityThe Netherlands

Personalised recommendations