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.
|Place of Publication||Tilburg|
|Number of pages||19|
|Publication status||Published - 2010|
|Name||CentER Discussion Paper|
- preparation times
- sequencing situations
- cooperative game theory