A note on the Coffman-Sethi bound for LPT scheduling
Year of publication: |
2015
|
---|---|
Authors: | Blocher, James D. ; Sevastyanov, Sergey |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 18.2015, 3, p. 325-327
|
Subject: | Identical parallel machines | Makespan minimization | LPT algorithm | Coffman-Sethi | Scheduling | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
-
Exact algorithms to minimize makespan on single and parallel batch processing machines
Muter, İbrahim, (2020)
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
-
Wang, Xiuli, (2015)
- More ...
-
A complete 4-parametric complexity classification of short shop scheduling problems
Kononov, Alexander, (2012)
-
Novye proekty aziatsko-tichookeanskoj integracii
Sevastʹjanov, Sergej V., (2011)
-
Efficient approximation algorithms for the routing open shop problem
Chernykh, Ilya, (2013)
- More ...