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.

Item Type: Article
Research Areas: A. > School of Science and Technology > Design Engineering and Mathematics
Item ID: 15627
Useful Links:
Depositing User: Xin-She Yang
Date Deposited: 30 Apr 2015 13:25
Last Modified: 10 Jun 2019 13:07
URI: https://eprints.mdx.ac.uk/id/eprint/15627

Actions (login required)

View Item View Item

Statistics

Downloads
Activity Overview
0Downloads
435Hits

Additional statistics are available via IRStats2.