IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v7y2016i2p1-14.html
   My bibliography  Save this article

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

Author

Listed:
  • M.K. Marichelvam

    (Department of Mechanical Engineering, Mepco Schlenk Engineering College, Sivakasi, India)

  • Ömür Tosun

    (Department of International Trade and Logistics, Faculty of Applied Sciences, Akdeniz University, Antalya, Turkey)

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.

Suggested Citation

  • M.K. Marichelvam & Ömür 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), IGI Global, vol. 7(2), pages 1-14, April.
    • Handle: RePEc:igg:jsir00:v:7:y:2016:i:2:p:1-14
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2016040101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jsir00:v:7:y:2016:i:2:p:1-14. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.