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

A heuristic algorithm to minimise the total flowtime of jobs in permutation flowshops

Author

Listed:
  • J. Krishnaraj
  • S. Pugazhendhi
  • Chandrasekharan Rajendran
  • S. Thiagarajan

Abstract

A heuristic algorithm with six implementations (HA-I to HA-VI) is presented in this paper, and it is used to solve the permutation flowshop scheduling problem to minimise the total flowtime of jobs. These implementations have been evaluated by using the 90 benchmark flowshop scheduling problem instances, and the solutions yielded are compared with the solutions reported in the literature. The comparison shows that the implementations all together have produced better solutions for 28 problem instances and same solutions for 29 problem instances, out of 90 problem instances considered with respect to the solutions by Iterated Local Search algorithm proposed by Dong et al. (2009). They have also produced better solutions for 50 problem instances and the same solutions for 19 problem instances, out of 90 problem instances considered with respect to the solutions by PSOvns algorithm proposed by Tasgetiren et al. (2007), as reported in Dong et al. (2009).

Suggested Citation

  • J. Krishnaraj & S. Pugazhendhi & Chandrasekharan Rajendran & S. Thiagarajan, 2014. "A heuristic algorithm to minimise the total flowtime of jobs in permutation flowshops," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 17(4), pages 511-532.
    • Handle: RePEc:ids:ijisen:v:17:y:2014:i:4:p:511-532
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=63967
    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:ijisen:v:17:y:2014:i:4:p:511-532. 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.