IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v23y2016i4p467-481.html
   My bibliography  Save this article

Application of novel harmony search algorithm for solving hybrid flow shop scheduling problems to minimise makespan

Author

Listed:
  • M.K. Marichelvam
  • M. Geetha

Abstract

This paper addresses the multistage hybrid flow shop (HFS) scheduling problems, which are found in many industries. The HFS scheduling problems are known to be non-deterministic polynomial time hard (NP-hard) problems. The objective is to minimise the makespan. Due to the complexity of the problem, researchers developed many metaheuristics to solve the problem. In this paper, harmony search (HS) algorithm, a recently developed music-based metaheuristic is proposed to solve the problem. Computational experiments are conducted to verify the performance of the proposed algorithm. The results proved that the HS algorithm outperforms many other algorithms addressed in the literature.

Suggested Citation

  • M.K. Marichelvam & M. Geetha, 2016. "Application of novel harmony search algorithm for solving hybrid flow shop scheduling problems to minimise makespan," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 23(4), pages 467-481.
    • Handle: RePEc:ids:ijisen:v:23:y:2016:i:4:p:467-481
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=77698
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Gheisariha, Elmira & Tavana, Madjid & Jolai, Fariborz & Rabiee, Meysam, 2021. "A simulation–optimization model for solving flexible flow shop scheduling problems with rework and transportation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 180(C), pages 152-178.

    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:ids:ijisen:v:23:y:2016:i:4:p:467-481. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.