IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v52y2001i4d10.1057_palgrave.jors.2601110.html
   My bibliography  Save this article

Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times

Author

Listed:
  • A Allahverdi

    (Kuwait University)

  • T Aldowaisan

    (Kuwait University)

Abstract

This paper addresses the problem of minimizing total completion time in a two-machine no-wait flowshop where setup times of the jobs are sequence-dependent. Optimal solutions are obtained for two special flowshops and a dominance relation is developed for the general problem. Several heuristic algorithms with the computational complexity of O(n2) and O(n3) are constructed. The heuristics consist of two phases: in the first phase a starting list is developed and in the second a repeated insertion technique is applied. Computational experience demonstrates that the concept of repeated insertion application is quite useful for any starting list and that solutions for all starting lists converge to about the same value of less than 1% after a few iterations.

Suggested Citation

  • A Allahverdi & T Aldowaisan, 2001. "Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(4), pages 449-462, April.
    • Handle: RePEc:pal:jorsoc:v:52:y:2001:i:4:d:10.1057_palgrave.jors.2601110
    DOI: 10.1057/palgrave.jors.2601110
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601110
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601110?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Koulamas, Christos & Kyparisis, George J., 2004. "Concurrent flowshop scheduling to minimize makespan," European Journal of Operational Research, Elsevier, vol. 156(2), pages 524-529, July.
    2. 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.
    3. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, 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:pal:jorsoc:v:52:y:2001:i:4:d:10.1057_palgrave.jors.2601110. 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.