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 | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Komplexitätsmanagement | Complexity management | Erschöpfbare Ressourcen | Exhaustible resources | Durchlaufzeit | Lead time | Komplexe Systeme | Complex systems | Mathematische Optimierung | Mathematical programming |
-
New complexity results on scheduling problem in a robotic cell
Chikhi, Nacira, (2017)
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
-
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2019)
- More ...
-
A multivariate complexity analysis of the material consumption scheduling problem
Bentert, Matthias, (2023)
-
Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Bentert, Matthias, (2019)
-
Bentert, Matthias, (2022)
- More ...