Complexity and approximation of open shop scheduling to minimize the makespan : a review of models and approaches
Year of publication: |
2022
|
---|---|
Authors: | Strusevich, Vitaly A. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 144.2022, p. 1-33
|
Subject: | Approximation | Complexity | Flow shop scheduling | Open shop scheduling | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Produktionswirtschaft | Production management |
-
Open shop scheduling with stochastic relase dates and processing times
Azadeh, Mohammad Ali, (2014)
-
Jula, Payman, (2013)
-
Jula, Payman, (2012)
- More ...
-
Two-machine open shop scheduling with an availability constraint
Breit, Joachim, (2000)
-
Non-preemptive two-machine open shop scheduling with non-availability constraints
Breit, Joachim, (2001)
-
Strusevič, Vitalij Aleksandrovič, (2021)
- More ...