@article { author = {Abyaneh, Farzaneh and Gholami, Saeedeh}, title = {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}, journal = {Journal of Industrial and Systems Engineering}, volume = {8}, number = {2}, pages = {67-85}, year = {2015}, publisher = {Iranian Institute of Industrial Engineering}, issn = {1735-8272}, eissn = {2717-3380}, doi = {}, abstract = {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.}, keywords = {scheduling,hybrid flow-shop,unrelated machines,sequence-dependent setup time,earliness-tardiness}, url = {https://www.jise.ir/article_9797.html}, eprint = {https://www.jise.ir/article_9797_36ccc21ed206710db1d68deaea1329f7.pdf} }