An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
Year of publication: |
2015
|
---|---|
Authors: | Kellerer, Hans ; Kotov, Vladimir N. ; Gabay, Michaël |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 18.2015, 6, p. 623-630
|
Subject: | Semi-online scheduling | Competitive analysis | Multiprocessor scheduling | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Semi-online scheduling with GoS eligibility constraints
Lee, Kangbok, (2014)
-
Semi-online scheduling on two identical machines with rejection
Min, Xiao, (2013)
-
Online bin stretching with three bins
Böhm, Martin, (2017)
- More ...
-
Improved lower bounds for the online bin stretching problem
Gabay, Michaël, (2017)
-
A 3/2-approximation algorithm for image-partitioning
Kellerer, Hans, (2011)
-
An efficient algorithm for bin stretching
Kellerer, Hans, (2013)
- More ...