A multivariate complexity analysis of the material consumption scheduling problem
Year of publication: |
2023
|
---|---|
Authors: | Bentert, Matthias ; Bredereck, Robert ; Györgyi, Péter ; Kaczmarczyk, Andrzej ; Niedermeier, Rolf |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 26.2023, 4, p. 369-382
|
Subject: | Exact algorithms | Fine-grained complexity | Makespan minimization | Non-renewable resources | Parameterized computational complexity | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Komplexitätsmanagement | Complexity management | Mathematische Optimierung | Mathematical programming | Erschöpfbare Ressourcen | Exhaustible resources |
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
-
The coupled task scheduling problem : an improved mathematical program and a new solution algorithm
Khatami, Mostafa, (2024)
-
Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs
Lee, Myungho, (2022)
- More ...
-
Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Bentert, Matthias, (2019)
-
Bentert, Matthias, (2022)
-
Bentert, Matthias, (2023)
- More ...