View Item 

Show simple item record

Optimal Learning Algorithms for Stochastic Inventory Systems with Random Capacities
dc.contributor.authorChen, Weidong
dc.contributor.authorShi, Cong
dc.contributor.authorDuenyas, Izak
dc.date.accessioned2020-08-10T20:55:46Z
dc.date.availableWITHHELD_12_MONTHS
dc.date.available2020-08-10T20:55:46Z
dc.date.issued2020-07
dc.identifier.citationChen, Weidong; Shi, Cong; Duenyas, Izak (2020). "Optimal Learning Algorithms for Stochastic Inventory Systems with Random Capacities." Production and Operations Management 29(7): 1624-1649.
dc.identifier.issn1059-1478
dc.identifier.issn1937-5956
dc.identifier.urihttps://hdl.handle.net/2027.42/156225
dc.publisherWorking paper, London Business School
dc.publisherWiley Periodicals, Inc.
dc.subject.otherregret analysis
dc.subject.otheronline learning algorithms
dc.subject.otherrandom capacity
dc.subject.otherinventory
dc.titleOptimal Learning Algorithms for Stochastic Inventory Systems with Random Capacities
dc.typeArticle
dc.rights.robotsIndexNoFollow
dc.subject.hlbsecondlevelIndustrial and Operations Engineering
dc.subject.hlbtoplevelEngineering
dc.description.peerreviewedPeer Reviewed
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/156225/2/poms13178_am.pdfen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/156225/1/poms13178.pdfen_US
dc.identifier.doi10.1111/poms.13178
dc.identifier.sourceProduction and Operations Management
dc.identifier.citedreferenceRoundy, R. O., J. A. Muckstadt. 2000. Heuristic computation of periodic‐review base stock inventory policies. Management Sci. 46 ( 1 ): 104 – 109.
dc.identifier.citedreferenceBan, G. Y. 2020. Confidence intervals for data‐driven inventory policies with demand censoring. Working paper, London Business School, London, UK.
dc.identifier.citedreferenceLevi, R., Perakis, G., J. Uichanco. 2015. The data‐driven newsvendor problem: New bounds and insights. Oper. Res. 63 ( 6 ): 1294 – 1306.
dc.identifier.citedreferenceLiyanage, L. H., J. G. Shanthikumar. 2005. A practical inventory control policy using operational statistics. Oper. Res. Lett. 33 ( 4 ): 341 – 348.
dc.identifier.citedreferenceLoulou, R. 1978. An explicit upper bound for the mean busy period in a GI/G/1 queue. J. Appl. Probab. 15 ( 2 ): 452 – 455.
dc.identifier.citedreferenceNemirovski, A., Juditsky, A., Lan, G., A. Shapiro. 2009. Robust stochastic approximation approach to stochastic programming. SIAM J. Optimiz. 19 ( 4 ): 1574 – 1609.
dc.identifier.citedreferenceÖzer O. W. Wei. 2004. Inventory control with limited capacity and advance demand information. Oper. Res. 52 ( 6 ): 988 – 1000.
dc.identifier.citedreferencePowell, W., A., Ruszczyński, H., Topaloglu. 2004. Learning algorithms for separable approximations of discrete stochastic optimization problems. Math. Oper. Res. 29 ( 4 ): 814 – 836.
dc.identifier.citedreferenceRandall, T., D. Halford. 2018. Tesla model 3 tracker. Available at  https://www.bloomberg.com/graphics/2018-tesla-tracker/ (accessed date October 29, 2018).
dc.identifier.citedreferenceBesbes, O., A. Muharremoglu. 2013. On implications of demand censoring in the newsvendor problem. Management Sci. 59 ( 6 ): 1407 – 1424.
dc.identifier.citedreferenceSchäl, M. 1993. Average optimality in dynamic programming with general state space. Math. Oper. Res. 18 ( 1 ): 163 – 172.
dc.identifier.citedreferenceShalev‐Shwartz, S. 2012. Online learning and online convex optimization. Found. Trends Mach. Learn. 4 ( 2 ): 107 – 194.
dc.identifier.citedreferenceShi, C., Chen, W., I. Duenyas. 2016. Nonparametric data‐driven algorithms for multiproduct inventory systems with censored demand. Oper. Res. 64 ( 2 ): 362 – 370.
dc.identifier.citedreferenceSimchi‐Levi, D., Chen, X., J. Bramel. 2014. The Logic of Logistics: Theory, Algorithms, and Applications for Logistics and Supply Chain Management, Springer, New York, NY.
dc.identifier.citedreferenceSnyder, L. V., Z. J. M. Shen. 2011. Fundamentals of Supply Chain Theory, John Wiley & Sons, Hoboken, NJ.
dc.identifier.citedreferenceSohail, O. 2018. Production Problems Might Delay lcd iPhone 9 Model to Launch in November ‐ Notch Said to be the Culprit. Available at https://wccftech.com/iphone-9-lcd-model-delayed-till-november/ (accessed October 29, 2018).
dc.identifier.citedreferenceSparks, D. 2018. Tesla model 3 production rate: 3000 units per week. Available at #https://finance.yahoo.com/news/#tblesla-model-3-production-rate-184600194.html (accessed October 29, 2018).
dc.identifier.citedreferenceTayur, S. 1992. Computing the optimal policy for capacitated inventory models. Stoch. Models 9: 585 – 598.
dc.identifier.citedreferenceWang, Y., Y. Gerchak. 1996. Periodic review production models with variable capacity, random yield, and uncertain demand. Management Sci. 42 ( 1 ): 130 – 137.
dc.identifier.citedreferenceYuan, H., Luo, Q., C. Shi. 2019. Marrying stochastic gradient descent with bandits: Learning algorithms for inventory systems with fixed costs. Working paper, University of Michigan, Ann Arbor, MI.
dc.identifier.citedreferenceZhang, H., Chao, X., C. Shi. 2018. Perishable inventory systems: Convexity results for base‐stock policies and learning algorithms under censored demand. Oper. Res. 66 ( 5 ): 1276 – 1286.
dc.identifier.citedreferenceZhang, H., Chao, X., C. Shi. 2020. Closing the gap: A learning algorithm for the lost‐sales inventory system with lead times. Working paper, University of Michigan, Ann Arbor, MI.
dc.identifier.citedreferenceZipkin, P. 2000. Foundations of Inventory Management, McGraw‐Hill, New York, NY.
dc.identifier.citedreferenceAgrawal, S., R. Jia. 2019. Learning in Structured MDPS with Convex Cost Functions: Improved Regret Bounds for Inventory Management. Proceedings of the 2019 ACM Conference on Economics and Computation, EC ’19,: ACM, New York, NY, USA, pp. 743–744.
dc.identifier.citedreferenceAngelus, A., E. L. Porteus. 2002. Simultaneous capacity and production management of short‐life‐cycle, produce‐to‐stock goods under stochastic demand. Management Sci. 48 ( 3 ): 399 – 413.
dc.identifier.citedreferenceAngelus, A., W. Zhu. 2017. Looking upstream: Optimal policies for a class of capacitated multi‐stage inventory systems. Prod. Oper. Manag. 26 ( 11 ): 2071 – 2088.
dc.identifier.citedreferenceAviv, Y., A. Federgruen. 1997. Stochastic inventory models with limited production capacity and periodically varying parameters. Probab. Engrg. Inform. Sci. 11: 107 – 135.
dc.identifier.citedreferenceBrownlee, J. 2014. Manufacturing Problems could Make the iPhone 6 Hard to Find at Launch. Available at # https://www.cultofmac.#com/285046/manufacturing-problems-make-iphone-6-hard-find-launch/ (accessed date October 29, 2018).
dc.identifier.citedreferenceBurnetas, A. N., C. E. Smith. 2000. Adaptive ordering and pricing for perishable products. Oper. Res. 48 ( 3 ): 436 – 443.
dc.identifier.citedreferenceChen, L., E. L. Plambeck. 2008. Dynamic inventory management with learning about the demand distribution and substitution probability. Manuf. Serv. Oper. Manag. 10 ( 2 ): 236 – 256.
dc.identifier.citedreferenceChen, B., C. Shi. 2020. Tailored base‐surge policies in dual‐sourcing inventory systems with demand learning. Working paper, University of Michigan, Ann Arbor, MI.
dc.identifier.citedreferenceChen, X., Gao, X., Z. Pang. 2018. Preservation of structural properties in optimization with decisions truncated by random variables and its applications. Oper. Res. 66 ( 2 ): 340 – 357.
dc.identifier.citedreferenceChen, B., Chao, X., H. S. Ahn ( 2019a ). Coordinating pricing and inventory replenishment with nonparametric demand learning. Oper. Res. 67 ( 4 ): 1035 – 1052.
dc.identifier.citedreferenceChen, B., Chao, X., C. Shi. ( 2019b ). Nonparametric algorithms for joint pricing and inventory control with lost‐sales and censored demand. Working paper, University of Michigan, Ann Arbor, MI.
dc.identifier.citedreferenceChu, L. Y., Shanthikumar, J. G, Z. J. M. Shen. 2008. Solving operational statistics via a bayesian analysis. Oper. Res. Lett. 36 ( 1 ): 110 – 116.
dc.identifier.citedreferenceCiarallo, F. W., Akella, R., T. E. Morton. 1994. A periodic review, production planning model with uncertain capacity and uncertain demand — optimality of extended myopic policies. Management Sci. 40 ( 3 ): 320 – 332.
dc.identifier.citedreferenceDuenyas I., Hopp, W. J., Y. Bassok. 1997. Production quotas as bounds on interplant JIT contracts. Management Sci. 43 ( 10 ): 1372 – 1386.
dc.identifier.citedreferenceEberly, J. C., J. A Van Mieghem. 1997. Multi‐factor dynamic investment under uncertainty. J. Econ. Theory 75 ( 2 ): 345 – 387.
dc.identifier.citedreferenceFedergruen, A., N. Yang. 2011. Procurement strategies with unreliable suppliers. Oper. Res. 59 ( 4 ): 1033 – 1039.
dc.identifier.citedreferenceFedergruen, A., P. Zipkin ( 1986a ). An inventory model with limited production capacity and uncertain demands I: The average‐cost criterion. Math. Oper. Res. 11 ( 2 ): 193 – 207.
dc.identifier.citedreferenceFedergruen, A., P. Zipkin ( 1986b ). An inventory model with limited production capacity and uncertain demands II: The discounted cost criterion. Math. Oper. Res. 11 ( 2 ): 208 – 215.
dc.identifier.citedreferenceFeng, Q. 2010. Integrating dynamic pricing and replenishment decisions under supply capacity uncertainty. Management Sci. 56 ( 12 ): 2154 – 2172.
dc.identifier.citedreferenceFeng, Q., J. G. Shanthikumar. 2018. Supply and demand functions in inventory models. Oper. Res. 66 ( 1 ): 77 – 91.
dc.identifier.citedreferenceGijsbrechts, J., Boute, R. N., Van Mieghem, J. A., D. J. Zhang. 2019. Can deep reinforcement learning improve inventory management? performance on dual sourcing, lost sales and multi‐echelon problems. Working paper, Northwestern University, Evanston, IL.
dc.identifier.citedreferenceGodfrey, G. A., W. B. Powell. 2001. An adaptive, distribution‐free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. 47 ( 8 ): 1101 – 1112.
dc.identifier.citedreferenceGüllü, R. 1998. Base stock policies for production/inventory problems with uncertain capacity levels. Eur. J. Oper. Res. 105 ( 1 ): 43 – 51.
dc.identifier.citedreferenceHazan, E. 2016. Introduction to online convex optimization. Found. Trends R Optimiz. 2 ( 3‐4 ): 157 – 325.
dc.identifier.citedreferenceHenig, M., Y. Gerchak. 1990. The structure of periodic review policies in the presence of random yield. Oper. Res. 38 ( 4 ): 634 – 643.
dc.identifier.citedreferenceHuh, W. T., M. Nagarajan. 2010. Linear inflation rules for the random yield problem: Analysis and computations. Oper. Res. 58 ( 1 ): 244 – 251.
dc.identifier.citedreferenceHuh, W. H., P. Rusmevichientong. 2009. A non‐parametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34 ( 1 ): 103 – 123.
dc.identifier.citedreferenceHuh, W.T., Janakiraman, G., Muckstadt, J.A., P. Rusmevichientong. 2009. An adaptive algorithm for finding the optimal base‐stock policy in lost sales inventory systems with censored demand. Math. Oper. Res. 34 ( 2 ): 397 – 416.
dc.identifier.citedreferenceHuh, W. H., Rusmevichientong, P., Levi R., J. Orlin. 2011. Adaptive data‐driven inventory control with censored demand based on Kaplan–Meier estimator. Oper. Res. 59 ( 4 ): 929 – 941.
dc.identifier.citedreferenceKapuscinski, R., S. Tayur. 1998. A capacitated production‐inventory model with periodic demand. Oper. Res. 46 ( 6 ): 899 – 911.
dc.identifier.citedreferenceKleywegt, A. J., Shapiro, A., T. Homem‐de Mello. 2002. The sample average approximation method for stochastic discrete optimization. SIAM J. Optimiz. 12 ( 2 ): 479 – 502.
dc.identifier.citedreferenceLariviere, M. A., E. L. Porteus. 1999. Stalking information: Bayesian inventory management with unobserved lost sales. Management Sci. 45 ( 3 ): 346 – 363.
dc.identifier.citedreferenceLevi R., Roundy R. O., D. B. Shmoys. 2007. Provably near‐optimal sampling‐based policies for stochastic inventory control models. Math. Oper. Res. 32 ( 4 ): 821 – 839.
dc.identifier.citedreferenceLevi, R., Roundy, R. O., Shmoys, D. B., V. A. Truong. 2008. Approximation algorithms for capacitated stochastic inventory models. Oper. Res. 56: 1184 – 1199.
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
poms13178.pdf
Size:
731.7KB
Format:
PDF
View/Open
Name:
poms13178_am.pdf
Size:
884.7KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.