Online cardinality constrained scheduling
Year of publication: |
2023
|
---|---|
Authors: | Epstein, Leah ; Lassota, Alexandra ; Levin, Asaf ; Maack, Marten ; Rohwedder, Lars |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 51.2023, 5, p. 533-539
|
Subject: | Competitive analysis | Load balancing | Online algorithms | Scheduling | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory |
-
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Birks, Martin, (2013)
-
Fault tolerant scheduling of tasks of two sizes under resource augmentation
Kowalski, Dariusz R., (2017)
-
Online advance scheduling with overtime : a primal-dual approach
Keyvanshokooh, Esmaeil, (2021)
- More ...
-
Scheduling with processing set restrictions: PTAS results for several variants
Epstein, Leah, (2011)
-
Scheduling with processing set restrictions: PTAS results for several variants
Epstein, Leah, (2011)
-
Epstein, Leah, (2011)
- More ...