Scheduling with non-renewable resources : minimizing the sum of completion times
Year of publication: |
2024
|
---|---|
Authors: | Bérczi, Kristóf ; Király, Tamás ; Omlor, Simon |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 27.2024, 2, p. 151-164
|
Subject: | Approximation algorithm | Artificial Intelligence | Non-renewable resources | Polynomial-time approximation scheme | Scheduling | Strong NP-hardness | Weighted sum of completion times | Erschöpfbare Ressourcen | Exhaustible resources | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Künstliche Intelligenz | Artificial intelligence |
-
Approximability of total weighted completion time with resource consuming jobs
Kis, Tamaś, (2015)
-
Approximation schemes for parallel machine scheduling with non-renewable resources
Györgyi, Péter, (2017)
-
Single machine scheduling with step-learning
Atsmony, Matan, (2024)
- More ...
-
Scheduling with non-renewable resources: minimizing the sum of completion times
Bérczi, Kristóf, (2024)
-
Manipulating the outcome of stable marriage and roommates problems
Bérczi, Kristóf, (2024)
-
Serial batching to minimize the weighted number of tardy jobs
Hermelin, Danny, (2024)
- More ...