On the geometry, preemptions and complexity of multiprocessor and shop scheduling
Year of publication: |
2008
|
---|---|
Authors: | Shchepin, Evgeny V. ; Vakhania, Nodari |
Published in: |
Annals of operations research. - Dordrecht, The Netherlands : Springer Nature B.V., ISSN 0254-5330, ZDB-ID 252629-3. - Vol. 159.2008, p. 183-213
|
Subject: | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research | Theorie | Theory |
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
-
New models and applications for railway timetabling
Polinder, Gert-Jaap, (2020)
-
Tu San Pham, (2023)
- More ...
-
A note on the proof of the complexity of the little-preemptive open-shop problem
Shchepin, Evgeny V., (2011)
-
An optimal rounding gives a better approximation for scheduling unrelated machines
Shchepin, Evgeny V., (2005)
-
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
Shchepin, Evgeny V., (2008)
- More ...