Welcome to the InfoSci Platform
Reference Hub5
Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion

Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion

M.K. Marichelvam, Ömür Tosun
Copyright: © 2016 |Volume: 7 |Issue: 2 |Pages: 14
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781466691575|DOI: 10.4018/IJSIR.2016040101
Cite Article Cite Article

MLA

Marichelvam, M.K., and Ömür Tosun. "Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion." IJSIR vol.7, no.2 2016: pp.1-14. http://doi.org/10.4018/IJSIR.2016040101

APA

Marichelvam, M. & Tosun, Ö. (2016). Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion. International Journal of Swarm Intelligence Research (IJSIR), 7(2), 1-14. http://doi.org/10.4018/IJSIR.2016040101

Chicago

Marichelvam, M.K., and Ömür Tosun. "Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion," International Journal of Swarm Intelligence Research (IJSIR) 7, no.2: 1-14. http://doi.org/10.4018/IJSIR.2016040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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 percentage deviation (PD) of the solution from the lower bound. The results indicate that the proposed CSA algorithm is quite effective in reducing makespan because average PD is observed as 1.531, whereas the next best algorithm has result of average PD of 2.295 which is in general nearly 50% worse and other algorithms start from 3.833.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.