IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v59y2012i8p643-655.html
   My bibliography  Save this article

Stein–Chen approximation and error bounds for order fill rates in assemble‐to‐order systems

Author

Listed:
  • Wenhui Zhou
  • Xiuli Chao

Abstract

Assemble‐to‐order (ATO) is an important operational strategy for manufacturing firms to achieve quick response to customer orders while keeping low finished good inventories. This strategy has been successfully used not only by manufacturers (e.g., Dell, IBM) but also by retailers (e.g., Amazon.com). The evaluation of order‐based performance is known to be an important but difficult task, and the existing literature has been mainly focused on stochastic comparison to obtain performance bounds. In this article, we develop an extremely simple Stein–Chen approximation as well as its error‐bound for order‐based fill rate for a multiproduct multicomponent ATO system with random leadtimes to replenish components. This approximation gives an expression for order‐based fill rate in terms of component‐based fill rates. The approximation has the property that the higher the component replenishment leadtime variability, the smaller the error bound. The result allows an operations manager to analyze the improvement in order‐based fill rates when the base‐stock level for any component changes. Numerical studies demonstrate that the approximation performs well, especially when the demand processes of different components are highly correlated; when the components have high base‐stock levels; or when the component replenishment leadtimes have high variability. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012

Suggested Citation

  • Wenhui Zhou & Xiuli Chao, 2012. "Stein–Chen approximation and error bounds for order fill rates in assemble‐to‐order systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(8), pages 643-655, December.
  • Handle: RePEc:wly:navres:v:59:y:2012:i:8:p:643-655
    DOI: 10.1002/nav.21514
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21514
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.21514?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Paul Glasserman & Yashan Wang, 1998. "Leadtime-Inventory Trade-Offs in Assemble-to-Order Systems," Operations Research, INFORMS, vol. 46(6), pages 858-871, December.
    2. Jing-Sheng Song, 2000. "A Note on Assemble-to-Order Systems with Batch Ordering," Management Science, INFORMS, vol. 46(5), pages 739-743, May.
    3. Susan H. Xu & Haijun Li, 2000. "Majorization of Weighted Trees: A New Tool to Study Correlated Stochastic Systems," Mathematics of Operations Research, INFORMS, vol. 25(2), pages 298-323, May.
    4. Saif Benjaafar & Mohsen ElHafsi, 2006. "Production and Inventory Control of a Single Product Assemble-to-Order System with Multiple Customer Classes," Management Science, INFORMS, vol. 52(12), pages 1896-1912, December.
    5. Yao Zhao & David Simchi-Levi, 2006. "Performance Analysis and Evaluation of Assemble-to-Order Systems with Stochastic Sequential Lead Times," Operations Research, INFORMS, vol. 54(4), pages 706-724, August.
    6. Susan H. Xu, 1999. "Structural Analysis of a Queueing System with Multiclasses of Correlated Arrivals and Blocking," Operations Research, INFORMS, vol. 47(2), pages 264-276, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. ElHafsi, Mohsen & Fang, Jianxin & Hamouda, Essia, 2020. "A novel decomposition-based method for solving general-product structure assemble-to-order systems," European Journal of Operational Research, Elsevier, vol. 286(1), pages 233-249.
    2. Rahimi-Ghahroodi, S. & Al Hanbali, A. & Vliegen, I.M.H. & Cohen, M.A., 2019. "Joint optimization of spare parts inventory and service engineers staffing with full backlogging," International Journal of Production Economics, Elsevier, vol. 212(C), pages 39-50.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Erica L. Plambeck, 2008. "Asymptotically Optimal Control for an Assemble-to-Order System with Capacitated Component Production and Fixed Transport Costs," Operations Research, INFORMS, vol. 56(5), pages 1158-1171, October.
    2. van Jaarsveld, Willem & Dollevoet, Twan & Dekker, Rommert, 2015. "Improving spare parts inventory control at a repair shop," Omega, Elsevier, vol. 57(PB), pages 217-229.
    3. van Jaarsveld, W.L. & Dollevoet, T.A.B., 2011. "Spare parts inventory control for an aircraft component repair shop," Econometric Institute Research Papers EI2011-24, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. Yao Zhao & David Simchi-Levi, 2006. "Performance Analysis and Evaluation of Assemble-to-Order Systems with Stochastic Sequential Lead Times," Operations Research, INFORMS, vol. 54(4), pages 706-724, August.
    5. Jing-Sheng Song & David D. Yao, 2002. "Performance Analysis and Optimization of Assemble-to-Order Systems with Random Lead Times," Operations Research, INFORMS, vol. 50(5), pages 889-903, October.
    6. Jing-Sheng Song & Yao Zhao, 2009. "The Value of Component Commonality in a Dynamic Inventory System with Lead Times," Manufacturing & Service Operations Management, INFORMS, vol. 11(3), pages 493-508, March.
    7. Zhao, Yao, 2009. "Analysis and evaluation of an Assemble-to-Order system with batch ordering policy and compound Poisson demand," European Journal of Operational Research, Elsevier, vol. 198(3), pages 800-809, November.
    8. de Kok, Ton & Grob, Christopher & Laumanns, Marco & Minner, Stefan & Rambau, Jörg & Schade, Konrad, 2018. "A typology and literature review on stochastic multi-echelon inventory models," European Journal of Operational Research, Elsevier, vol. 269(3), pages 955-983.
    9. Lijian Lu & Jing‐Sheng Song & Hanqin Zhang, 2015. "Optimal and asymptotically optimal policies for assemble‐to‐order n‐ and W‐systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(8), pages 617-645, December.
    10. Yi Yang & Jianan Wang & Youhua Chen & Zhiyuan Chen & Yanchu Liu, 2020. "Optimal procurement strategies for contractual assembly systems with fluctuating procurement price," Annals of Operations Research, Springer, vol. 291(1), pages 1027-1059, August.
    11. Rahimi-Ghahroodi, S. & Al Hanbali, A. & Vliegen, I.M.H. & Cohen, M.A., 2019. "Joint optimization of spare parts inventory and service engineers staffing with full backlogging," International Journal of Production Economics, Elsevier, vol. 212(C), pages 39-50.
    12. Atan, Zümbül & Ahmadi, Taher & Stegehuis, Clara & Kok, Ton de & Adan, Ivo, 2017. "Assemble-to-order systems: A review," European Journal of Operational Research, Elsevier, vol. 261(3), pages 866-879.
    13. Yalçin Akçay & Susan H. Xu, 2004. "Joint Inventory Replenishment and Component Allocation Optimization in an Assemble-to-Order System," Management Science, INFORMS, vol. 50(1), pages 99-116, January.
    14. Jing-Sheng Song & Susan H. Xu & Bin Liu, 1999. "Order-Fulfillment Performance Measures in an Assemble-to-Order System with Stochastic Leadtimes," Operations Research, INFORMS, vol. 47(1), pages 131-149, February.
    15. Emre Nadar & Mustafa Akan & Alan Scheller-Wolf, 2014. "Technical Note---Optimal Structural Results for Assemble-to-Order Generalized M -Systems," Operations Research, INFORMS, vol. 62(3), pages 571-579, June.
    16. Hu, Taizhong & Xie, Chaode & Ruan, Lingyan, 2005. "Dependence structures of multivariate Bernoulli random vectors," Journal of Multivariate Analysis, Elsevier, vol. 94(1), pages 172-195, May.
    17. Michel Denuit & Esther Frostig & Benny Levikson, 2007. "Supermodular Comparison of Time-to-Ruin Random Vectors," Methodology and Computing in Applied Probability, Springer, vol. 9(1), pages 41-54, March.
    18. ElHafsi, Mohsen & Fang, Jianxin & Hamouda, Essia, 2020. "A novel decomposition-based method for solving general-product structure assemble-to-order systems," European Journal of Operational Research, Elsevier, vol. 286(1), pages 233-249.
    19. Yao Zhao, 2008. "Evaluation and Optimization of Installation Base-Stock Policies in Supply Chains with Compound Poisson Demand," Operations Research, INFORMS, vol. 56(2), pages 437-452, April.
    20. Frostig, Esther, 2003. "Ordering ruin probabilities for dependent claim streams," Insurance: Mathematics and Economics, Elsevier, vol. 32(1), pages 93-114, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:59:y:2012:i:8:p:643-655. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.