A Subassembly Manufacturing Yield Problem with Multiple Production Runs

Purushottaman Nandakumar and Jeffrey L. Rummel
Additional contact information
Purushottaman Nandakumar: University of Connecticut, Storrs, Connecticut
Jeffrey L. Rummel: University of Connecticut, Storrs, Connecticut

Operations Research, 1998, vol. 46, issue 3-supplement-3, S50-S64

Abstract: We consider the assembly of a product that needs to exceed a certain length. The subassemblies are manufactured with a planned length setting. The resulting lengths of the subassemblies are not known with certainty, and vary about the planned setting. After the subassemblies are manufactured, those that fall short are rerun. This process is repeated until all subassemblies exceed the required length. We build and solve a model, to specify the planned length at each run, that minimizes the expected cost of production.

Keywords: Production scheduling; assembly yields; Dynamic programming; applications; Production/scheduling; stochastic (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.46.3.S50 (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:46:y:1998:i:3-supplement-3:p:s50-s64

Access Statistics for this article

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