Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Dynamic Type Mating

Izak Duenyas, Matthew F. Keblis and Stephen M. Pollock
Management Science
Vol. 43, No. 6 (Jun., 1997), pp. 751-763
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2634620
Page Count: 13
  • Download ($30.00)
  • Cite this Item
Dynamic Type Mating
Preview not available

Abstract

We address an assembly problem, motivated by flat panel display manufacturing, where the quality (or performance) of the final product depends upon characteristics of the components to be assembled, which are not constant from component to component. We analyze the tradeoff between the increase in the potential value of products gained by putting off the "mating" of components exhibiting various characteristic "types," and the inventory costs caused by this delay in mating. We formulate this dynamic type mating problem as a Markov Decision Process and characterize the structure of the optimal policy for special cases. We then present a heuristic policy for a more general case and compare its performance against the optimal policy. Computational results indicate that the heuristic is effective for a wide variety of cases.

Page Thumbnails

  • Thumbnail: Page 
751
    751
  • Thumbnail: Page 
752
    752
  • Thumbnail: Page 
753
    753
  • Thumbnail: Page 
754
    754
  • Thumbnail: Page 
755
    755
  • Thumbnail: Page 
756
    756
  • Thumbnail: Page 
757
    757
  • Thumbnail: Page 
758
    758
  • Thumbnail: Page 
759
    759
  • Thumbnail: Page 
760
    760
  • Thumbnail: Page 
761
    761
  • Thumbnail: Page 
762
    762
  • Thumbnail: Page 
763
    763