Abstract.
This paper addresses scheduling problems for tasks with release and execution times. We present a number of efficient and easy to implement algorithms for constructing schedules of minimum makespan when the number of distinct task execution times is fixed. For a set of independent tasks, our algorithm in the single processor case runs in time linear in the number of tasks; with precedence constraints, our algorithm runs in time linear in the sum of the number of tasks and the size of the precedence constraints. In the multi-processor case, our algorithm constructs minimum makespan schedules for independent tasks with uniform execution times. The algorithm runs in O(n log m) time where n is the number of tasks and m is the number of processors.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received September 25, 1997; revised June 11, 1998.
Rights and permissions
About this article
Cite this article
Rosenkrantz, D., Yu, L. & Ravi, S. Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. Algorithmica 30, 83–100 (2001). https://doi.org/10.1007/s004530010079
Issue Date:
DOI: https://doi.org/10.1007/s004530010079