Abstract
We study open-shop scheduling for unit jobs under precedence constraints, where if one job precedes another job then it has to be finished before the other job can start to be processed. For the three-machine open-shop to minimize the makespan, we first present a simple 5/3-approximation based on a partition of the job set into agreeable layers using the natural layered representation of the precedence graph. We then show a greedy algorithm to reduce the number of singleton-job layers, resulting in an improved partition, which leads to a 4/3-approximation. Both approximation algorithms apply to the general m-machine open-shops too.
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
References
Bräsel, H., Kluge, D., Werner, F.: A polynomial algorithm for the \([n/m/0, t_{ij}=1, tree/C_{\max }]\) open shop problem. Eur. J. Oper. Res. 72, 125–134 (1994)
Brucker, P.: Scheduling Algorithms. Springer, New York (2007). https://doi.org/10.1007/978-3-540-69516-5
Brucker, P., Jurisch, B., Jurisch, M.Z.: Open shop problems with unit time operations. Oper. Res. 37, 59–73 (1993)
Brucker, P., Knust, S.: Complexity results for scheduling problems (2009). http://www2.informatik.uni-osnabrueck.de/knust/class/
Dürr, C.: The scheduling zoo (2016). http://schedulingzoo.lip6.fr
Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23, 665–679 (1976)
Graham, R.L.: Combinatorial scheduling theory. In: Steen, L.A. (ed.) Mathematics Today Twelve Informal Essays. Springer, New York (1978). https://doi.org/10.1007/978-1-4613-9435-8_8
Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Oper. Res. 26, 22–35 (1978)
Pinedo, M.L.: Scheduling: Theory, Algorithm and Systems. Springer, New York (2016). https://doi.org/10.1007/978-3-319-26580-3
Prot, D., Bellenguez-Morinea, O.: A survey on how the structure of precedence constraints may change the complexity class of scheduling problems. J. Sched. 21, 3–16 (2018)
Sevastianov, S.V., Woeginger, G.J.: Makespan minimization in open shops: a polynomial time approximation scheme. Math. Program. 82, 191–198 (1998)
Sevastianov, S.V., Woeginger, G.J.: Linear time approximation scheme for the multiprocessor open shop problem. Discrete Appl. Math. 114, 273–288 (2001)
Tanaev, V.S., Sotskov, Y.N., Strusevich, V.A.: Scheduling Theory: Multi-Stage Systems. Springer, Heidelberg (1994). https://doi.org/10.1007/978-94-011-1192-8
Timkovsky, V.G.: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. Eur. J. Oper. Res. 149, 355–376 (2003)
Williamson, D.P., et al.: Short shop schedules. Oper. Res. 45, 288–294 (1997)
Acknowledgements
This research is partially supported by the NSFC Grants 11571252, 11771114 and 61672323, the China Scholarship Council Grant 201508330054, and the NSERC Canada.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhang, A., Chen, Y., Goebel, R., Lin, G. (2018). Open-Shop Scheduling for Unit Jobs Under Precedence Constraints. In: Kim, D., Uma, R., Zelikovsky, A. (eds) Combinatorial Optimization and Applications. COCOA 2018. Lecture Notes in Computer Science(), vol 11346. Springer, Cham. https://doi.org/10.1007/978-3-030-04651-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-04651-4_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04650-7
Online ISBN: 978-3-030-04651-4
eBook Packages: Computer ScienceComputer Science (R0)