Analysis of a Preference Order Assembly Line Problem

Moshe Sniedovich
Additional contact information
Moshe Sniedovich: CSIR, South Africa

Management Science, 1981, vol. 27, issue 9, 1067-1080

Abstract: An analysis is made of a preference order dynamic programming procedure proposed in the literature for stochastic assembly line balancing problems. It is shown that in general the procedure does not satisfy the monotonicity condition and that therefore there is no guarantee that the solutions will be optimal. It is also shown that for a certain class of problems for which the procedure does yield optimal solutions, the proposed preference order model can be reformulated as a regular dynamic programming model.

Keywords: dynamic programming; production/scheduling: line balancing; utility/preference: applications (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.27.9.1067 (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:27:y:1981:i:9:p:1067-1080

Access Statistics for this article

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