A note on posterior tight worst-case bounds for longest processing time schedules
Year of publication: |
2019
|
---|---|
Authors: | Ho, Johnny ; Massabo, Ivar ; Paletta, Guiseppe ; Ruiz-Torres, Alex J. |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 17.2019, 1, p. 97-107
|
Subject: | Multiprocessor scheduling | Parallel machines | LPT algorithm | Worst case analysis | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Produktionssteuerung | Production control |
-
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
Kellerer, Hans, (2015)
-
Approximation for scheduling on uniform nonsimultaneous parallel machines
Grigoriu, Liliana, (2017)
-
Two-agent scheduling on mixed batch machines to minimise the total weighted makespan
Fan, Guo-Qiang, (2023)
- More ...
-
Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
Ruiz-Torres, Alex J., (2013)
-
Generating Pareto schedules with outsource and internal parallel resources
Ruiz-Torres, Alex J., (2006)
-
Ruiz-Torres, Alex J., (2007)
- More ...