IDEAS home Printed from https://ideas.repec.org/a/ids/ijpmbe/v9y2019i1p124-148.html
   My bibliography  Save this article

An improvement heuristic for permutation flow shop scheduling

Author

Listed:
  • Kewal Krishan Nailwal
  • Deepak Gupta
  • Kawal Jeet
  • Sameer Sharma

Abstract

An improvement heuristic algorithm is proposed in this paper for solving flow shop scheduling problem (Fm / prmu / Cmax). To test its efficiency, firstly the performance of the proposed algorithm is done against the six heuristics existing in the literature including the best NEH heuristic on 120 Taillard benchmarks. Further, this set of 120 Taillard instances is increased to 266 benchmark problem instances which include Carlier's, some Reeves and some new hard VRF instances from Vallada et al. (2015). On these instances, the performance of the proposed algorithm is tested against the best NEH and the famous CDS heuristic with the best known upper bounds. Further, a brief analysis of the other heuristics and metaheuristics existing in literature is done on Taillard problem instances. The proposed heuristic outperforms all the heuristics reported in this paper.

Suggested Citation

  • Kewal Krishan Nailwal & Deepak Gupta & Kawal Jeet & Sameer Sharma, 2019. "An improvement heuristic for permutation flow shop scheduling," International Journal of Process Management and Benchmarking, Inderscience Enterprises Ltd, vol. 9(1), pages 124-148.
    • Handle: RePEc:ids:ijpmbe:v:9:y:2019:i:1:p:124-148
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=97823
    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. Deepak Gupta & Sonia Goel & Neeraj Mangla, 2022. "Optimization of production scheduling in two stage Flow Shop Scheduling problem with m equipotential machines at first stage," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(3), pages 1162-1169, June.

    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:ijpmbe:v:9:y:2019:i:1:p:124-148. 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=95 .

    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.