Preparation Sequencing Situations and Related Games

E.R.M.A. Lohmann, P.E.M. Borm, M. Slikker

Research output: Working paperDiscussion paperOther research output

282 Downloads (Pure)

Abstract

In this paper preparation sequencing situations are introduced. This new type of onemachine sequencing situations assumes that before a job can start, some preparation depending on its predecessor is required. Preparation sequencing situations are first analyzed from an operations research perspective: optimality conditions are provided and an algorithm is provided to obtain an optimal order. Secondly, we analyze the allocation problem of the minimal joint cost from a game theoretic perspective. A corresponding preparation sequencing game is defined and the focus is on the core and nucleolus of such games.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages19
Volume2010-31
Publication statusPublished - 2010

Publication series

NameCentER Discussion Paper
Volume2010-31

Keywords

  • preparation times
  • sequencing situations
  • cooperative game theory
  • core
  • nucleolus

Fingerprint Dive into the research topics of 'Preparation Sequencing Situations and Related Games'. Together they form a unique fingerprint.

  • Cite this

    Lohmann, E. R. M. A., Borm, P. E. M., & Slikker, M. (2010). Preparation Sequencing Situations and Related Games. (CentER Discussion Paper; Vol. 2010-31). Operations research.