TY - JOUR
ID - 74019
TI - Unrelated parallel machine scheduling with processing constraints and sequence dependent setup times
JO - Advances in Industrial Engineering
JA - JIENG
LA - en
SN - 2423-6896
AU - Ahmadizar, Fardin
AU - Mahdavi, Kasra
AU - Arkat, Jamal
AD - Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran
AD - MSc in Industrial Engineering, University of Kurdistan
AD - Department of Industrial Engineering, University of Kurdistan
Y1 - 2018
PY - 2018
VL - 52
IS - 4
SP - 495
EP - 507
KW - Scheduling
KW - Unrelated parallel machines
KW - Processing constraints
KW - Sequence-dependent setup
KW - Imperialists competitive algorithm
DO - 10.22059/jieng.2019.240353.1425
N2 - In real-world problems, machines are often not available for some periods of time due to events such as breakdowns, maintenance activities, and already planned operations. In this research, an unrelated parallel machine scheduling problem is considered where each machine is not available for some times during the planning horizon and also may not be capable of processing some jobs; these constraints are referred to as the processing constraints. On the other hand, the setup times are assumed to be job sequence-dependent as well as machine-dependent. The objective function of the problem considered is to minimize the total earliness and tardiness. First, the problem is formulated as a mixed integer linear programming model and then, in view of its NP-hardness, an imperialist competitive algorithm utilizing a new decoding procedure is proposed to solve large-sized problem instances. To assess the performance of the proposed algorithm, a number of instances are generated and solved.
UR - https://jieng.ut.ac.ir/article_74019.html
L1 - https://jieng.ut.ac.ir/article_74019_571889523953d457b66c690107c3db10.pdf
ER -