Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan

Marichelvam, M. K., Prabaharan, T. and Yang, Xin-She ORCID: https://orcid.org/0000-0001-8231-5556 (2014) Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Applied Soft Computing, 19 . pp. 93-101. ISSN 1568-4946 [Article] (doi:10.1016/j.asoc.2014.02.005)

Abstract

The multistage hybrid flow shop (HFS) scheduling problems are considered in this paper. Hybrid flowshop scheduling problems were proved to be NP-hard. A recently developed cuckoo search (CS) metaheuristic algorithm is presented in this paper to minimize the makespan for the HFS scheduling problems. A constructive heuristic called NEH heuristic is incorporated with the initial solutions to obtain the optimal or near optimal solutions rapidly in the improved cuckoo search (ICS) algorithm. The proposed algorithm is validated with the data from a leading furniture manufacturing company. Computational results show that the ICS algorithm outperforms many other metaheuristics.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

0Downloads

6 month trend

487Hits

Additional statistics are available via IRStats2.