Optimal Preemptive Scheduling of Two Unrelated Processors
Published Online:1 Aug 1990https://doi.org/10.1287/ijoc.2.3.219
Abstract
The problem of constructing makespan-optimal preemptive schedules for n independent jobs on m unrelated parallel processors is discussed. For the case of two processors, we present a linear time algorithm to construct optimal schedules. The schedules generated by our algorithm have at most two preemptions.
INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
