Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Year of publication: |
2002
|
---|---|
Authors: | Epstein, Leah ; Favrholdt, Lene M. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 30.2002, 4, p. 269-275
|
Saved in:
Saved in favorites
Similar items by person
-
Comparing online algorithms for bin packing problems
Epstein, Leah, (2012)
-
Boyar, Joan, (2018)
-
A new variable-sized bin packing problem
Boyar, Joan, (2012)
- More ...