TY - JOUR
T1 - Robust Parallel Machine Scheduling Problem with Uncertainties and Sequence-Dependent Setup Time
AU - Hu, Hongtao
AU - Ng, K. K.H.
AU - Qin, Yichen
N1 - Funding Information:
The research is supported by The National Natural Science Foundation of China [no. 71201099], Innovation Programof Shanghai Municipal Education Commission [no. 14YZ111], Shanghai Young Eastern Scholar Programme [QD2015041], Shanghai Pu Jiang Program (no. 13PJC066), Shanghai Youth Teacher Foundation (no. ZZshhs13021), and the Hong Kong Polytechnic University. The authors' gratitude is also extended to the research committee and the Department of Industrial and Systems Engineering of the Hong Kong Polytechnic University for support of this project (RUF1 and RU8H)
Publisher Copyright:
© 2016 Hongtao Hu et al.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2016
Y1 - 2016
N2 - A parallel machine scheduling problem in plastic production is studied in this paper. In this problem, the processing time and arrival time are uncertain but lie in their respective intervals. In addition, each job must be processed together with a mold while jobs which belong to one family can share the same mold. Therefore, time changing mold is required for two consecutive jobs that belong to different families, which is known as sequence-dependent setup time. This paper aims to identify a robust schedule by min-max regret criterion. It is proved that the scenario incurring maximal regret for each feasible solution lies in finite extreme scenarios. A mixed integer linear programming formulation and an exact algorithm are proposed to solve the problem. Moreover, a modified artificial bee colony algorithm is developed to solve large-scale problems. The performance of the presented algorithm is evaluated through extensive computational experiments and the results show that the proposed algorithm surpasses the exact method in terms of objective value and computational time.
AB - A parallel machine scheduling problem in plastic production is studied in this paper. In this problem, the processing time and arrival time are uncertain but lie in their respective intervals. In addition, each job must be processed together with a mold while jobs which belong to one family can share the same mold. Therefore, time changing mold is required for two consecutive jobs that belong to different families, which is known as sequence-dependent setup time. This paper aims to identify a robust schedule by min-max regret criterion. It is proved that the scenario incurring maximal regret for each feasible solution lies in finite extreme scenarios. A mixed integer linear programming formulation and an exact algorithm are proposed to solve the problem. Moreover, a modified artificial bee colony algorithm is developed to solve large-scale problems. The performance of the presented algorithm is evaluated through extensive computational experiments and the results show that the proposed algorithm surpasses the exact method in terms of objective value and computational time.
UR - http://www.scopus.com/inward/record.url?scp=85006056292&partnerID=8YFLogxK
U2 - 10.1155/2016/5127253
DO - 10.1155/2016/5127253
M3 - Journal article
AN - SCOPUS:85006056292
SN - 1058-9244
VL - 2016
JO - Scientific Programming
JF - Scientific Programming
M1 - 5127253
ER -