Customer order scheduling on batch processing machines with incompatible job families
| Year of publication: |
1-15 January 2018
|
|---|---|
| Authors: | Shi, Zhongshun ; Huang, Zewen ; Shi, Leyuan |
| Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 56.2018, 1/2 (1/15.1.), p. 795-808
|
| Subject: | order scheduling | batch machine | incompatible job families | order makespan | total weighted order completion time | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Produktionssteuerung | Production control |
-
Learning-augmented heuristics for scheduling parallel serial-batch processing machines
Uzunoglu, Aykut, (2023)
-
Minimising total weighted completion time on batch and unary machines with incompatible job families
Huang, Zewen, (2019)
-
Thürer, Matthias, (2013)
- More ...
-
Flow shop scheduling with a batch processor and limited buffer
Zhang, Cheng, (2017)
-
Minimising total weighted completion time on batch and unary machines with incompatible job families
Huang, Zewen, (2019)
-
Dynamic sampling allocation under finite simulation budget for feasibility determination
Shi, Zhongshun, (2022)
- More ...