Preemptive scheduling of interval orders is polynomial

✍ Scribed by N. W. Sauer; M. G. Stone

• Publisher: Springer Netherlands
• Year: 1989
• Tongue: English
• Weight: 188 KB
• Volume: 5
• Category: Article
• ISSN: 0167-8094
• DOI: 10.1007/bf00353653

✦ Synopsis

In 1979, Papadimitriou and Yannakakis gave a polynomial time algorithm for the scheduling of jobs requiring unit completion times when the precedence constraints form an interval order. The authors solve here the corresponding problem for preemptive scheduling (a job can be interrupted to work on more important tasks, and completed at a later time, subject to the usual scheduling constraints.) The m-machine preemptive scheduling problem is shown to have a polynomial algorithm, for both unit time and variable execution times as well, when the precedence constraints are given by an interval order.