IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v29y2012i02ns0217595912500121.html
   My bibliography  Save this article

A Hybrid Harmony Search Algorithm For The No-Wait Flow-Shop Scheduling Problems

Author

Listed:
  • KAI-ZHOU GAO

    (College of Computer Sciences, Liaocheng University, 252059 Liaocheng, China)

  • QUAN-KE PAN

    (College of Computer Sciences, Liaocheng University, 252059 Liaocheng, China)

  • JUN-QING LI

    (College of Computer Sciences, Liaocheng University, 252059 Liaocheng, China)

  • YU-TING WANG

    (College of Computer Sciences, Liaocheng University, 252059 Liaocheng, China)

  • JING LIANG

    (School of Electrical Engineering, Zhengzhou University, 450000 Zhengzhou, China)

Abstract

This paper presents a hybrid harmony search (HHS) algorithm for solving no-wait flow shop scheduling problems with total flowtime criterion. First, an initial harmony memory (HM) is formed by taking advantage of the NEH heuristic. Second, the harmony memory is divided into several small groups and each group executes its evolution process independently. At the same time, groups share information reciprocally by dynamic re-grouping mechanism. Third, to stress the balance between the global exploration and local exploration, a variable neighborhood search algorithm is developed and embedded in the HHS algorithm. In addition, a speed-up method is applied to reduce the running time requirement. Computational simulation results based on the well-known benchmarks and statistical performance comparisons are provided. It is shown that the proposed HHS algorithm is superior to the recently published hybrid DE-based (HDE) algorithm and hybrid particle swarm optimization (HPSO) algorithm in terms of effectiveness and efficiency.

Suggested Citation

  • Kai-Zhou Gao & Quan-Ke Pan & Jun-Qing Li & Yu-Ting Wang & Jing Liang, 2012. "A Hybrid Harmony Search Algorithm For The No-Wait Flow-Shop Scheduling Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 29(02), pages 1-23.
    • Handle: RePEc:wsi:apjorx:v:29:y:2012:i:02:n:s0217595912500121
    DOI: 10.1142/S0217595912500121
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595912500121
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595912500121?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. K. Z. Gao & P. N. Suganthan & Q. K. Pan & T. J. Chua & T. X. Cai & C. S. Chong, 2016. "Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 363-374, April.
    2. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.

    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:wsi:apjorx:v:29:y:2012:i:02:n:s0217595912500121. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.