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 | Durchlaufzeit | Lead time | Theorie | Theory | Heuristik | Heuristics |
-
Customer order scheduling on batch processing machines with incompatible job families
Shi, Zhongshun, (2018)
-
Ma, Ran, (2014)
-
Tao, Jiping, (2014)
- 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)
-
Integrated optimisation on flow-shop production with cutting stock
Wang, Weihao, (2019)
- More ...