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)
-
Single-machine scheduling of multiple projects with controllable processing times
Geng, Zhichao, (2023)
-
Li, Shuguang, (2017)
- More ...
-
Eliminating information asymmetry in supply chains : blockchain-driven or not
Liu, Samuel Shuai, (2025)
-
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
Yuan, Jinjiang, (2011)
-
Remanufacturing strategies under product take-back regulation
Xu, Jie, (2021)
- More ...