Abstract
Scheduling precedence constrained jobs on identical parallel machines is a well investigated problem with many applications. AND/OR-networks constitute a useful generalization of standard precedence constraints where certain jobs can be executed as soon as at least one of their direct predecessors is completed. For the problem of scheduling AND/OR-networks on parallel machines, we present a 2-approximation algorithm for the objective of minimizing the makespan. The main idea of the algorithm is to transform the AND/OR constraints into standard constraints. For the objective of minimizing the total weighted completion time on one machine, scheduling AND/OR-networks is as hard to approximate as Label Cover. We show that list scheduling with shortest processing time rule is an \(O(\sqrt{n})\)-approximation for unit weights on one machine and an n-approximation for arbitrary weights.
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
Adelson-Velsky, G.M., Levner, E.: Project scheduling in AND/OR graphs: A generalization of Dijkstra’s algorithm. Technical report, Department of Computer Science, Holon Academic Institute of Technology, Holon, Israel (1999)
Chekuri, C., Motwani, R.: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics 98, 29–38 (1999)
Chudak, F., Hochbaum, D.S.: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Operations Research Letters 25, 199–204 (1999)
Dinur, I., Safra, S.: On the hardness of approximating label-cover. Electronic Colloquium on Computational Complexity (ECCC) Technical Report TR99-015, School of Mathematical Sciences, Tel Aviv University (1999)
Garey, M.J., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP Completeness. Freemann, New York (1979)
Gillies, D.W., Liu, J.W.S.: Greed in recource scheduling. Acta Informatica 28, 755–775 (1991)
Gillies, D.W., Liu, J.W.S.: Scheduling tasks with AND/OR precedence constraints. SIAM Journal on Computing 24, 797–810 (1995)
Goldwasser, M.H., Motwani, R.: Intractability of assembly sequencing: Unit disks in the plane. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 307–320. Springer, Heidelberg (1997)
Goldwasser, M.H., Motwani, R.: Complexity measures for assembly sequences. International Journal of Computational Geometry & Applications 9, 371–417 (1999)
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287–326 (1979)
Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. In: Mathematics of Operations Research, pp. 513–549 (1997)
Kääb, V.: Scheduling with AND/OR-Networks. PhD thesis, Technische Universität Berlin, Germany (2003)
Knuth, D.E.: A generalization of Dijkstra’s algorithm. Information Processing Letters 6, 1–5 (1977)
Lawler, E.L.: Sequencing jobs to minimize total weighted completion time. Annals of Discrete Mathematics 2, 75–90 (1978)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Logistics of Production and Inventory. Handbooks in Operations Research and Management Science, vol. 4, pp. 445–522. North-Holland, Amsterdam (1993)
Margot, F., Queyranne, M., Wang, Y.: Decompositions, network flows, and a precedence constrained single machine scheduling problem. Technical Report 2000-29, Department of Mathematics, University of Kentucky, Lexington (2000)
Möhring, R.H., Skutella, M., Stork, F.: Scheduling with AND/OR precedence constraints. Technical Report 689/2000, Technische Universität Berlin, Department ofMathematics, Germany (2000); To appear in SIAM Journal on Computing
Munier, A., Queyranne, M., Schulz, A.S.: Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 367–383. Springer, Heidelberg (1998)
Smith, W.E.: Various optimizers for single-stage production. Naval Research Logistics Quarterly 3, 59–66 (1956)
Woeginger, G.J.: On the approximability of average completion time scheduling under precedence constraints. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 887–897. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erlebach, T., Kääb, V., Möhring, R.H. (2004). Scheduling AND/OR-Networks on Identical Parallel Machines. In: Solis-Oba, R., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2003. Lecture Notes in Computer Science, vol 2909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24592-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24592-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21079-5
Online ISBN: 978-3-540-24592-6
eBook Packages: Springer Book Archive