IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v44y1996i4p648-652.html
   My bibliography  Save this article

A Note on Heuristics of Flow-Shop Scheduling

Author

Listed:
  • Tsung-Chyan Lai

    (National Taiwan University, Taiwan)

Abstract

We present an O ( mn ) two-group (TG) heuristic for the m -machine, n -job permutation flow-shop scheduling problem. We show that heuristic TG has a worst-case performance ratio of ( m + 1)/2. We also establish worst-case bounds for several heuristics proposed in the past.

Suggested Citation

  • Tsung-Chyan Lai, 1996. "A Note on Heuristics of Flow-Shop Scheduling," Operations Research, INFORMS, vol. 44(4), pages 648-652, August.
    • Handle: RePEc:inm:oropre:v:44:y:1996:i:4:p:648-652
    DOI: 10.1287/opre.44.4.648
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.44.4.648
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.44.4.648?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Koulamas, Christos, 1998. "A new constructive heuristic for the flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 105(1), pages 66-71, February.
    2. Smutnicki, Czeslaw, 1998. "Some results of the worst-case analysis for flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 109(1), pages 66-87, August.
    3. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    4. Kyparisis, George J. & Koulamas, Christos, 2006. "Flexible flow shop scheduling with uniform parallel machines," European Journal of Operational Research, Elsevier, vol. 168(3), pages 985-997, February.
    5. J M Framinan & J N D Gupta & R Leisten, 2004. "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1243-1255, December.

    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:inm:oropre:v:44:y:1996:i:4:p:648-652. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.