Asymptotically Optimal Inventory Control for Assemble-to-Order Systems

3Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider assemble-to-order (ATO) inventory systems with a general bill of materials and general deterministic lead times. Unsatisfied demands are always backlogged. We apply a four-step asymptotic framework to develop inventory policies for minimizing the long-run average expected total inventory cost. Our approach features a multistage stochastic program (SP) to establish a lower bound on the inventory cost and determine param-eter values for inventory control. Our replenishment policy deviates from the conventional constant base stock policies to accommodate nonidentical lead times. Our component allocation policy differentiates demands based on backlog costs, bill of materials, and component availabilities. We prove that our policy is asymptotically optimal on the diffusion scale, that is, as the longest lead time grows, the percentage difference between the average cost under our policy and its lower bound converges to zero. In developing these results, we formulate a broad stochastic tracking model and prove general convergence results from which the asymptotic optimality of our policy follows as specialized corollaries.

Cite

CITATION STYLE

APA

Reiman, M. I., Wan, H., & Wang, Q. (2023). Asymptotically Optimal Inventory Control for Assemble-to-Order Systems. Stochastic Systems, 13(1), 128–180. https://doi.org/10.1287/stsy.2022.0099

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free