A Preference Order Dynamic Program for Stochastic Assembly Line Balancing

Edward P. C. Kao
Additional contact information
Edward P. C. Kao: University of Wisconsin-Milwaukee

Management Science, 1976, vol. 22, issue 10, 1097-1104

Abstract: Consider an assembly line balancing problem with stochastic task times. Our objective is to find a grouping of tasks into stations that satisfies all precedence relations and minimizes the number of stations, subject to the constraint that the probability that the resulting station work content at each station is no more than the given cycle time is bounded by a given value. Similar to Held and Karp's approach, we formulate the problem in dynamic programming. The solution procedure is based on Mitten's preference order dynamic programming

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.10.1097 (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:22:y:1976:i:10:p:1097-1104

Access Statistics for this article

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