An Algorithm for the Line Balancing Problem

Allan L. Gutjahr and George L. Nemhauser
Additional contact information
Allan L. Gutjahr: The Johns Hopkins University, Baltimore, Maryland
George L. Nemhauser: The Johns Hopkins University, Baltimore, Maryland

Management Science, 1964, vol. 11, issue 2, 308-315

Abstract: An algorithm, based on finding a shortest route in a finite directed network, is given for the assembly line balancing problem. Arc lengths are such that it is sufficient to find any path from the origin to destination node containing a minimal number of arcs. Computational results are presented and the algorithm is compared with prior analytical methods of line balancing.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (27)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.11.2.308 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:11:y:1964:i:2:p:308-315

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().