Dynamic Product Assembly and Inventory Control for Maximum Profit
Authors:
- Michael J. NeelyMNMichael J. Neely
- Longbo HuangLHLongbo Huang
Preprint
Abstract
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 epsilon of optimality, for any given epsilon>0, with a worst case storage buffer requirement that is O(1/epsilon). The policy can be implemented easily for large M, K, yields fast convergence times, and is robust to non-ergodic system dynamics.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Universal scheduling for networks with arbitrary traffic, channels, and mobility2010
- Stock market trading via stochastic network optimization2010
- Stable and utility-maximizing scheduling for stochastic processing networks2009
- Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio NetworksIEEE Transactions on Mobile Computing, 2009
- Optimal Energy and Delay Tradeoffs for Multiuser Wireless DownlinksIEEE Transactions on Information Theory, 2007
- Production and Inventory Control of a Single Product Assemble-to-Order System with Multiple Customer ClassesManagement Science, 2006
- Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networksIEEE Journal on Selected Areas in Communications, 2006
- Energy optimal control for time-varying wireless networksIEEE Transactions on Information Theory, 2006
- Resource Allocation and Cross-Layer Control in Wireless Networks2005