A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
Year of publication: |
2020
|
---|---|
Authors: | Dong, Jianming ; Jin, Ruyan ; Luo, Taibo ; Tong, Weitian |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 281.2020, 1 (16.2.), p. 16-24
|
Subject: | Scheduling | Parallel two-stage flow-shops | Makespan | Mixed integer program | Polynomial-time approximation scheme | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming |
-
Exact approaches for single machine total weighted tardiness batch scheduling
Pessoa, Artur, (2022)
-
Dynamic order acceptance and scheduling problem with sequence-dependent setup time
Xu, Lei, (2015)
-
Cheng, Mingbao, (2014)
- More ...
-
Rescheduling due to machine disruption to minimize the total weighted completion time
Luo, Wenchang, (2018)
-
Minimax regret vertex centdian location problem in general dynamic networks
Li, Hongmei, (2018)
-
The Steiner Traveling Salesman Problem with online edge blockages
Zhang, Huili, (2015)
- More ...