Minimising total weighted completion time on batch and unary machines with incompatible job families
| Year of publication: |
2019
|
|---|---|
| Authors: | Huang, Zewen ; Shi, Zhongshun ; Shi, Leyuan |
| Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 57.2019, 2, p. 567-581
|
| Subject: | approximation algorithm | batch machine | constraint programming | incompatible job families | total weighted completion time | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
-
Gahm, Christian, (2022)
-
Learning-augmented heuristics for scheduling parallel serial-batch processing machines
Uzunoglu, Aykut, (2023)
-
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Fomin, Artem, (2022)
- More ...
-
Customer order scheduling on batch processing machines with incompatible job families
Shi, Zhongshun, (2018)
-
Flow shop scheduling with a batch processor and limited buffer
Zhang, Cheng, (2017)
-
Dynamic sampling allocation under finite simulation budget for feasibility determination
Shi, Zhongshun, (2022)
- More ...