The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

Scheduling jobs oil unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems ill the area of machine scheduling. ill the first, part of the paper we prove that the power of preemption; i.e., the ratio between the makespan of an optimal nonpreemptive and an optimal preemptive schedule, is exactly 4. This result is a definite answer to all important basic open problem in scheduling. The proof of the lower bound is based oil a clever iterative construction while, the rounding technique we rise to prove the upper hound is all adaptation of Shmoys and Tardos' rounding for the generalized assignment problem. Ill the second part, of the paper we apply this adaptation to the more general setting ill which orders, Consisting of several jobs, have to be processed on unrelated parallel machines so as to minimize the sum of weighted completion times of the orders. We obtain the first constant factor approximation algorithms for the preemptive and nonpreemptive case, improving and extending a recent result by Leung et. al.