An optimal online algorithm for single machine scheduling to minimize total general completion time
Year of publication: |
2012
|
---|---|
Authors: | Liu, Ming ; Chu, Chengbin ; Xu, Yinfeng ; Huo, Jiazhen |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 23.2012, 2, p. 189-195
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
-
Madraki, Golshan, (2018)
-
An O(n log n) algorithm for the two-machine flow shop problem with variable machine speeds
Hoesel, C. P. van, (1993)
-
A note: common due data assignment for a single machine scheduling with the rate-modifying activity
Gordon, Valery S., (2009)
- More ...
-
Liu, Ming, (2010)
-
An optimal online algorithm for single machine scheduling with bounded delivery times
Liu, Ming, (2010)
-
Liu, Ming, (2011)
- More ...