Comparing online algorithms for bin packing problems
Year of publication: |
2012
|
---|---|
Authors: | Epstein, Leah ; Favrholdt, Lene M. ; Kohrt, Jens S. |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 15.2012, 1, p. 13-21
|
Subject: | Algorithmus | Algorithm | Packproblem | Packing problem | Heuristik | Heuristics | Theorie | Theory |
-
An improved best-fit heuristic for the orthogonal strip packing problem
Verstichel, Jannes, (2013)
-
DomÃnguez, Oscar, (2014)
-
A column generation-based heuristic for the three-dimensional bin packing problem with rotation
Mahvash, Batoul, (2018)
- More ...
-
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Epstein, Leah, (2002)
-
Boyar, Joan, (2018)
-
A new variable-sized bin packing problem
Boyar, Joan, (2012)
- More ...