The worst-case analysis of the Garey-Johnson algorithm
Year of publication: |
2009
|
---|---|
Authors: | Hanen, Claire ; Zinder, Yakov |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 12.2009, 4, p. 389-400
|
Subject: | Scheduling-Verfahren | Scheduling problem | Parallelrechner | Parallel computer | Algorithmus | Algorithm |
-
Scheduling a batch processing machine with non-identical job sizes : a clustering perspective
Chen, Huaping, (2011)
-
Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
Różycki, R., (2012)
-
On truthfulness and approximation for scheduling selfish tasks
Angel, Eric, (2009)
- More ...
-
The resource-constrained modulo scheduling problem: an experimental study
Ayala, Maria, (2013)
-
Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
Hanen, Claire, (1994)
-
Benabid, Abir, (2011)
- More ...