A simple optimal algorithm for scheduling variable-sized requests☆
References (7)
- et al.
Scheduling jobs with fixed start and end times
Discrete Appl. Math.
(1987) - et al.
Performance modeling of a channel reservation service
Computer Networks and ISDN Systems
(1995) - et al.
Advance reservations for predictive service in the Internet
Multimedia Systems
(1997)
There are more references available in the full text version of this article.
Cited by (1)
Fixed interval scheduling: Models, applications, computational complexity and algorithms
2007, European Journal of Operational ResearchCitation Excerpt :Therefore, it solves problem P1 in O(n log n) time. Other polynomial time algorithms for this problem can be found in Frank [40], Arkin and Silverberg [2], Yannakakis and Gavril [96], Lee and Sarrafzadeh [67], Hsiao et al. [56], Harms [52], and Lann and Mosheiov [65]. Note that the algorithms of Harms, and Lann and Mosheiov are not optimal.
- ☆
This research was supported by a grant from the Natural Sciences and Engineering Research Council of Canada.
Copyright © 1998 Published by Elsevier B.V.