IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v50y2004i1p99-116.html
   My bibliography  Save this article

Joint Inventory Replenishment and Component Allocation Optimization in an Assemble-to-Order System

Author

Listed:
  • Yalçin Akçay

    (College of Administrative Sciences and Economics, Koç University, Rumeli Feneri Yolu, Sariyer, Istanbul, 34450, Turkey)

  • Susan H. Xu

    (Department of Supply Chain and Information Systems, The Smeal College of Business Administration, The Pennsylvania State University, University Park, Pennsylvania 16802)

Abstract

This paper considers a multicomponent, multiproduct periodic-review assemble-to-order (ATO) system that uses an independent base-stock policy for inventory replenishment. Product demands in each period are integer-valued correlated random variables, with each product being assembled from multiple units of a subset of components. The system quotes a prespecified response time window for each product and receives a reward if the demand for that product is filled within its response time window. We formulate a two-stage stochastic integer program with recourse to determine the optimal base-stock policy and the optimal component allocation policy for the ATO system. We show that the component allocation problem is a general multidimensional knapsack problem (MDKP) and is NP-hard. We propose a simple, order-based component allocation rule and show that it can be solved in either polynomial or pseudopolynomial time. We also use the sample average approximation method to determine the optimal base-stock levels and compare it with two variations of the equal fractile heuristic. Intensive testing indicates that our solution method for each stage of the stochastic program is robust, effective, and that it significantly outperforms existing methods. Finally, we discuss several managerial implications of our findings.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ormnsc:v:50:y:2004:i:1:p:99-116
    DOI: 10.1287/mnsc.1030.0167
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.1030.0167
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.1030.0167?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. Magazine, M. J. & Oguz, Osman, 1984. "A heuristic algorithm for the multidimensional zero-one knapsack problem," European Journal of Operational Research, Elsevier, vol. 16(3), pages 319-326, June.
    3. 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.
    4. Jing-Sheng Song, 1998. "On the Order Fill Rate in a Multi-Item, Base-Stock Inventory System," Operations Research, INFORMS, vol. 46(6), pages 831-845, December.
    5. Hausman, Warren H. & Lee, Hau L. & Zhang, Alex X., 1998. "Joint demand fulfillment probability in a multi-item inventory system with independent order-up-to policies," European Journal of Operational Research, Elsevier, vol. 109(3), pages 646-659, September.
    6. Yoshiaki Toyoda, 1975. "A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems," Management Science, INFORMS, vol. 21(12), pages 1417-1427, August.
    7. Richard Loulou & Eleftherios Michaelides, 1979. "New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem," Operations Research, INFORMS, vol. 27(6), pages 1101-1114, December.
    8. Kenneth R. Baker & Michael J. Magazine & Henry L. W. Nuttle, 1986. "The Effect of Commonality on Safety Stock in a Simple Inventory Model," Management Science, INFORMS, vol. 32(8), pages 982-988, August.
    9. Julia L. Higle & Suvrajeet Sen, 1991. "Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse," Mathematics of Operations Research, INFORMS, vol. 16(3), pages 650-669, August.
    10. Alex X. Zhang, 1997. "Demand Fulfillment Rates In An Assembleto‐ Order System With Multiple Products And Dependent Demands," Production and Operations Management, Production and Operations Management Society, vol. 6(3), pages 309-324, September.
    11. Hau L. Lee & Christopher S. Tang, 1997. "Modelling the Costs and Benefits of Delayed Product Differentiation," Management Science, INFORMS, vol. 43(1), pages 40-53, January.
    12. Shizuo Senju & Yoshiaki Toyoda, 1968. "An Approach to Linear Programming with 0-1 Variables," Management Science, INFORMS, vol. 15(4), pages 196-207, December.
    13. Yigal Gerchak & Michael J. Magazine & A. Bruce Gamble, 1988. "Component Commonality with Service Level Requirements," Management Science, INFORMS, vol. 34(6), pages 753-760, June.
    14. 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)

    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. 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.
    2. 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.
    3. Mustafa K. Doğru & Martin I. Reiman & Qiong Wang, 2010. "A Stochastic Programming Based Inventory Policy for Assemble-to-Order Systems with Application to the W Model," Operations Research, INFORMS, vol. 58(4-part-1), pages 849-864, August.
    4. Yingdong Lu & Jing-Sheng Song & David D. Yao, 2003. "Order Fill Rate, Leadtime Variability, and Advance Demand Information in an Assemble-to-Order System," Operations Research, INFORMS, vol. 51(2), pages 292-308, April.
    5. Hsieh, Ying-Jiun, 2011. "Demand switching criteria for multiple products: An inventory cost analysis," Omega, Elsevier, vol. 39(2), pages 130-137, April.
    6. Yalçın Akçay & Haijun Li & Susan Xu, 2007. "Greedy algorithm for the general multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 150(1), pages 17-29, March.
    7. Jing-Sheng Song, 2002. "Order-Based Backorders and Their Implications in Multi-Item Inventory Systems," Management Science, INFORMS, vol. 48(4), pages 499-516, April.
    8. Sabah Bushaj & İ. Esra Büyüktahtakın, 2024. "A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack," Journal of Global Optimization, Springer, vol. 89(3), pages 655-685, July.
    9. Elhafsi, Mohsen & Hamouda, Essia, 2015. "Managing an assemble-to-order system with after sales market for components," European Journal of Operational Research, Elsevier, vol. 242(3), pages 828-841.
    10. Susan H. Xu & Zhaolin Li, 2007. "Managing a Single-Product Assemble-to-Order System with Technology Innovations," Management Science, INFORMS, vol. 53(9), pages 1467-1485, September.
    11. 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.
    12. 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.
    13. 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.
    14. ElHafsi, Mohsen, 2009. "Optimal integrated production and inventory control of an assemble-to-order system with multiple non-unitary demand classes," European Journal of Operational Research, Elsevier, vol. 194(1), pages 127-142, April.
    15. 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.
    16. Yingdong Lu & Jing-Sheng Song & Yao Zhao, 2010. "No-Holdback Allocation Rules for Continuous-Time Assemble-to-Order Systems," Operations Research, INFORMS, vol. 58(3), pages 691-705, June.
    17. Erica L. Plambeck & Amy R. Ward, 2006. "Optimal Control of a High-Volume Assemble-to-Order System," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 453-477, August.
    18. Gregory A. DeCroix & Jing-Sheng Song & Paul H. Zipkin, 2009. "Managing an Assemble-to-Order System with Returns," Manufacturing & Service Operations Management, INFORMS, vol. 11(1), pages 144-159, October.
    19. Willem van Jaarsveld & Alan Scheller-Wolf, 2015. "Optimization of Industrial-Scale Assemble-to-Order Systems," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 544-560, August.
    20. 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.

    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:inm:ormnsc:v:50:y:2004:i:1:p:99-116. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.