To analyze the allocation problem of the maximal cost savings of the whole group of jobs, we define and analyze a so-called corresponding cooperative family sequencing game which explicitly takes into account the maximal cost savings for any coalition of jobs. Using nonstandard techniques we prove that each family sequencing game has a non-empty core by showing that a particular marginal vector belongs to the core. Finally, we specifically analyze the case in which the initial order is family ordered.
|Place of Publication||Tilburg|
|Number of pages||28|
|Publication status||Published - 2012|
|Name||CentER Discussion Paper|
- Single-machine scheduling
- Family scheduling model
- Setup times
- Cooperative Game
- Marginal Vector.