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 | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
-
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2019)
-
The coupled task scheduling problem : an improved mathematical program and a new solution algorithm
Khatami, Mostafa, (2024)
-
A multivariate complexity analysis of the material consumption scheduling problem
Bentert, Matthias, (2023)
- More ...
-
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2019)
-
Dósa, György, (2011)
-
Bin covering with a general profit function : approximability results
Benkő, Attila, (2013)
- More ...