IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v70y1997i0p415-43810.1023-a1018942709213.html
   My bibliography  Save this article

No-wait flow shop scheduling with large lot sizes

Author

Listed:
  • Alessandro Agnetis

Abstract

NO-WAIT FLOW SHOP consists of minimizing the completion time of a set of N parts that must undergo a series of m machines in the same order, with the constraint that each part, once started, cannot wait on or between the machines. The problem is known to be NP-complete for m ≥ 3, while an O(N log N) algorithm exists when m=2. In this paper, some new results are presented concerning the case in which parts are grouped into lots of identical parts. An ε-approximate algorithm is proposed, based on the solution to a trans-portation problem. The relative error of the approximation goes to zero as the size of any lot grows. Experimental results are reported comparing our approach with the only other ε-approximate algorithm known in literature. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • Alessandro Agnetis, 1997. "No-wait flow shop scheduling with large lot sizes," Annals of Operations Research, Springer, vol. 70(0), pages 415-438, April.
    • Handle: RePEc:spr:annopr:v:70:y:1997:i:0:p:415-438:10.1023/a:1018942709213
    DOI: 10.1023/A:1018942709213
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018942709213
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018942709213?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. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    2. Che, Ada & Chu, Chengbin, 2009. "Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots," European Journal of Operational Research, Elsevier, vol. 199(1), pages 77-88, November.

    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:spr:annopr:v:70:y:1997:i:0:p:415-438:10.1023/a:1018942709213. 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.springer.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.