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: | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time |
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
Local search heuristics for single machine tardiness sequencing
Crauwels, H. A., (1994)
-
Scheduling deteriorating jobs dependent on resources for the makespan minimization
Bachman, Aleksander, (2001)
- More ...
-
Fu, Ruyan, (2013)
-
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
Li, Shisheng, (2011)
-
Scheduling with release dates and preemption to minimize multiple max-form objective functions
Yuan, Jinjiang, (2020)
- More ...