A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop
Jingcao Cai, Deming Lei, Ming Li
Abstract
Hybrid flow shop scheduling problem has been extensively considered in single factory; however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated in multiple factories and should be studied fully with the applications of distributed manufacturing. In this study, DHFSP with sequence-dependent setup times is considered, in which factory assignment and machine assignment of first stage are integrated together. A new shuffled frog-leaping algorithm with memeplex quality (MQSFLA) is proposed to minimise total tardiness and makespan simultaneously. Solution quality of memeplex is measured and new search process is implemented according to solution quality. Evolution quality is evaluated for each memeplex and adopted for dynamically selecting memeplexes in a novel memeplex shuffling. A number of experiments are conducted to test the new strategies and performances of MQSFLA. The computational results demonstrate the effectiveness of the new strategies and the promising advantages of MQSFLA.