Approximation algorithms for batch scheduling with processing set restrictions
Year of publication: |
2023
|
---|---|
Authors: | Chai, Xing ; Li, Wenhua ; Ng, C. T. ; Cheng, T. C. E. |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 26.2023, 6, p. 523-533
|
Subject: | Batch | Makespan | Processing set restrictions | Scheduling | Uniform machines | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Produktionssteuerung | Production control | Prozessmanagement | Business process management |
-
Fast approximation algorithms for uniform machine scheduling with processing set restrictions
Leung, Joseph Y-T., (2017)
-
Li, Shuguang, (2017)
-
Single-machine scheduling of multiple projects with controllable processing times
Geng, Zhichao, (2023)
- More ...
-
Lin, Ran, (2021)
-
Single machine scheduling to minimize total weighted tardiness
Cheng, T. C. E., (2005)
-
On the single machine total tardiness problem
Tian, Z. J., (2005)
- More ...