A heuristic network procedure for the assembly line balancing problem

Peter A. Pinto, David G. Dannenbring and Basheer M. Khumawala

Naval Research Logistics Quarterly, 1978, vol. 25, issue 2, 299-307

Abstract: Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally yields better solutions than those obtained by application of the heuristics, and b) sensitivity analysis with different values of cycle time is possible without having to regenerate the network. The rationale for its effectiveness and its application to problems with paralleling are presented. Computational experience with the procedure on up to 50 task test problems is provided.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800250210

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:wly:navlog:v:25:y:1978:i:2:p:299-307

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().