A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion
International Journal of Swarm Intelligence Research
In this work, the performance of cuckoo search algorithm (CSA) is measured solving the multistage hybrid flow shop (HFS) scheduling problems with parallel machines. The objective is the minimization of makespan. The HFS scheduling problems are proved to be strongly non-deterministic polynomial time-hard (NP-hard). Proposed CSA algorithm has been tested on benchmark problems addressed in the literature against other well-known algorithms. The results are presented in terms of percentagedoi:10.4018/ijsir.2016040101 fatcat:wywk2h242jhgtcq65b3j46wgna