A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
Year of publication: |
2012
|
---|---|
Authors: | Liu, Peihai ; Lu, Xiwen ; Fang, Yang |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 15.2012, 1, p. 77-81
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Produktionssteuerung | Production control |
-
An O(n log n) algorithm for the two-machine flow shop problem with variable machine speeds
Hoesel, C. P. van, (1993)
-
Yuan, Jinjiang, (2009)
-
Xu, Kailiang, (2010)
- More ...
-
Optimal on-line algorithms for one batch machine with grouped processing times
Yang, Fang, (2011)
-
Integrated production and job delivery scheduling with an availability constraint
Liu, Peihai, (2016)
-
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
Liu, Peihai, (2014)
- More ...