| Article ID: | iaor1997980 |
| Country: | Netherlands |
| Volume: | 69 |
| Issue: | 3 |
| Start Page Number: | 471 |
| End Page Number: | 483 |
| Publication Date: | Sep 1995 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Tijs Stef, Borm Peter, Hamers Herbert |
| Keywords: | scheduling |
This paper considers the special class of cooperative sequencing games that arise from one-machine sequencing situations in which all jobs have equal processing times and the ready time of each job is a multiple of the processing time. By establishing relations between optimal orders of subcoalitions, it is shown that each sequencing game within this class is convex.