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 | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Qualitätsmanagement | Quality management | Packproblem | Packing problem | Produktqualität | Product quality |
-
Procedures for the bin packing problem with precedence constraints
Pereira, Jordi, (2016)
-
Just-in-time two-dimensional bin packing
Polyakovskiy, Sergey, (2021)
-
Online bin stretching with three bins
Böhm, Martin, (2017)
- More ...
-
A new variable-sized bin packing problem
Boyar, Joan, (2012)
-
Comparing online algorithms for bin packing problems
Epstein, Leah, (2012)
-
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Epstein, Leah, (2002)
- More ...