IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v7y1960i1p21-42.html
   My bibliography  Save this article

Summary of a Heuristic Line Balancing Procedure

Author

Listed:
  • Fred M. Tonge

    (Mathematics Division, The RAND Corporation)

Abstract

This paper presents a heuristic procedure for balancing production assembly lines and a computer program for carrying out that procedure. This research was undertaken to investigate the application of complex information processing techniques (as used in producing the Chess Machine and Logic Theorist) to a typical industrial problem. The assembly line balancing problem is stated as: Given an assembly process made up of elemental tasks, each with a time required per unit of product and an ordering with other tasks, what is the least number of work stations needed to attain a desired production rate? The heuristic procedure for assembly line balancing consists of three phases: (a) repeated simplification of the initial problem by grouping adjacent elemental tasks into compound tasks; (b) solution of the simpler problems thus created by assigning tasks to work stations at the least complex level possible, breaking up the compound tasks into their elements only when necessary for a solution; (c) smoothing the resulting balance by transferring tasks among work stations until the distribution of assigned time is as even as possible. The heuristics used in each phase are considered in some detail. Appropriate means for mechanizing such a procedure are discussed, and operating results of the program on actual problems are presented.

Suggested Citation

  • Fred M. Tonge, 1960. "Summary of a Heuristic Line Balancing Procedure," Management Science, INFORMS, vol. 7(1), pages 21-42, October.
  • Handle: RePEc:inm:ormnsc:v:7:y:1960:i:1:p:21-42
    DOI: 10.1287/mnsc.7.1.21
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.7.1.21
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.7.1.21?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. Hsiu-Hsueh Kao & Din-Horng Yeh & Yi-Hsien Wang, 2011. "Resource Constrained Assembly Line Balancing Problem Solved with Ranked Positional Weight Rule," Review of Economics & Finance, Better Advances Press, Canada, vol. 1, pages 71-80, November.
    2. Becker, Christian & Scholl, Armin, 2009. "Balancing assembly lines with variable parallel workplaces: Problem definition and effective solution procedure," European Journal of Operational Research, Elsevier, vol. 199(2), pages 359-374, December.
    3. Kucukkoc, Ibrahim & Zhang, David Z., 2014. "Mathematical model and agent based solution approach for the simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines," International Journal of Production Economics, Elsevier, vol. 158(C), pages 314-333.
    4. Ibrahim Kucukkoc & David Z. Zhang, 2017. "Balancing of mixed-model parallel U-shaped assembly lines considering model sequences," International Journal of Production Research, Taylor & Francis Journals, vol. 55(20), pages 5958-5975, October.
    5. Minghai Yuan & Hongyan Yu & Jinting Huang & Aimin Ji, 2019. "Reconfigurable assembly line balancing for cloud manufacturing," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2391-2405, August.
    6. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, 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:ormnsc:v:7:y:1960:i:1:p:21-42. 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.