A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
Year of publication: |
1998
|
---|---|
Authors: | Schuurman, Petra |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 23.1998, 1, p. 9-12
|
Saved in:
Saved in favorites
Similar items by person
-
Performance Guarantees of Local Search for Multiprocessor Scheduling
Schuurman, Petra, (2005)
-
Local search performance guarantees for restricted related parallel machine scheduling
Recalde, Diego, (2009)
-
Performance guarantees of jump neighborhoods on restricted related parallel machines
Rutten, Cyriel, (2012)
- More ...