Robust makespan minimisation in identical parallel machine scheduling problem with interval data
Year of publication: |
2013
|
---|---|
Authors: | Xu, Xiaoqing ; Cui, Wentian ; Lin, Jun ; Qian, Yanjun |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 51.2013, 12 (15.6.), p. 3532-3548
|
Subject: | identical parallel machines | makespan minimisation | min–max regret | uncertain processing times | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Theorie | Theory |
-
Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
Druetto, Alessandro, (2025)
-
Wang, Xiuli, (2015)
-
Minimizing the makespan on two identical parallel machines with mold constraints
Chung, Tsuiping, (2019)
- More ...
-
Robust makespan minimisation in identical parallel machine scheduling problem with interval data
Xu, Xiaoqing, (2013)
-
The trade-off between knowledge exploration and exploitation in technological innovation
Li, Dehong, (2018)
-
An effective approach for scheduling coupled activities in development projects
Lin, Jun, (2015)
- More ...