An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems
Permutation flow shop scheduling problems with makespan minimisation are considered in this paper. Flow shop scheduling is one important type of scheduling problems for the past several decades. Flow shop scheduling problems are non-deterministic polynomial time hard (NP-hard) problems. Hence the exact methods can not be used to solve these problems. Many heuristics and metaheuristics were addressed in the literature to solve the flow shop scheduling problems. Cuckoo Search is a recently developed metaheuristics algorithm. The efficiency of the algorithm may decrease as the parameters of the Cuckoo Search are constant. Hence an improved hybrid Cuckoo Search (IHCS) algorithm is developed in the present work to solve the permutation flow shop scheduling problems. The proposed algorithm has been implemented for some benchmark problems in the literature and the results are compared with some other metaheuristics algorithms.
improved hybrid cuckoo search ihcs metaheuristics heuristics flow shop scheduling makespan non-deterministic polynomial time hard np-hard