Complexity of a scheduling problem with controllable processing times
| Year of publication: |
2010
|
|---|---|
| Authors: | Choi, Byung-cheon ; Leung, Joseph Y.-t. ; Pinedo, Michael |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 38.2010, 2, p. 123-126
|
| Subject: | Scheduling-Verfahren | Scheduling problem | Produktionssteuerung | Production control | Durchlaufzeit | Lead time | Theorie | Theory | Operations Research | Operations research |
-
Fernandez-Viagas, Victor, (2025)
-
Minimizing maximum tardiness on a single machine with family setup times and machine disruption
Molaee, Ehsan, (2021)
-
An almost exact solution to the min completion time variance in a single machine
Nasini, Stefano, (2021)
- More ...
-
Minimizing makespan in an ordered flow shop with machine-dependent processing times
Choi, Byung-cheon, (2011)
-
Flow shops with machine maintenance : ordered and proportionate cases
Choi, Byung-cheon, (2010)
-
Container scheduling : complexity and algorithms
Choi, Byung-cheon, (2012)
- More ...