Sequencing Games with Controllable Processing Time

S. van Velzen

Research output: Working paperDiscussion paperOther research output

303 Downloads (Pure)


In this paper we study a class of cooperative sequencing games that arise from sequencing situations in which the processing times are not fixed.We show that these games are balanced by obtaining two core elements that depend only on the optimal schedule for the grand coalition.Furthermore we show that, although these games are not convex in general, many marginal vectors are core elements. We also consider convexity for special instances of the sequencing situation.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages23
Publication statusPublished - 2003

Publication series

NameCentER Discussion Paper


  • cooperative games


Dive into the research topics of 'Sequencing Games with Controllable Processing Time'. Together they form a unique fingerprint.

Cite this