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 | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics |
-
Makespan minimization for the m-machine ordered flow shop scheduling problem
Khatami, Mostafa, (2019)
-
Zhang, Guanghui, (2019)
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
- More ...
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
-
Bin covering with a general profit function : approximability results
Benkő, Attila, (2013)
-
Dósa, György, (2011)
- More ...