Sequencing Games with Repeated Players

M.A. Estevez Fernandez, P.E.M. Borm, P. Calleja, H.J.M. Hamers

Research output: Working paperDiscussion paperOther research output

288 Downloads (Pure)

Abstract

Two classes of one machine sequencing situations are considered in which each job corresponds to exactly one player but a player may have more than one job to be processed, so called RP(repeated player) sequencing situations.In max-RP sequencing situations it is assumed that each player's cost function is linear with respect to the maximum completion time of his jobs, whereas in min-RP sequencing situations the cost functions are linear with respect to the minimum completion times.For both classes, following explicit procedures to go from the initial processing order to an optimal order for the coalition of all players, equal gain splitting rules are defined.It is shown that these rules lead to core elements of the associated RP sequencing games.Moreover, it is seen that min-RP sequencing games are convex.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages17
Volume2004-128
Publication statusPublished - 2004

Publication series

NameCentER Discussion Paper
Volume2004-128

Keywords

  • cooperative game theory
  • sequencing
  • equal gain splitting
  • core
  • convexity

Fingerprint Dive into the research topics of 'Sequencing Games with Repeated Players'. Together they form a unique fingerprint.

Cite this