| Article ID: | iaor2006298 |
| Country: | Netherlands |
| Volume: | 137 |
| Issue: | 1 |
| Start Page Number: | 161 |
| End Page Number: | 175 |
| Publication Date: | Jul 2005 |
| Journal: | Annals of Operations Research |
| Authors: | Hamers Herbert, Klijn Flip, Velzen Bas van |
| Keywords: | scheduling |
In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. We show that these sequencing games are convex if the initial order of the jobs is a concatenation of chains.