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

Bounds for Assembly Line Balancing Heuristics

Author

Listed:
  • Maurice Queyranne

    (The University of British Columbia, Vancouver, British Columbia)

Abstract

We analyze the asymptotic worst-case performance ratio of polynomial time heuristics for the assembly line balancing problem. Assuming that P ≠ NP , we show that no polynomial heuristic has worst-case ratio less than 1.5. (This ratio is known to be not worse than 2 for any “reasonable” heuristic.) Tighter results are established for problems with only “short” tasks, i.e., when all processing times do not exceed a given fraction of the cycle time. These results apply even to planar, series-parallel precedence constraints, and contrast with known results for situations with an empty precedence relation, i.e., the bin packing problem. In particular, if P ≠ NP , there are no fully polynomial approximation schemes for assembly line balancing, even with “short” tasks and planar, series-parallel precedence constraints.

Suggested Citation

  • Maurice Queyranne, 1985. "Bounds for Assembly Line Balancing Heuristics," Operations Research, INFORMS, vol. 33(6), pages 1353-1359, December.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:6:p:1353-1359
    DOI: 10.1287/opre.33.6.1353
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.6.1353
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.6.1353?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. Amen, Matthias, 2001. "Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time," International Journal of Production Economics, Elsevier, vol. 69(3), pages 255-264, February.
    2. Boysen, Nils & Fliedner, Malte, 2008. "A versatile algorithm for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 184(1), pages 39-56, January.
    3. Santiago Valdés Ravelo, 2022. "Approximation algorithms for simple assembly line balancing problems," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 432-443, March.

    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:33:y:1985:i:6:p:1353-1359. 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.