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

On Assembly-Line Balancing Problems

Author

Listed:
  • Raymond Reiter

    (University of London Institute of Computer Science, London, England)

Abstract

This paper considers three kinds of assembly-line disciplines: assembly lines without parallel subassemblies, lines with parallel subassemblies, and single-product assembly lines. To each such discipline there corresponds a line balancing problem. For the second and third disciplines, feasible (but not necessarily optimal) balances are characterized in terms of the directed graph defining the line. For any feasible balance, the minimum cycle time or assembly time can be computed easily from a certain graph, and a corresponding Gantt diagram determined. For the case of lines with parallel subassemblies, the paper gives a line initialization procedure such that, after initialization, the line can easily be balanced optimally.

Suggested Citation

  • Raymond Reiter, 1969. "On Assembly-Line Balancing Problems," Operations Research, INFORMS, vol. 17(4), pages 685-700, August.
    • Handle: RePEc:inm:oropre:v:17:y:1969:i:4:p:685-700
    DOI: 10.1287/opre.17.4.685
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.17.4.685
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.17.4.685?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, 2000. "Heuristic methods for cost-oriented assembly line balancing: A survey," International Journal of Production Economics, Elsevier, vol. 68(1), pages 1-14, October.
    2. Amen, Matthias, 2006. "Cost-oriented assembly line balancing: Model formulations, solution difficulty, upper and lower bounds," European Journal of Operational Research, Elsevier, vol. 168(3), pages 747-770, February.

    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:inm:oropre:v:17:y:1969:i:4:p:685-700. 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.