Uniform machine scheduling of unit-time jobs subject to resource constraints

✍ Scribed by Mikhail Y. Kovalyov; Yakov M. Shafransky

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 350 KB
• Volume: 84
• Category: Article
• ISSN: 0166-218X
• DOI: 10.1016/s0166-218x(97)00138-8

✦ Synopsis

The problem of scheduling a set of unit-time jobs on M uniform machines is studied. Some jobs may require a unit of an additional single resource during their execution. The resource is renewable but the total resource consumption is limited by the same value at each time instant. The objective is to find a feasible schedule minimizing the maximum job completion time. We show that an approach suggested in the literature to solve this problem is incorrect. Then we present an O(m log m) algorithm for the problem with no machine idle times and a linear-time algorithm for the problem with identical machines.