TY - JOUR ID - 9797 TI - A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times JO - Journal of Industrial and Systems Engineering JA - JISE LA - en SN - 1735-8272 AU - Abyaneh, Farzaneh Rajaee AU - Gholami, Saeedeh AD - Department of Industrial Engineering, K.N.ToosiUniversity of Technology, Tehran, Iran Y1 - 2015 PY - 2015 VL - 8 IS - 2 SP - 67 EP - 85 KW - scheduling KW - hybrid flow-shop KW - unrelated machines KW - sequence-dependent setup time KW - earliness-tardiness DO - N2 - In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combined with genetic operators. Also, an application of simulated annealing is presented for the evaluation of the algorithms. A Taguchi design is conducted to set their parameters. Finally, a comparison is made via 16 small size and 24 large size test problems and each problem is run 10times. The results of one-way ANOVA demonstrate that the proposed memetic algorithm performs as efficient as the HSA qualitatively and with 63.77% decline in elapsed time. UR - https://www.jise.ir/article_9797.html L1 - https://www.jise.ir/article_9797_36ccc21ed206710db1d68deaea1329f7.pdf ER -