Mathematical Methods of Operations Research

, Volume 63, Issue 1, pp 53–62

Sequencing games without initial order

Authors

  • Flip Klijn
    • Institut d’Anàlisi Econòmica (CSIC)Campus UAB
    • Facultad de EconomíaUniversidad de Vigo
Original Article

DOI: 10.1007/s00186-005-0012-x

Cite this article as:
Klijn, F. & Sánchez, E. Math Meth Oper Res (2006) 63: 53. doi:10.1007/s00186-005-0012-x

Abstract

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.

Keywords

SequencingCooperative games

JEL Classification

C71C78

Copyright information

© Springer-Verlag 2005