Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Year of publication: |
March 2018
|
---|---|
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. 26.2018, 1, p. 161-180
|
Subject: | Scheduling | Semi-online algorithm | Makespan minimization | Mixed-integer linear programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Heuristik | Heuristics |
-
Dubois-Lacoste, Jérémie, (2017)
-
Modeling and solution methods for hybrid flow shop scheduling problem with job rejection
Dabiri, Mohamadreza, (2022)
-
Zhang, Guanghui, (2019)
- More ...
-
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2019)
-
Bin covering with a general profit function : approximability results
Benkő, Attila, (2013)
-
Dósa, György, (2011)
- More ...