@article { author = {Rezaeian Zeidi, J. and Zarei, M. and Shokoufi, K.}, title = {Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times}, journal = {International Journal of Engineering}, volume = {30}, number = {12}, pages = {1863-1869}, year = {2017}, publisher = {Materials and Energy Research Center}, issn = {1025-2495}, eissn = {1735-9244}, doi = {}, abstract = {This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the model for real-sized applications, a Pareto-based algorithm, namely controlled elitism non-dominated sorting genetic algorithm (CENSGA), is proposed. To validate its performance, the algorithm is examined under six performance metric measures, and compared with a Pareto-based algorithm, namely NSGA-II. The results are statistically evaluated by the Mann–Whitney test and t-test methods. From the obtained results based on the t-test, the proposed CENSGA significantly outperforms the NSGA-II in four out of six terms. Additionally, the statistical results from Mann–Whitney test show that the performance of the proposed CENSGA is better than the NSGA- II in two out of six terms. Finally, the experimental results indicate the effectiveness of the proposed algorithm for different problems.}, keywords = {multi,objective optimization,Unrelated parallel machine,just,In,time Scheduling,Controlled elitism non,dominated sorting genetic algorithm,mixed integer programming,Sequence,dependent setup time}, url = {https://www.ije.ir/article_73076.html}, eprint = {https://www.ije.ir/article_73076_0206e099bd9ad1d54af1a53028ae7e18.pdf} }