Abstract
Abstract In this paper, we consider an assemble-to-order manufacturing system producing a single end product, assembled from n components, and serving an after sales market for individual components. Components are produced in a make-to-stock fashion, one unit at a time, on independent production facilities. Production times are exponentially distributed with finite production rates. The components are stocked ahead of demand and therefore incur a holding cost rate per unit. Demand for the end product as well as for the individual components occurs continuously over time according to independent Poisson streams. In order to characterize the optimal production and inventory rationing policies, we formulate such a problem using a Markov decision process framework. In particular, we show that the optimal component production policy is a state-dependent base-stock policy. We also show that the optimal component inventory rationing policy is a rationing policy with state-dependent rationing levels. Recognizing that such a policy is generally not only difficult to obtain numerically but also is difficult to implement in practice, we propose three heuristic policies that are easier to implement in practice. We show that two of these heuristics are highly efficient compared to the optimal policy. In particular, we show that one of the two heuristics strikes a balance between high efficiency and computational effort and thus can be used as an effective substitute of the optimal policy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.