| Article ID: | iaor20052162 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 2 |
| Start Page Number: | 143 |
| End Page Number: | 150 |
| Publication Date: | Mar 2005 |
| Journal: | Operations Research Letters |
| Authors: | Moukrim Aziz, Quilliot Alain |
| Keywords: | combinatorial analysis |
In this paper, we consider the preemptive scheduling problem on a fixed number of identical parallel machines. We present a polynomial-time algorithm for finding a minimal length schedule for an order class which contains properly interval orders.