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 | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Operations Research | Operations research | Theorie | Theory |
-
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
Lee, Kangbok, (2014)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
- 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 ...