Skip to main content
SpringerLink
Log in

On the Convexity of Precedence Sequencing Games

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

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.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Curiel, I., G. Pederzoli, and S. Tijs. (1989). “Sequencing Games.” European Journal of Operational Research 40, 344–351.

    Article  Google Scholar 

  • Curiel, I., J. Potters, V. Rajendra Prasad, S. Tijs, and B. Veltman. (1994). “Sequencing and cooperation.” Operations Research 42, 566–568.

    Google Scholar 

  • Hamers, H., P. Borm, and S. Tijs. (1995). “On Games Corresponding to Sequencing Situations with Ready Times.” Mathematical Programming 70, 1–13.

    Google Scholar 

  • Hamers, H., F. Klijn, and J. Suijs. (1999). “On the Balancedness of Multimachine Sequencing Games.” European Journal of Operations Research 119, 678–691.

    Article  Google Scholar 

  • Hamers, H., J. Suijs, S. Tijs, and P. Borm. (1996) “The Split Core for Sequencing Games.” Games and Economic Behavior 15, 165–176.

    Article  Google Scholar 

  • Ichiishi, T. (1981). “Supermodularity: Applications to Convex Games and the Greedy Algorithm for LP.” Journal of Economic Theory 25, 283–286.

    Article  Google Scholar 

  • 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 

  • van den Nouweland, A., M. Krabbenborg, and J. Potters. (1992). “Flowshops with a Dominant Machine.” European Journal of Operations Research 62, 38–46.

    Article  Google Scholar 

  • Shapley, L. (1971). “Cores of Convex Games.” International Journal of Game Theory 1, 11–26.

    Article  Google Scholar 

  • Sidney, J. (1975). “Decomposition Algorithms or Single-Machine Sequencing with Precedence Relations andDeferral Costs.” Operations Research 23, 283–298.

    Article  Google Scholar 

  • 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 

  • van Velzen B. and H. Hamers. (2003). “On the Balancedness of Relaxed Sequencing Games.” Mathematical Methods of Operations Research 57, 287–297.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center and Department of Econometrics and Operational Research, Tilburg University, The Netherlands

    Herbert Hamers

  2. Institut d'Anàlisi Econòmica (CSIC), Campus UAB, 08193, Bellaterra (Barcelona), Spain

    Flip Klijn

  3. Center and Department of Econometrics and Operational Research, Tilburg University, The Netherlands

    Bas van Velzen

Authors
  1. Herbert Hamers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Flip Klijn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bas van Velzen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Flip Klijn.

Additional information

F. Klijn's research is supported by a Ramón y Cajal contract of the Spanish Ministerio de Ciencia y Tecnología. The main part of F. Klijn's work was supported by a Marie Curie Fellowship of the European Community programme “Improving Human Research Potential and the Socio-economic Knowledge Base” under contract number HPMF-CT-2001-01232, carried out at the Departament d'Economia i d'Història Econòmica, Universitat Autònoma de Barcelona. His work is also partially supported by Research Grant BEC2002-02130 from the Spanish Ministerio de Ciencia y Tecnología and by the Barcelona Economics Program of CREA

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hamers, H., Klijn, F. & van Velzen, B. On the Convexity of Precedence Sequencing Games. Ann Oper Res 137, 161–175 (2005). https://doi.org/10.1007/s10479-005-2252-9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-005-2252-9

Keywords

Search

Navigation