Abstract
Garey and Johnson defined an algorithm that finds minimum-lateness schedules for arbitrary graphs with unit-length tasks on two processors. Their algorithm can be easily generalised to an algorithm that constructs minimum-lateness schedules for interval orders on m processors. In this paper, we study the problem of scheduling interval orders with deadlines without neglecting the communication costs. An algorithm is presented that finds minimum-lateness schedules. Like the algorithm by Garey and Johnson, it first computes modified deadlines; these are used to assign a starting time to every task. Unlike the algorithm by Garey and Johnson, calculating a modified deadline for every individual task is not sufficient: in order to fully use the knowledge of the precedence constraints and the communication delays, the algorithm has to compute deadlines for pairs of tasks. The algorithm constructs minimum-lateness schedules in O(n 2) time.
Preview
Unable to display preview. Download preview PDF.
References
H.H. Ali and H. El-Rewini. An optimal algorithm for scheduling interval ordered tasks with communication on N processors. Journal of Computer and System Sciences, 51(2):301–307, October 1995.
M.R. Garey and D.S. Johnson. Scheduling tasks with nonuniform deadlines on two processors. Journal of the ACM, 23(6):461–467, July 1976.
J.A. Hoogeveen, J.K. Lenstra and B. Veltman. Three, four, five, six, or the complexity of scheduling with communication delays. Operations Research Letters, 16:129–137, 1994.
T.C. Hu. Parallel sequencing and assembly line problems. Operations Research, 9(6):841–848, 1961.
J.K. Lenstra, M. Veldhorst and B. Veltman. The complexity of scheduling trees with communication delays. Journal of Algorithms, 20(1):157–173, January 1996.
C.H. Papadimitriou and M. Yannakakis. Scheduling interval-ordered tasks. SIAM Journal on Computing, 8(3):405–409, August 1979.
J. Verriet. Scheduling UET, UCT dags with release dates and deadlines. Technical Report UU-CS-1995-31, Department of Computer Science, Utrecht University, September 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verriet, J. (1996). Scheduling interval ordered tasks with non-uniform deadlines. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009513
Download citation
DOI: https://doi.org/10.1007/BFb0009513
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62048-8
Online ISBN: 978-3-540-49633-5
eBook Packages: Springer Book Archive