Mathematics – Optimization and Control
Scientific paper
2010-04-04
Mathematics
Optimization and Control
32 pages
Scientific paper
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.
Huang Longbo
Neely Michael J.
No associations
LandOfFree
Dynamic Product Assembly and Inventory Control for Maximum Profit does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dynamic Product Assembly and Inventory Control for Maximum Profit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Product Assembly and Inventory Control for Maximum Profit will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-448752