Online lot-sizing problems with ordering, holding and shortage costs

We study inventory management problems where demands are revealed incrementally and procurement decisions must be made before the demands are realized. There are no probabilistic distributions nor non-trivial bounds to characterize demands. We consider two cost minimization problems: (1) perishable products with lost sales and (2) durable products with backlogged demand. In both problems, costs are period dependent. These problems are analyzed by utilizing linear-fractional programming and duality theory. Structural results are proved and then developed into practical strategies.

[1]  Hon-Shiang Lau.  The Newsboy Problem under Alternative Optimization Objectives , 1980 .

[2]  Woonghee Tim Huh,et al.  A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand , 2009, Math. Oper. Res..

[3]  Jan A. Van Mieghem,et al.  Risk Mitigation in Newsvendor Networks: Resource Diversification, Flexibility, Sharing, and Hedging , 2007, Manag. Sci..

[4]  James B. Orlin,et al.  Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator , 2011, Oper. Res..

[5]  S. Axsäter.  Note-Performance Bounds for Lot Sizing Heuristics , 1985 .

[6]  L. Eeckhoudt,et al.  The Risk-Averse and Prudent Newsboy , 1995 .

[7]  S. Axsäter.  Worst case performance for lot sizing heuristics , 1982 .

[8]  Michael R. Wagner.  Fully Distribution-Free Profit Maximization: The Inventory Management Case , 2010, Math. Oper. Res..

[9]  W. Zangwill.  A Deterministic Multi-Period Production Scheduling Model with Backlogging , 1966 .

[10]  Niv Buchbinder,et al.  Online make-to-order joint replenishment model: primal dual competitive algorithms , 2008, SODA '08.

[11]  Retsef Levi,et al.  Adaptive Data-Driven Inventory Control Policies Based on Kaplan-Meier Estimator for Censored Demand , 2010 .

[12]  Gabriel R. Bitran,et al.  Approximation Methods for the Uncapacitated Dynamic Lot Size Problem , 1984 .

[13]  Yingjie Lan,et al.  Revenue Management with Limited Demand Information , 2008, Manag. Sci..

[14]  Warrren B Powell,et al.  An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution , 2001 .

[15]  Maurice Queyranne,et al.  Toward Robust Revenue Management: Competitive Analysis of Online Booking , 2009, Oper. Res..

[16]  Shawn T. O'Neil,et al.  Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem , 2008, ALENEX.

[17]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[18]  David B. Shmoys,et al.  Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models , 2007, Math. Oper. Res..

[19]  Rita Vachani,et al.  Performance of heuristics for the uncapacitated lot-size problem , 1992 .

[20]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[21]  Yingjie Lan,et al.  Overbooking and Fare-Class Allocation with Limited Information , 2007 .

[22]  Woonghee Tim Huh,et al.  An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand , 2009, Math. Oper. Res..

[23]  Peng Sun,et al.  Risk Aversion in Inventory Management , 2007, Oper. Res..

[24]  Albert P. M. Wagelmans,et al.  Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics , 2007, Oper. Res..