EconPapers    
Economics at your fingertips  
 

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

Yalçin Akçay () and Susan H. Xu ()
Additional contact information
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

Management Science, 2004, vol. 50, issue 1, 99-116

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.

Keywords: assemble to order; stochastic programming; inventory management; order-based component allocation; multidimensional knapsack problems; sample average approximation; heuristics (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (37)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.1030.0167 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:50:y:2004:i:1:p:99-116

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:ormnsc:v:50:y:2004:i:1:p:99-116