Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
Year of publication: |
October 2016
|
---|---|
Authors: | Ravi, Peruvemba Sundaram ; Tunçel, Levent ; Huang, Michael |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 19.2016, 5, p. 547-561
|
Subject: | Parallel identical machines | Makespan | Total completion time | Approximation algorithms for scheduling | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
-
Throughput scheduling with equal additive laxity
Böhm, Martin, (2022)
-
Parallel machine scheduling problems with common flow-allowance
Mor, Baruch, (2012)
-
Strusevič, Vitalij Aleksandrovič, (2021)
- More ...
-
An analysis of a widely used version of the CUSUM tracking signal
Ravi, Peruvemba Sundaram, (2014)
-
Allocating demand to minimize production-related costs
Ravi, Peruvemba Sundaram, (2012)
-
Allocating demand to minimize production-related costs
Ravi, Peruvemba Sundaram, (2012)
- More ...