Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan
Article
Marichelvam, M., Prabaharan, T. and Yang, X. 2014. Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Applied Soft Computing. 19, pp. 93-101. https://doi.org/10.1016/j.asoc.2014.02.005
Type | Article |
---|---|
Title | Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan |
Authors | Marichelvam, M., Prabaharan, T. and Yang, X. |
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. |
Keywords | Hybrid flow shop (HFS); Scheduling; NP-hard; Improved cuckoo search (ICS); Metaheuristics |
Publisher | Elsevier |
Journal | Applied Soft Computing |
ISSN | 1568-4946 |
Publication dates | |
Jun 2014 | |
Publication process dates | |
Deposited | 30 Apr 2015 |
Output status | Published |
Digital Object Identifier (DOI) | https://doi.org/10.1016/j.asoc.2014.02.005 |
Web of Science identifier | WOS:000334768800010 |
Language | English |
Permalink -
https://repository.mdx.ac.uk/item/85366
45
total views0
total downloads0
views this month0
downloads this month