Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
Year of publication: |
2019
|
---|---|
Authors: | Györgyi, Péter ; Kis, Tamás |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 6, p. 623-634
|
Subject: | Single-machine scheduling | Non-renewable resources | Approximation algorithms | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Erschöpfbare Ressourcen | Exhaustible resources | Algorithmus | Algorithm |
-
Approximability of total weighted completion time with resource consuming jobs
Kis, Tamaś, (2015)
-
Hashimoto, Susumu, (2021)
-
A multivariate complexity analysis of the material consumption scheduling problem
Bentert, Matthias, (2023)
- More ...
-
Approximation schemes for single machine scheduling with non-renewable resource constraints
Györgyi, Péter, (2014)
-
Approximability of scheduling problems with resource consuming jobs
Györgyi, Péter, (2015)
-
A common approximation framework for early work, late work, and resource leveling problems
Györgyi, Péter, (2020)
- More ...