Non-Approximability Results for Scheduling Problems with Minsum Criteria
Year of publication: |
2001
|
---|---|
Authors: | Hoogeveen, Han ; Schuurman, Petra ; Woeginger, Gerhard J. |
Published in: |
INFORMS journal on computing : JOC. - Linthicum, Md : INFORMS, ISSN 0899-1499, ZDB-ID 13160771. - Vol. 13.2001, 2, p. 157-168
|
Saved in:
Saved in favorites
Similar items by person
-
Scheduling of pipelined operator graphs
Bodlaender, Hans L., (2012)
-
Approximation algorithms for the multiprocessor open shop scheduling problem
Schuurman, Petra, (1998)
-
Scheduling with step-improving processing times
Cheng, T.C.Edwin, (2006)
- More ...