Optimal control of a high-volume assemble-to-order system

Mathematics of Operations Research

Volumn 31, Issue 3, 2006, Pages 453-477

  Plambeck, Erica L ^a   Ward, Amy R ^b  

^a STANFORD UNIVERSITY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Assemble to order systems; Brownian motion; Control policy; Diffusion limits; Discrete review policy; Functional limit theorems; State space collapse

Indexed keywords

ASSEMBLE TO ORDER SYSTEMS; CONTROL POLICY; DISCRETE REVIEW POLICY; FUNCTIONAL LIMIT THEOREMS; STATE SPACE COLLAPSE;

APPROXIMATION THEORY; COSTS; OPERATIONS RESEARCH; PRODUCT DEVELOPMENT; PRODUCTION ENGINEERING; THEOREM PROVING;

OPTIMAL CONTROL SYSTEMS;

EID: 33748438981     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1060.0196     Document Type: Article

References (41)

1. Akçay, Y., S. Xu. 2004. Joint inventory replenishment and component allocation optimization in an assemble-to-order system. Management Sci. 48 99-116.
2. Agrawal, N., M. A. Cohen. 2001. Optimal material control in an assembly system with component commonality. Naval Res. Logist. 48 409-429.
3. Agrawal, M., T. V. Kumaresh, G. A. Mercer. 2001. The false promise of mass customization. McKinsey Quart. 3 62-71.
4. Ata, B., S. Kumar. 2005. Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies. Ann. Appl. Probab. 15 331-391.
5. Bassamboo, A., J. M. Harrison, A. Zeevi. 2004. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. 54 419-435.
6. Bell, S. L., R. J. Williams. 2001. Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: Asymptotic optimality of a continuous review threshold policy. Ann. Appl. Probab. 11 608-649.
7. p-approximations. J. Math. Anal. Appl. 213 183-201.
8. Bernstein, F., A. Federgruen. 2004. Comparative statics, strategic complements and substitutes in oligopolies. J. Math. Econom. 40 713-746.
9. Billingsley, P. 1999. Convergence of Probability Measures, 2nd edition. John Wiley and Sons, Inc., New York.
10. Bylinsky, G. 2000. Heroes of U.S. manufacturing. Fortune 141(March 20) 192-205.
11. Chen, H., D. D. Yao. 2001. Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization. Springer-Verlag, New York.
12. Cheng, F., M. Ettl, G. Lin, D. D. Yao. 2002. Inventory-service optimization in configure-to-order systems. Manufacturing Service Oper. Management 4 114-132.
13. Duenyas, I. 1995. Single facility due date setting with multiple customer classes. Management Sci. 41 608-619.
14. Economist. 2001. A long march: Mass customization. 360(July 14) 63.
15. Economist. 2004. Ripe for revolution. 372(September 4) 12.
16. Ethier, S. N., T. G. Kurtz. 1986. Markov Processes: Characterization and Convergence. John Wiley & Sons, Inc., New York.
17. Forbes. 2004. Just in time manufacturing. 174(July 5) 22.
18. Gallego, G., G. van Ryzin. 1994. Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40 999-1020.
19. Glasserman, P., Y. Wang. 1998. Leadtime-inventory tradeoffs in assemble-to-order systems. Oper. Res. 46 858-871.
20. Gut, A. 1988. Stopped Random Walks: Limit Theorems and Applications. Applied Probability, Vol. 5. Springer-Verlag, New York.
21. Harrison, J. M. 1996. The BIGSTEP approach to flow management in stochastic processing networks. F. P. Kelly, S. Zachary, I. Ziedins, eds. RSS Lecture. Note Series. Stochastic Networks: Theory and Applications. Oxford University Press, Oxford, UK, 57-90.
22. Lorden, G. 1970. On excess over the boundary. Ann. Math. Statist. 41 520-527.
23. Lu, Y., J. S. Song, D. D. Yao. 2003. Order fill rate, leadtime variability, and advance demand information in an assemble-to-order system. Oper. Res. 51 292-308.
24. Maglaras, C. 1999. Dynamic scheduling in multiclass queueing networks: Stability under discrete review policies. Queueing Systems 31 171-206.
25. Maglaras, C. 2000. Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality. Ann. Appl. Probab. 10 897-929.
26. Maglaras, C. 2003. Revenue management for a multi-class single-server queue. Working paper, Columbia Business School, New York.
27. Maglaras, C., J. A. Van Mieghem. 2005. Queueing systems with leadtime constraints: A fluid-model approach for admission and sequencing control. Eur. J. Oper. Res. 1 179-207.
28. Maglaras, C., A. Zeevi. 2003. Pricing and capacity sizing for systems with shared resources: Approximate solutions and scaling relations. Management Sci. 49 1018-1038.
29. Perman, S. 2001. Automate or die. Business 2.0. (July) 60-67.
30. Plambeck, E. 2004. Optimal leadtime differentiation via diffusion approximations. Oper. Res. 52 213-228.
31. Plambeck, E., A. R. Ward. 2005. Optimal control of a high-volume assemble-to-order system with guaranteed maximum delays and expediting. Working paper, Stanford Graduate School of Business, Stanford, CA.
32. Plambeck, E., S. Kumar, J. M. Harrison. 2001. Asymptotic optimality of a single server queueing system with constraints on throughput times. Queueing Systems 39 23-54.
33. Reiman, M. I. 1982. The heavy traffic diffusion approximation for sojourn times in Jackson networks. R. L. Disney, T. J. Ott, eds. Applied Probability-Computer Science, The Interface. Birkhäuser, Boston, MA, 126-128.
34. Schrijver, A. 1986. Theory of Linear and Integer Programming. Wiley, Chichester, New York, 411-421.
35. Song, J. S. 1998. On the order fill rate in a multi-item base-stock inventory system. Oper. Res. 46 831-845.
36. Song, J. S., P. Zipkin. 2003. Supply chain operations: Assemble-to-order and configure-to-order systems. S. Groves, T. DeKok, eds. Handbooks in Operations Research and Management Science, Chapter XI, Supply Chain Management, Vol. XXX, 561-593.
37. Song, J. S., S. Xu, B. Liu. 1999. Order fulfillment performance measures in an assemble-to-order system with stochastic leadtimes. Oper. Res. 47 131-149.
38. Wang, Y. 2000. Near-optimal base-stock policies in assemble-to-order systems under service level requirements. Working paper, Massachusetts Institute of Technology, Cambridge, MA.
39. Wein, L. 1991. Due-date setting and priority sequencing in a multiclass M/G/1 queue. Management Sci. 37 834-850.
40. Xu, X., W. J. Hopp. 2004. Dynamic pricing and inventory control with demand substitution: The value of pricing flexibility. Working paper, Northwestern University, Evanston, IL.
41. Zhang, A. X. 1997. Demand fulfillment rates in an assemble-to-order system with multiple products and dependent demands. Production Oper. Management 6 309-324.