Makespan minimization in online scheduling with machine eligibility
Year of publication: |
2010
|
---|---|
Authors: | Lee, Kangbok ; Leung, Joseph Y.-T. ; Pinedo, Michael |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 8.2010, 4, p. 331-364
|
Subject: | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
An ant colonial optimisation approach for no-wait permutation flow shop scheduling
Khan, Ahitsham Shad, (2017)
-
Madraki, Golshan, (2018)
- More ...
-
Scheduling jobs with equal processing times subject to machine eligibility constraints
Lee, Kangbok, (2011)
-
Flow shops with machine maintenance : ordered and proportionate cases
Choi, Byung-cheon, (2010)
-
Bi-criteria scheduling with machine assignment costs
Leung, Joseph Y.-T., (2012)
- More ...