On Dynamic Programming Methods for Assembly Line Balancing

Edward P. C. Kao and Maurice Queyranne
Additional contact information
Edward P. C. Kao: University of Houston, Houston, Texas
Maurice Queyranne: University of Houston, Houston, Texas

Operations Research, 1982, vol. 30, issue 2, 375-390

Abstract: Two dynamic programming approaches for treating sequencing problems—one proposed by Schrage and Baker and the other by Lawler—are discussed in the context of an assembly line balancing problem. A variant of the Schrage-Baker method is proposed to extend its range of applicability. The three approaches are compared using randomly generated test problems. We find that Lawler's “reaching”-based approach is superior to the other two “pulling”-based alternatives in both time and storage requirements. Based on the empirical results, we present time and space estimates for solving problems of different sizes and order strengths, and discuss the relative merits of the three procedures.

Keywords: 112 computer implementation; 586 dynamic programming (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.2.375 (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:oropre:v:30:y:1982:i:2:p:375-390

Access Statistics for this article

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