Online scheduling with preemption or non-completion penalties
Year of publication: |
2014
|
---|---|
Authors: | Fung, Stanley P. Y. |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 17.2014, 2, p. 173-183
|
Subject: | Online algorithms | Competitive analysis | Immediate notification | Immediate decision | Preemption penalty | Scheduling-Verfahren | Scheduling problem | Strafe | Punishment | Wettbewerbsanalyse | Algorithmus | Algorithm | Entscheidung | Decision |
-
Fault tolerant scheduling of tasks of two sizes under resource augmentation
Kowalski, Dariusz R., (2017)
-
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Birks, Martin, (2013)
-
Online advance scheduling with overtime : a primal-dual approach
Keyvanshokooh, Esmaeil, (2021)
- More ...
-
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Birks, Martin, (2013)
-
Bounded delay packet scheduling in a bounded buffer
Fung, Stanley P. Y., (2010)
-
Online interval scheduling : randomized and multiprocessor cases
Fung, Stanley P. Y., (2008)
- More ...