Abstract
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.
Similar content being viewed by others
References
L. G. Khachian (1979) A polynomial algorithm in linear programming, Soviet Math. Dokl. 20, 191–194.
E. L. Lawler (1982) Preemptive scheduling of precedence constrained jobs on parallel machines, in Deterministic and Stochastic Scheduling (M. A. H. Dempster, J. K. Lenstra, and A. H. G. Rinnooy Kan, eds.) D. Reidel, Dordrecht, 1982.
E. L. Lawler and J. K. Lenstra (1981) Machine scheduling with precedence constraints, in Ordered Sets (I. Rival ed.) D. Reidel, Dordrecht, pp. 655–676.
J. K. Lenstra and A. H. G. Rinnooy Kan (1984) Two open problems in precedence constrained scheduling, in Orders: Descriptions and Roles (M. Pouzet and D. Richard, eds.) Ann. Discr. Math. 23, 509–521.
C. H. Papadimitriou and M. Yannakakis (1979) Scheduling interval-ordered tasks, SIAM J. Computing 8, 405–409.
W. Poguntke (1986) Order theoretic aspects of scheduling, AMS Contemp. Math. 57, 1–32.
N. Sauer and M. G. Stone (1987) Rational preemptive scheduling, Order 4 195–206.
M. Simonnard (1966) Linear Programming (transl. by W. S. Jennell), Prentice Hall.
Author information
Authors and Affiliations
Additional information
Communicated by I. Rival
Rights and permissions
About this article
Cite this article
Sauer, N.W., Stone, M.G. Preemptive scheduling of interval orders is polynomial. Order 5, 345–348 (1989). https://doi.org/10.1007/BF00353653
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00353653