Online-bounded analysis
| Year of publication: |
August 2018
|
|---|---|
| Authors: | Boyar, Joan ; Epstein, Leah ; Favrholdt, Lene M. ; Larsen, Kim S. ; Levin, Asaf |
| Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 21.2018, 4, p. 429-441
|
| Subject: | Online algorithms | Quality measures | Machine scheduling | Bin packing | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Packproblem | Packing problem | Produktqualität | Product quality |
-
Online bin stretching with three bins
Böhm, Martin, (2017)
-
Just-in-time two-dimensional bin packing
Polyakovskiy, Sergey, (2021)
-
Kramer, Raphael, (2017)
- More ...
-
Comparing online algorithms for bin packing problems
Epstein, Leah, (2012)
-
Lower bounds for online bin covering-type problems
Balogh, János, (2019)
-
The benefit of preemption with respect to the lp norm
Epstein, Leah, (2018)
- More ...