Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/a-book-of-open-shop-scheduling-makespan-minimization-for-two-machine-SGxdIr2gug
References (12)
-
A. Soper (2015)
A cyclical search for the two machine flow shop and open shop to minimise finishing timeJournal of Scheduling, 18
-
Bernd Jurisch, W. Kubiak (1997)
Two-Machine Open Shops with Renewable ResourcesOper. Res., 45
-
W. Kubiak, C. Sriskandarajah, K. Zaras (1991)
A Note On The Complexity Of Openshop Scheduling ProblemsInfor, 29
-
Nour Tellache, Mourad Boudhar (2017)
Open shop scheduling problems with conflict graphsDiscret. Appl. Math., 227
-
Irina Gribkovskaia, Chung-Yee Lee, V. Strusevich, D. Werra (2006)
Three is easy, two is hard: open shop sum-batch scheduling problem refinedOper. Res. Lett., 34
-
T. Gonzalez, S. Sahni (1976)
Open Shop Scheduling to Minimize Finish TimeJ. ACM, 23
-
V. Tanaev, I︠u︡. Sotskov, V. Strusevich (1994)
Scheduling Theory: Multi-Stage Systems -
Michael Pinedo, L. Schrage (1982)
Stochastic Shop Scheduling: A Survey -
D. Werra, J. Błażewicz, W. Kubiak (1991)
A preemptive open shop scheduling problem with one resourceOper. Res. Lett., 10
-
D. Shabtay, M. Kaspi (2006)
Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption functionNaval Research Logistics (NRL), 53
-
D. Atkin (2000)
OR scheduling algorithms.Anesthesiology, 93 1
-
Nour Tellache, Mourad Boudhar, F. Yalaoui (2019)
Two-machine open shop problem with agreement graphTheor. Comput. Sci., 796
- Publisher
- Springer International Publishing
- Copyright
- © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
- ISBN
- 978-3-030-91024-2
- Pages
- 13 –30
- DOI
- 10.1007/978-3-030-91025-9_2
- Publisher site
- See Chapter on Publisher Site
Abstract
[The two-machine open shopTwo-machine open shop makespanMakespan minimization problem, O2||Cmax\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$O2||C_{\max }$$ \end{document}, is one of the most gracious scheduling problems.]
Published: Oct 31, 2021