َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

محورهای موضوعی : Design of Experiment

Bahman Naderi ¹ , Hassan Sadeghi ²

1 - Young Researches Club, Qazvin Branch, Islamic Azad University, Qazvin, Iran
2 - Young Researchers Club, Qazvin Branch, Islamic Azad University, Qazvin, Iran

تاریخ دریافت : 1390/02/27 تاریخ پذیرش : 1392/08/22 تاریخ انتشار : 1391/07/09

کلید واژه: Makespan, No-wait hybrid flowshop scheduling, Multi-objective simulated annealing algorithm, Total weighted tardiness,

چکیده مقاله :

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presents a new multi-objective simulated annealing algorithm (MOSA). A set of experimental instances are carried out to evaluate the algorithm by advanced multi-objective performance measures. The algorithm is carefully evaluated for its performance against available algorithm by means of multi-objective performance measures and statistical tools. The related results show that a variant of our proposed MOSA provides sound performance comparing with other algorithms.