An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
Year of publication: |
2013
|
---|---|
Authors: | Fu, Ruyan ; Cheng, T. C. E. ; Ng, C. T. ; Yuan, Jinjiang |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 3, p. 216-219
|
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 ...
-
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
Yuan, Jinjiang, (2011)
-
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 ...