This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output.Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic sequencing problems is dropped: the one to one correspondence between clients and jobs.It is shown that the corresponding cooperative games are balanced for specific types of cost criteria.
|Place of Publication||Tilburg|
|Number of pages||11|
|Publication status||Published - 2004|
|Name||CentER Discussion Paper|
- game theory
- cooperative games