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: | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Künstliche Intelligenz | Artificial intelligence |
-
Minimization of maximum lateness on parallel machines with a single server and job release dates
Elidrissi, Abdelhak, (2024)
-
Rault, Tifenn, (2024)
-
Bicriteria two-machine flowshop scheduling : approximation algorithms and their limits
Jiang, Xiaojuan, (2024)
- More ...
-
Flow shops with machine maintenance : ordered and proportionate cases
Choi, Byung-cheon, (2010)
-
Container scheduling : complexity and algorithms
Choi, Byung-cheon, (2012)
-
Scheduling jobs with equal processing times subject to machine eligibility constraints
Lee, Kangbok, (2011)
- More ...