IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v28y2017i1p87-97.html
   My bibliography  Save this article

Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling

Author

Listed:
  • Suchithra Rajendran
  • Chandrasekharan Rajendran
  • Rainer Leisten

Abstract

In this paper, we propose two new heuristic tie-breaking rules in the implementation of the well-known NEH heuristic for permutation flow-shop scheduling. While implementing this heuristic, it is known that ties do frequently occur when the initial ordering of jobs is obtained and when the choice of the best partial sequence among the sequences having the same makespan is done. In this paper, we propose two heuristic tie-breaking rules called NEHMSWG and NEHMinS-PS. We investigate their performance and that of the best-known heuristic tie-breaking rule, relative to the optimal/best-known upper bounds on the makespan, by considering benchmark permutation flow-shop scheduling problem instances. The results of performance evaluation reveal that the proposed tie-breaking rules are simple and effective, and improve the solutions with respect to many problem instances in comparison to the best known heuristic rule reported in the literature.

Suggested Citation

  • Suchithra Rajendran & Chandrasekharan Rajendran & Rainer Leisten, 2017. "Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 28(1), pages 87-97.
    • Handle: RePEc:ids:ijores:v:28:y:2017:i:1:p:87-97
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=80597
    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.

    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:ijores:v:28:y:2017:i:1:p:87-97. 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=170 .

    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.