An optimal rounding gives a better approximation for scheduling unrelated machines
Year of publication: |
2005
|
---|---|
Authors: | Shchepin, Evgeny V. ; Vakhania, Nodari |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 33.2005, 2, p. 127-133
|
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)
-
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
Shchepin, Evgeny V., (2008)
- More ...