Dynamic product assembly and inventory control for maximum profit

We consider a manufacturing plant that purchases raw materials for product assembly and then sells the final products to customers. There are M types of raw materials and K types of products, and each product uses a certain subset of raw materials for assembly. The plant operates in slotted time, and every slot it makes decisions about re-stocking materials and pricing the existing products in reaction to (possibly time-varying) material costs and consumer demands. We develop a dynamic purchasing and pricing policy that yields time average profit within ∈ of optimality, for any given ∈ > 0, with a worst case storage buffer requirement that is O(1/∈). The policy can be implemented easily for large M, K, yields fast convergence times, and is robust to non-ergodic system dynamics.

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

[2]  Michael J. Neely.  Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks , 2006, IEEE J. Sel. Areas Commun..

[3]  Michael J. Neely,et al.  Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[4]  Michael J. Neely,et al.  Energy optimal control for time-varying wireless networks , 2005, IEEE Transactions on Information Theory.

[5]  Michael J. Neely,et al.  Universal scheduling for networks with arbitrary traffic, channels, and mobility , 2010, 49th IEEE Conference on Decision and Control (CDC).

[6]  Michael J. Neely,et al.  Optimal Energy and Delay Tradeoffs for Multiuser Wireless Downlinks , 2007, IEEE Transactions on Information Theory.

[7]  Longbo Huang,et al.  The Optimality of Two Prices: Maximizing Revenue in a Stochastic Communication System , 2010, IEEE/ACM Transactions on Networking.

[8]  Eytan Modiano,et al.  Fairness and Optimal Stochastic Control for Heterogeneous Networks , 2005, IEEE/ACM Transactions on Networking.

[9]  Benjamin Van Roy,et al.  A neuro-dynamic programming approach to retailer inventory management , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[10]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[11]  Warren B. Powell,et al.  Approximate Dynamic Programming - Solving the Curses of Dimensionality , 2007 .

[12]  Jean Walrand,et al.  Stable and utility-maximizing scheduling for stochastic processing networks , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[13]  Michael J. Neely,et al.  Stock market trading via stochastic network optimization , 2009, 49th IEEE Conference on Decision and Control (CDC).

[14]  Yossi Aviv,et al.  Pricing of Short Life-Cycle Products through Active Learning∗ , 2002 .

[15]  M. Neely,et al.  The Optimality of Two Prices : Maximizing Revenue in a Stochastic Network , 2007 .

[16]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[17]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

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

[19]  M.J. Neely,et al.  Opportunism, backpressure, and stochastic optimization with the wireless broadcast advantage , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[20]  Panos M. Pardalos,et al.  Approximate dynamic programming: solving the curses of dimensionality , 2009, Optim. Methods Softw..

[21]  Michael J. Neely,et al.  Optimal Energy and Delay Tradeoffs for Multi-User Wireless Downlinks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[22]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .