A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
Year of publication: |
2011
|
---|---|
Authors: | Yuan, Jinjiang ; Fu, Ruyan ; Ng, C. T. ; Cheng, T. C. E. |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 14.2011, 4, p. 361-369
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm |
-
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 ...
-
Fu, Ruyan, (2013)
-
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
Li, Shisheng, (2011)
-
Gao, Yuan, (2022)
- More ...