Asymptotically Optimal Control for an Assemble-to-Order System with Capacitated Component Production and Fixed Transport Costs

This paper examines a two-tier assemble-to-order system. Customer orders for various products must be filled within the product-specific target lead time, or become lost sales. A product can be assembled instantaneously if its required components are in stock at the assembly facility. The production facility for each component is geographically distant from the assembly facility, and the transportation lead time is deterministic. Each shipment of components incurs a fixed cost and a variable cost per unit. The system manager must initially commit to the production capacity for each component. Then, in response to customer orders, he must dynamically manage production (expediting and salvaging) and shipping for each component, and the sequence of customer orders for assembly (how scarce components are allocated to outstanding orders). The objective is to minimize expected discounted costs for lost sales, production, and shipping. This discounted formulation accounts for financial inventory holding costs but not physical inventory holding costs. The main result is that as the order arrival rate for each product becomes large and the discount rate becomes small, a simple threshold policy with independent control of each component is asymptotically optimal. The policy is parameterized by five numbers for each component. Expressions for these parameters, the expected discounted cost, and the long-run average rates of salvaging and expediting are obtained by solving an approximating Brownian control problem. In a numerical example from the computer industry, the Brownian approximation is remarkably accurate.

[1]  Roger M. Hill,et al.  On the suboptimality of (S−1, S) lost sales inventory policies , 1999 .

[2]  Kaj Rosling,et al.  Optimal Inventory Policies for Assembly Systems Under Random Demands , 1989, Oper. Res..

[3]  Constantinos Maglaras,et al.  On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design , 2004, Oper. Res..

[4]  R. Trippi,et al.  A PRESENT VALUE FORMULATION OF THE CLASSICAL EOQ PROBLEM , 1974 .

[5]  H. Kushner Control and optimal control of assemble to order manufacturing systems under heavy traffic , 1999 .

[6]  Erica L. Plambeck,et al.  Sell the Plant? The Impact of Contract Manufacturing on Innovation, Capacity, and Profitability , 2005, Manag. Sci..

[7]  Jing-Sheng Song On the Order Fill Rate in a Multi-Item, Base-Stock Inventory System , 1998, Oper. Res..

[8]  Robin Roundy,et al.  Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies , 2002, Oper. Res..

[9]  Chandrasekhar Das The (S - 1, S) Inventory Model under Time Limit on Backorders , 1977, Oper. Res..

[10]  Yashan Wang,et al.  Leadtime, Inventory, and Service Level in Assemble-to-Order Systems , 2002 .

[11]  J. Michael Harrison,et al.  Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .

[12]  Amy R. Ward,et al.  Optimal Control of High-Volume Assemble-to-Order Systems , 2005 .

[13]  Alan Scheller-Wolf,et al.  Capacitated inventory problems with fixed order costs: Some optimal policy structure , 2000, Eur. J. Oper. Res..

[14]  Erica L. Plambeck,et al.  Note: A Separation Principle for a Class of Assemble-to-Order Systems with Expediting , 2007, Oper. Res..

[15]  Søren Glud Johansen,et al.  Optimal and approximate (Q, r) inventory policies with lost sales and gamma-distributed lead time , 1993 .

[16]  Fangruo Chen,et al.  Lower Bounds for Multi-Echelon Stochastic Inventory Systems , 1994 .

[17]  Jing-Sheng Song A Note on Assemble-to-Order Systems with Batch Ordering , 2000 .

[18]  Alexander L. Stolyar,et al.  Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule , 2004, Oper. Res..

[19]  David D. Yao,et al.  Order Fill Rate, Leadtime Variability, and Advance Demand Information in an Assemble-to-Order System , 2003, Oper. Res..

[20]  S. Johansen,et al.  Optimal (r, Q) inventory policies with Poisson demands and lost sales: discounted and undiscounted cases , 1996 .

[21]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..

[22]  Robert Moore,et al.  Inventory Decisions in Dell's Supply Chain , 2004, Interfaces.

[23]  Lawrence M. Wein,et al.  Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points , 1996, Oper. Res..

[24]  Awi Federgruen,et al.  An Inventory Model with Limited Production Capacity and Uncertain Demands II. The Discounted-Cost Criterion , 1986, Math. Oper. Res..

[25]  Constantinos Maglaras,et al.  Pricing and Capacity Sizing for Systems with Shared Resources: Approximate Solutions and Scaling Relations , 2003, Manag. Sci..

[26]  Erica L. Plambeck,et al.  A Multiclass Queue in Heavy Traffic with Throughput Time Constraints: Asymptotically Optimal Dynamic Controls , 2001, Queueing Syst. Theory Appl..

[27]  Sunil Kumar Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality , 2000 .

[28]  S. Johansen,et al.  Pure and modified base-stock policies for the lost sales inventory system with negligible set-up costs and constant lead times , 2001 .

[29]  Paul Glasserman,et al.  Leadtime-Inventory Trade-Offs in Assemble-to-Order Systems , 1998, Oper. Res..

[30]  Marc Lambrecht,et al.  X-Y Band and Modified (s, S) Policy , 1996, Oper. Res..

[31]  Bin Liu,et al.  Order-Fulfillment Performance Measures in an Assemble-to-Order System with Stochastic Leadtimes , 1999, Oper. Res..

[32]  J. Michael Harrison,et al.  Instantaneous Control of Brownian Motion , 1983, Math. Oper. Res..

[33]  Feng Cheng,et al.  Inventory-Service Optimization in Configure-to-Order Systems , 2002, Manuf. Serv. Oper. Manag..

[34]  Kok de Ag,et al.  Two replenishment strategies for the lost sales inventory model : a comparison , 1994 .

[35]  Erica L. Plambeck,et al.  A Separation Principle for Assemble-to-Order Systems with Expediting , 2003 .

[36]  S. Sushanth Kumar,et al.  Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies , 2005, math/0503477.

[37]  Awi Federgruen,et al.  An Inventory Model with Limited Production Capacity and Uncertain Demands I. The Average-Cost Criterion , 1986, Math. Oper. Res..

[38]  Saif Benjaafar,et al.  Production and Inventory Control of a Single Product Assemble-to-Order Systems with Multiple Customer Classes , 2006, Manag. Sci..

[39]  Jing-Sheng Song,et al.  Supply Chain Operations: Assemble-to-Order Systems , 2003, Supply Chain Management.

[40]  Constantinos Maglaras,et al.  Decision , Risk and Operations Working Papers Series Contact Centers with a CallBack Option and Real-Time Delay Information , 2004 .

[41]  Yao Zhao,et al.  Performance Analysis and Evaluation of Assemble-to-Order Systems with Stochastic Sequential Lead Times , 2006, Oper. Res..

[42]  Lawrence M. Wein,et al.  Dynamic Scheduling of a Two-Class Queue with Setups , 2011, Oper. Res..

[43]  David D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, , 2004 .

[44]  Steven Nahmias,et al.  Simple Approximations for a Variety of Dynamic Leadtime Lost-Sales Inventory Models , 1979, Oper. Res..

[45]  Erica L. Plambeck,et al.  Optimal Control of a High-Volume Assemble-to-Order System , 2006, Math. Oper. Res..

[46]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[47]  Ronald J. Williams,et al.  Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .