Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Year of publication: |
2019
|
---|---|
Authors: | Dósa, György ; Fügenschuh, Armin ; Tan, Zhiyi ; Tuza, Zsolt ; Węsek, Krzysztof |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 27.2019, 4, p. 1107-1130
|
Subject: | Semi-online scheduling | Makespan minimization | Machine scheduling | Lower bounds | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Produktionssteuerung | Production control | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
Kellerer, Hans, (2015)
-
Exact algorithms to minimize makespan on single and parallel batch processing machines
Muter, İbrahim, (2020)
-
Beldar, Pedram, (2024)
- More ...
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
-
Dósa, György, (2011)
-
Bin covering with a general profit function : approximability results
Benkő, Attila, (2013)
- More ...