A simple optimal algorithm for scheduling variable-sized requests

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.