Mathematical Methods of Operations Research

, Volume 63, Issue 1, pp 53–62 | Cite as

Sequencing games without initial order

  • Flip Klijn
  • Estela SánchezEmail author
Original Article


In this note we study uncertainty sequencing situations, i.e., one-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et al. (Eur J Oper Res 40:344–351, 1989). Moreover, we propose and characterize two simple cost allocation rules for uncertainty sequencing situations with equal processing times.


Sequencing Cooperative games 

JEL Classification

C71 C78 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Curiel I, Hamers H, Klijn F. (2002) Sequencing games: a survey. In: Borm P, Peters H. (ed). Chapters in game theory: in honor of Stef Tijs. Kluwer, Boston, pp. 27–50Google Scholar
  2. Curiel I, Pederzoli G, Tijs S (1989) Sequencing games. Eur J Oper Res 40:344–351zbMATHCrossRefMathSciNetGoogle Scholar
  3. Shapley L (1953) A value for n−person games. In: Tucker A, Kuhn H. (ed). Contributions to the theory of games. Princeton University Press, Princeton, pp 307–317Google Scholar
  4. Smith W (1956) Various optimizers for single-stage production. Naval Res Logist Q 3:59–66CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2005

Authors and Affiliations

  1. 1.Institut d’Anàlisi Econòmica (CSIC)Campus UABBellaterra (Barcelona)Spain
  2. 2.Facultad de EconomíaUniversidad de VigoVigo (Pontevedra)Spain

Personalised recommendations