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

Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In 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 an important basic open problem in scheduling. The proof of the lower bound is based on a clever iterative construction while the rounding technique we use to prove the upper bound is an adaptation of Shmoys and Tardos' rounding for the generalized assignment problem. In the second part of the paper we apply this adaptation to the more general setting in 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.

[1]  Sandy Irani,et al.  Bounding the power of preemption in randomized scheduling , 1995, STOC '95.

[2]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[3]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[4]  José R. Correa,et al.  Single-Machine Scheduling with Precedence Constraints , 2005, Math. Oper. Res..

[5]  Fabián A. Chudak,et al.  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine , 1999, Oper. Res. Lett..

[6]  Han Hoogeveen,et al.  Non-Approximability Results for Scheduling Problems with Minsum Criteria , 1998, INFORMS J. Comput..

[7]  Gerhard J. Woeginger,et al.  A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines , 2000, Math. Oper. Res..

[8]  Zhi-Long Chen,et al.  SUPPLY CHAIN SCHEDULING: ASSEMBLY SYSTEMS , 2000 .

[9]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[10]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[11]  Marc E. Posner,et al.  Scheduling Parallel Machines for the Customer Order Problem , 2003, J. Sched..

[12]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[13]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[14]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[15]  Shimon Even,et al.  Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .

[16]  Subhash Khot,et al.  Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems , 2010, ICALP.

[17]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[18]  Martin Skutella,et al.  Scheduling Unrelated Machines by Randomized Rounding , 2002, SIAM J. Discret. Math..

[19]  Subhash Khot.  On the power of unique 2-prover 1-round games , 2002, STOC '02.

[20]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[21]  J. Vitter,et al.  Approximations with Minimum Packing Constraint Violation , 1992 .

[22]  Joseph Y.-T. Leung,et al.  Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines , 2007, Inf. Process. Lett..

[23]  Gerhard J. Woeginger.  On the approximability of average completion time scheduling under precedence constraints , 2003, Discret. Appl. Math..

[24]  Martin Skutella,et al.  Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[25]  Maurice Queyranne,et al.  Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem , 2003, Oper. Res..

[26]  Monaldo Mastrolilli,et al.  Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem , 2006, ESA.

[27]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[28]  Joseph Y.-T. Leung,et al.  Scheduling orders for multiple product types to minimize total weighted completion time , 2007, Discret. Appl. Math..

[29]  Hadas Shachnai,et al.  Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints , 2002, Algorithmica.

[30]  Zhi-Long Chen,et al.  Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems , 2007, Oper. Res..

[31]  Subhash Khot,et al.  Optimal Long Code Test with One Free Bit , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[32]  Maurice Queyranne,et al.  Structure of a simple scheduling polyhedron , 1993, Math. Program..

[33]  Joseph Y.-T. Leung,et al.  Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel , 2006 .

[34]  Rajeev Motwani,et al.  Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine , 1999, Discret. Appl. Math..

[35]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[36]  O. Svensson,et al.  Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling , 2007, FOCS 2007.

[37]  Ola Svensson,et al.  Minimizing the sum of weighted completion times in a concurrent open shop , 2010, Oper. Res. Lett..

[38]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[39]  Ola Svensson,et al.  Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut , 2011, SIAM J. Comput..