Approximation Algorithms for Stochastic Inventory Control Models

References

• Axsäter S. Simple solution procedures for a class of two-echelon inventory problems. Oper. Res. (1990) 38:64–69Link, Google Scholar
• Axsäter S., Lundell P. In process safety stock. Proc. 23rd IEEE Conf. Decision Control, Lecture Notes in Computer Science (1984) (Springer, Heidelberg, Germany) 839–842Crossref, Google Scholar
• Bertsimas D., Thiele A. A robust optimization approach to supply chain management. Proc. 14th IPCO, Lecture Notes in Computer Science (2004) (Springer, Heidelberg, Germany) 86–100Crossref, Google Scholar
• Chan E. W. M. Markov chain models for multi-echelon supply chains. (1999) . Ph.D. thesis, Cornell University, Ithaca, NYGoogle Scholar
• Chan E. W. M., Muckstadt J. Markov chain models for multi-echelon supply chains. (1999) . Unpublished manuscriptGoogle Scholar
• Chen F., Song J. Optimal policies for multi-echelon inventory problems with Markov-modulated demand. Oper. Res. (2001) 49:226–234Link, Google Scholar
• Dean B. C., Goemans M. X., Vondrák J. Approximating the stochastic knapsack problem: The benefit of adaptivity. Proc. 45th Annual IEEE Sympos. Foundations Comput. Sci. (2004) (IEEE Computer Society, Washington, D.C.) 208–217Crossref, Google Scholar
• Dong L., Lee H. L. Optimal policies and approximations for a serial multiechelon inventory system with time-correlated demand. Oper. Res. (2003) 51:969–980Link, Google Scholar
• Dye S., Stougie L., Tomasgard A. The stochastic single resource service provision problem. Naval Res. Logist. (2003) 50:869–887Crossref, Google Scholar
• Erkip N., Hausman W. H., Nahmias S. Optimal centralized ordering policies in multi-echelon inventory systems with correlated demands. Management Sci. (1990) 36:381–392Link, Google Scholar
• Gallego G., Özer Ö. Integrating replenishment decisions with advanced demand information. Management Sci. (2001) 47:1344–1360Link, Google Scholar
• Halman N., Klabjan D., Mostagir M., Orling J. A fully polynomial time approximation scheme for single-item stochastic lot-sizing problems with discrete demands. (2006) . Working paper, MIT, Boston, MAGoogle Scholar
• Hurley G., Jackson P., Levi R., Roundy R. O., Shmoys D. B. New policies for stochastic inventory control models—theoretical and computational results. (2005) . SubmittedGoogle Scholar
• Ignall E., Veinott A. F. Optimality of myopic inventory policies for several substitute products. Management Sci. (1969) 15:284–304Link, Google Scholar
• Iida T., Zipkin P. H. Approximate solutions of a dynamic forecast-inventory model. Manufacturing Service Oper. Management (2006) 8:407–425Link, Google Scholar
• Joneja D. The joint replenishment problem: New heuristics and worst-case performance bounds. Oper. Res. (1990) 38:723–771Link, Google Scholar
• Lee H. L., So K. C., Tang C. S. The value of information sharing in two-level supply chains. Management Sci. (1999) 46:626–643Link, Google Scholar
• Levi R., Roundy R. O., Truong V. A. Provably near-optimal balancing policies for multi-echelon stochastic inventory control models. (2005) . SubmittedGoogle Scholar
• Levi R., Roundy R. O., Shmoys D. B., Truong V. A. Approximation algorithms for capacitated stochastic inventory control models. (2004) Google Scholar
• Lu X., Song J. S., Regan A. C. Inventory planning with forecast updates: Approximate solutions and cost error bounds. Oper. Res. (2003) . ForthcomingGoogle Scholar
• Möhring R. H., Radermacher F. J., Weiss G. Stochastic scheduling problems I: General strategies. ZOR-Zeitschrift Oper. Res. (1984) 28:193–260Crossref, Google Scholar
• Möhring R. H., Radermacher F. J., Weiss G. Stochastic scheduling problems II: Set strategies. ZOR-Zeitschrift Oper. Res. (1984) 29:65–104Google Scholar
• Möhring R. H., Schulz A., Uetz M. Approximation in stochastic scheduling: The power of LP-based priority policies. J. ACM (1999) 46:924–942Crossref, Google Scholar
• Muharremoglu A., Tsitsiklis J. N. A single-unit decomposition approach to multi-echelon inventory systems. (2001) . Working paper, Columbia University, New YorkGoogle Scholar
• Özer Ö., Gallego G. Integrating replenishment decisions with advance demand information. Management Sci. (2001) 47:1344–1360Link, Google Scholar
• Shmoys D. B., Swamy C. Stochastic optimization is (almost) as easy as deterministic optimization. Proc. 45th Annual IEEE Sympos. Foundations Comput. Sci. (2004) (IEEE Computer Society, Washington, D.C.) 228–237Crossref, Google Scholar
• Silver E. A., Meal H. C. A heuristic selecting lot-size requirements for the case of a deterministic time varying demand rate and discrete opportunities for replenishment. Production Inventory Management (1973) 14:64–74Google Scholar
• Song J., Zipkin P. Inventory control in a fluctuating demand environment. Oper. Res. (1993) 41:351–370Link, Google Scholar
• Stougie L., van der Vlerk M. H. Approximation in stochastic integer programming. (2003) . Technical report, SOM Research Report 03A14, Eindhoven University of Technology, Eindhoven, The NetherlandsGoogle Scholar
• Veinott A. F. Optimal policy for a multi-product, dynamic, non-stationary inventory problem. Management Sci. (1965) 12:206–222Link, Google Scholar
• Zipkin P. H.Foundations of Inventory Management (2000) (McGraw-Hill, New York) Google Scholar