Advanced Search
MyIDEAS: Login to save this article or follow this journal

A Computing Procedure for a Line Balancing Problem


Author Info

  • James R. Jackson

    (Management Sciences Research Project, University of California, Los Angeles)

Registered author(s):


    In a recent article (Salveson, M. E. 1955. The assembly line balancing problem. J. Indust. Engrg. VI 18-25.), M. E. Salveson discussed various problems concerned with setting up production lines. The purpose of the present paper is to set forth an enumeration procedure for solving one of these problems. The reader is referred to Salveson's article for a detailed discussion of the circumstances in which this problem arises and for remarks concerning the assumptions in its statement.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 2 (1956)
    Issue (Month): 3 (April)
    Pages: 261-271

    as in new window
    Handle: RePEc:inm:ormnsc:v:2:y:1956:i:3:p:261-271

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:
    More information through EDIRC

    Related research



    No references listed on IDEAS
    You can help add them by filling out this form.


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

    Cited by:
    1. Vilà, Mariona & Pereira, Jordi, 2013. "An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time," European Journal of Operational Research, Elsevier, vol. 229(1), pages 106-113.
    2. Otto, Alena & Otto, Christian & Scholl, Armin, 2013. "Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 228(1), pages 33-45.
    3. 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.
    4. Matthias Amen, 2003. "Heuristic methods for cost-oriented assembly line balancing: a comparison on solution quality and computing time," GE, Growth, Math methods 0309004, EconWPA, revised 09 Sep 2003.
    5. Battaïa, Olga & Dolgui, Alexandre, 2013. "A taxonomy of line balancing problems and their solutionapproaches," International Journal of Production Economics, Elsevier, vol. 142(2), pages 259-277.
    6. Gokcen, Hadi & Faruk Baykoc, O., 1999. "A new line remedial policy for the paced lines with stochastic task times," International Journal of Production Economics, Elsevier, vol. 58(2), pages 191-197, January.
    7. Zulch, Gert & Braun, Wolfgang J. & Schiller, Emmerich F., 1997. "Analytical approach of determining job division in manual assembly systems," International Journal of Production Economics, Elsevier, vol. 51(1-2), pages 123-134, August.
    8. Bautista, Joaquín & Pereira, Jordi, 2009. "A dynamic programming based heuristic for the assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 787-794, May.
    9. Scholl, Armin & Becker, Christian, 2005. "A note on "An exact method for cost-oriented assembly line balancing"," International Journal of Production Economics, Elsevier, vol. 97(3), pages 343-352, September.
    10. Bautista, Joaquín & Pereira, Jordi, 2011. "Procedures for the Time and Space constrained Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 473-481, August.
    11. Chiang, Wen-Chyuan & Urban, Timothy L., 2006. "The stochastic U-line balancing problem: A heuristic procedure," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1767-1781, December.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:2:y:1956:i:3:p:261-271. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.