Approximation schemes for single machine scheduling with non-renewable resource constraints
Year of publication: |
2014
|
---|---|
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. 17.2014, 2, p. 135-144
|
Subject: | Single machine scheduling | Non-renewable resources | Approximation schemes | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Erschöpfbare Ressourcen | Exhaustible resources |
-
Approximation schemes for parallel machine scheduling with non-renewable resources
Györgyi, Péter, (2017)
-
Complexity of project scheduling problem with nonrenewable resources
Servakh, Vladimir V., (2008)
-
Approximability of total weighted completion time with resource consuming jobs
Kis, Tamaś, (2015)
- More ...
-
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)
-
A probabilistic approach to pickup and delivery problems with time window uncertainty
Györgyi, Péter, (2019)
- More ...