A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
Year of publication: |
2021
|
---|---|
Authors: | Hashimoto, Susumu ; Mizuno, Shinji |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 24.2021, 3, p. 259-267
|
Subject: | Single-machine scheduling problems | Non-renewable resources | List scheduling algorithm | Approximation algorithms | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Erschöpfbare Ressourcen | Exhaustible resources |
-
Approximability of total weighted completion time with resource consuming jobs
Kis, Tamaś, (2015)
-
Györgyi, Péter, (2019)
-
A PTAS for a resource scheduling problem with arbitrary number of parallel machines
Györgyi, Péter, (2017)
- More ...
-
Hashimoto, Susumu, (2004)
-
Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs
Takano, Yuichi, (2015)
-
Robust Tracking Error Optimization Problems by Second-Order Cone Programming
Inaba, Hiroki, (2005)
- More ...