Abstract
We present polylogarithmic approximations for the R|prec|C max and R|prec|∑ j w j C j 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|C max 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertsimas, D., Teo, C.-P., Vohra, R.: On Dependent Randomized Rounding Algorithms. Operations Research Letters 24(3), 105–114 (1999)
Chekuri, C., Bender, M.: An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. Journal of Algorithms 41, 212–224 (2001)
Chekuri, C., Khanna, S.: Approximation algorithms for minimizing weighted completion time. Handbook of Scheduling (2004)
Chudak, F.A., Shmoys, D.B.: Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Journal of Algorithms 30(2), 323–343 (1999)
Feige, U., Scheideler, C.: Improved bounds for acyclic job shop scheduling. Combinatorica 22, 361–399 (2002)
Goldberg, L.A., Paterson, M., Srinivasan, A., Sweedyk, E.: Better approximation guarantees for job-shop scheduling. SIAM Journal on Discrete Mathematics 14, 67–92 (2001)
Hall, L.: Approximation Algorithms for Scheduling. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, PWS Press (1997)
Hall, L., Schulz, A., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Offline and online algorithms. Mathematics of Operations Research 22, 513–544 (1997)
Jansen, K., Porkolab, L.: Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. Proc. ACM Symposium on Theory of Computing (STOC), pp. 408–417 (1999)
Jansen, K., Solis-oba, R.: Scheduling jobs with chain precedence constraints. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2004. LNCS, vol. 3019, pp. 105–112. Springer, Heidelberg (2003)
Jansen, K., Solis-Oba, R., Sviridenko, M.: Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. In: Proc. ACM Symposium on Theory of Computing (STOC), pp. 394–399 (1999)
Leonardi, S., Raz, D. In: Approximating total flow time on parallel machines. In: Proc. ACM Symposium on Theory of Computing, pp. 110–119 (1997)
Lenstra, J.K., Shmoys, D.B., Tardos, É.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46, 259–271 (1990)
Leighton, F.T., Maggs, B., Rao, S.: Packet routing and jobshop scheduling in O(congestion + dilation) Steps. Combinatorica 14, 167–186 (1994)
Leighton, F.T., Maggs, B., Richa, A.: Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica 19, 375–401 (1999)
Lin, J.H., Vitter, J.S.: ε-approximations with minimum packing constraint violation. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 771–782 (1992)
Linial, N., Magen, A., Saks, M.E.: Trees and Euclidean Metrics. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 169–175 (1998)
Panconesi, A., Srinivasan, A.: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM Journal on Computing 26, 350–368 (1997)
Queyranne, M., Sviridenko, M.: Approximation algorithms for shop scheduling problems with minsum objective. Journal of Scheduling 5, 287–305 (2002)
Schulz, A., Skutella, M.: The power of α-points in preemptive single machine scheduling. Journal of Scheduling 5(2), 121–133 (2002)
Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling 2, 203–213 (1999)
Shmoys, D.B., Stein, C., Wein, J.: Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing 23, 617–632 (1994)
Skutella, M.: Convex quadratic and semidefinite relaxations in scheduling. Journal of the ACM 46(2), 206–242 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A. (2005). Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2005 2005. Lecture Notes in Computer Science, vol 3624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538462_13
Download citation
DOI: https://doi.org/10.1007/11538462_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28239-6
Online ISBN: 978-3-540-31874-3
eBook Packages: Computer ScienceComputer Science (R0)