An energy-efficient multi-objective permutation flow shop scheduling problem using an improved hybrid cuckoo search algorithm
Wenbin Gu, Zhuo Li, Min Dai, Minghai Yuan
Abstract
The flow shop scheduling problem has been widely studied in recent years, but the research on multi-objective flow shop scheduling with green indicators is still relatively limited. It is urgent to strengthen the research on effective methods to solve such interesting problems. To consider the economic and environmental factors simultaneously, the paper investigates the multi-objective permutation flow shop scheduling problems (MOPFSP) which minimizes the makespan and total carbon emissions. Since MOPFSP is proved to be a NP-hard problem for more than two machines. A hybrid cuckoo search algorithm (HCSA) is proposed to solve the problems. Firstly, a largest-order-value method is proposed to enhance the performance of HCS algorithm in the solution space of MOPFSP. Then, an adaptive factor of step size is designed to control the search scopes in the evolution phases. Finally, a multi-neighborhood local search rule is addressed in order to find the optimal sub-regions obtained by the HCSA. Numerical experiments show that HCSA can solve MOPFSP efficiently.