A note on the proof of the complexity of the little-preemptive open-shop problem
Year of publication: |
2011
|
---|---|
Authors: | Shchepin, Evgeny V. ; Vakhania, Nodari |
Published in: |
Annals of operations research. - New York, NY [u.a.] : Springer Science + Business Media, ISSN 0254-5330, ZDB-ID 2526293. - Vol. 191.2011, 1, p. 251-254
|
Saved in:
Saved in favorites
Similar items by person
-
A note on the proof of the complexity of the little-preemptive open-shop problem
Shchepin, Evgeny V., (2011)
-
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
Shchepin, Evgeny V., (2008)
-
An optimal rounding gives a better approximation for scheduling unrelated machines
Shchepin, Evgeny V., (2005)
- More ...