New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
Year of publication: |
2012
|
---|---|
Authors: | Andresen, Michael ; Dhamala, Tanka Nath |
Published in: |
Annals of operations research. - Dordrecht, The Netherlands : Springer Nature B.V., ISSN 0254-5330, ZDB-ID 252629-3. - Vol. 196.2012, p. 1-26
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
Madraki, Golshan, (2018)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
Andresen, Michael, (2012)
-
Continuous dynamic contraflow approach for evacuation planning
Pyakurel, Urmila, (2017)
-
Partial contraflow with path reversals for evacuation planning
Pyakurel, Urmila, (2019)
- More ...