Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints

We present polylogarithmic approximations for the R|prec|Cmax and R|prec|∑jwjCj problems, when the precedence constraints are “treelike” – i.e., when the undirected graph underlying the precedences is a forest. We also obtain improved bounds for the weighted completion time and flow time for the case of chains with restricted assignment – this generalizes the job shop problem to these objective functions. We use the same lower bound of “congestion+dilation”, as in other job shop scheduling approaches. The first step in our algorithm for the R|prec|Cmax problem with treelike precedences involves using the algorithm of Lenstra, Shmoys and Tardos to obtain a processor assignment with the congestion + dilation value within a constant factor of the optimal. We then show how to generalize the random delays technique of Leighton, Maggs and Rao to the case of trees. For the weighted completion time, we show a certain type of reduction to the makespan problem, which dovetails well with the lower bound we employ for the makespan problem. For the special case of chains, we show a dependent rounding technique which leads to improved bounds on the weighted completion time and new bicriteria bounds for the flow time.

[1]  Klaus Jansen,et al.  Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints , 2003, PPAM.

[2]  David B. Shmoys,et al.  Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.

[3]  Maxim Sviridenko,et al.  Approximation algorithms for shop scheduling problems with minsum objective , 2002 .

[4]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[5]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..

[6]  Gerhard J. Woeginger,et al.  Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

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

[8]  Randeep Bhatia,et al.  Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997) , 1998, SIGA.

[9]  Klaus Jansen,et al.  Improved approximation schemes for scheduling unrelated parallel machines , 1999, STOC '99.

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

[11]  Dimitris Bertsimas,et al.  On dependent randomized rounding algorithms , 1999, Oper. Res. Lett..

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

[13]  Sanjeev Khanna,et al.  Approximation Algorithms for Minimizing AverageWeighted Completion Time , 2004, Handbook of Scheduling.

[14]  Leslie A. Hall,et al.  Approximation algorithms for scheduling , 1996 .

[15]  Christian Scheideler,et al.  Improved Bounds for Acyclic Job Shop Scheduling , 2002, Comb..

[16]  Martin Skutella,et al.  The power of -points in preemptive single machine scheduling , 2002 .

[17]  Michael E. Saks,et al.  Trees and Euclidean metrics , 1998, STOC '98.

[18]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[19]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 1997, STOC '97.

[20]  Klaus Jansen,et al.  Makespan minimization in job shops: a polynomial time approximation scheme , 1999, STOC '99.

[21]  Fabián A. Chudak,et al.  Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.

[22]  Aravind Srinivasan,et al.  Better approximation guarantees for job-shop scheduling , 1997, SODA '97.

[23]  Michael A. Bender,et al.  An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines , 2001, J. Algorithms.

[24]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

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

[26]  Jeffrey Scott Vitter,et al.  e-approximations with minimum packing constraint violation (extended abstract) , 1992, STOC '92.

[27]  Ashish Goel,et al.  Multi-processor scheduling to minimize flow time with ε resource augmentation , 2004, STOC '04.