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 | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Produktionssteuerung | Production control |
-
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2019)
-
Approximation for scheduling on uniform nonsimultaneous parallel machines
Grigoriu, Liliana, (2017)
-
A note on posterior tight worst-case bounds for longest processing time schedules
Ho, Johnny, (2019)
- More ...
-
A 3/2-approximation algorithm for image-partitioning
Kellerer, Hans, (2011)
-
An efficient algorithm for bin stretching
Kellerer, Hans, (2013)
-
Algorithms better than LPT for semi-online scheduling with decreasing processing times
Cheng, T. C. E., (2012)
- More ...