Online algorithms for multilevel aggregation
Year of publication: |
2020
|
---|---|
Authors: | Bienkowski, Marcin ; Böhm, Martin ; Byrka, Jaroslaw ; Chrobak, Marek ; Dürr, Christoph ; Folwarczný, Lukáš ; Jeż, Łukasz ; Sgall, Jiří ; Nguyen Kim Thang ; Veselý, Pavel |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 1, p. 214-232
|
Subject: | algorithmic aspects of networks | online algorithms | scheduling and resource allocation | lot sizing | multistage assembly problem | Algorithmus | Algorithm | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Losgröße | Lot size | Allokation | Allocation |
-
Online advance scheduling with overtime : a primal-dual approach
Keyvanshokooh, Esmaeil, (2021)
-
Learning-augmented heuristics for scheduling parallel serial-batch processing machines
Uzunoglu, Aykut, (2023)
-
Ma, Ran, (2025)
- More ...
-
Online bin stretching with three bins
Böhm, Martin, (2017)
-
The local-global conjecture for scheduling with non-linear cost
Bansal, Nikhil, (2017)
-
Approximation algorithms for the joint replenishment problem with deadlines
Bienkowski, Marcin, (2015)
- More ...