Job Scheduling, Cooperation, and Control
CentER Discussion Paper No. 2004-65
10 Pages Posted: 14 Oct 2004
Date Written: July 2004
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.
Keywords: Scheduling, cooperation, game theory, cooperative games
JEL Classification: C71
Suggested Citation: Suggested Citation