IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v65y2014i10p1611-1624.html
   My bibliography  Save this article

A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops

Author

Listed:
  • Dipak Laha

    (Jadavpur University, Kolkata, India)

  • Jatinder N D Gupta

    (University of Alabama in Huntsville, Huntsville, USA)

  • Sagar U Sapkal

    (Jadavpur University, Kolkata, India)

Abstract

This paper proposes a penalty-shift-insertion (PSI)-based algorithm for the no-wait flow shop scheduling problem to minimize total flow time. In the first phase, a penalty-based heuristic, derived from Vogel’s approximation method used for the classic transportation problem is used to generate an initial schedule. In the second phase, a known solution is improved using a forward shift heuristic. Then the third phase improves this solution using a job-pair and a single-job insertion heuristic. Results of the computational experiments with a large number of randomly generated problem instances show that the proposed PSI algorithm is relatively more effective and efficient in minimizing total flow time in a no-wait flow shop than the state-of-the-art procedures. Statistical significance of better results obtained by the proposed algorithm is also reported.

Suggested Citation

  • Dipak Laha & Jatinder N D Gupta & Sagar U Sapkal, 2014. "A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(10), pages 1611-1624, October.
    • Handle: RePEc:pal:jorsoc:v:65:y:2014:i:10:p:1611-1624
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v65/n10/pdf/jors2013118a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v65/n10/full/jors2013118a.html
    File Function: Link to full text HTML
    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. 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.

    More about this item

    Statistics

    Access and download statistics

    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:pal:jorsoc:v:65:y:2014:i:10:p:1611-1624. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.