Elsevier

Information Processing Letters

Volume 68, Issue 6, 30 December 1998, Pages 291-293
Information Processing Letters

A simple optimal algorithm for scheduling variable-sized requests

https://doi.org/10.1016/S0020-0190(98)00177-XGet rights and content

Abstract

In this paper, an optimal algorithm is found for the following scheduling problem: given N parallel channels that can each accommodate one request at a time and a set of requests that require a channel at a specific start time and for a particular holding time, what is the best way to schedule these requests in order to accommodate the most requests? A proof of optimality is given. The algorithm is conceptually and computationally simple. This scheduling problem has application in resource allocation for communication networks.

References (7)

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 Research
    Citation 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.

View full text