Algorithms better than LPT for semi-online scheduling with decreasing processing times
| Year of publication: |
2012
|
|---|---|
| Authors: | Cheng, T. C. E. ; Kellerer, Hans ; Kotov, Vladimir N. |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 40.2012, 5, p. 349-352
|
| Subject: | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Durchlaufzeit | Lead time | Produktionssteuerung | Production control |
-
Yaghtin, Mohammad, (2025)
-
Two-machine flowshop scheduling with flexible operations and controllable processing times
Uruk, Zeynep, (2013)
-
Arc-flow approach for single batch-processing machine scheduling
Trindade, Renan Spencer, (2021)
- More ...
-
A 3/2-approximation algorithm for image-partitioning
Kellerer, Hans, (2011)
-
An efficient algorithm for bin stretching
Kellerer, Hans, (2013)
-
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
Kellerer, Hans, (2015)
- More ...