On the Optimal Policy Structure in Serial Inventory Systems with Lost Sales

Published Online:https://doi.org/10.1287/opre.1090.0716

References

  • Clark A., Scarf H. Optimal policies for a multiechelon inventory problem. Management Sci. (1960) 6:475–490LinkGoogle Scholar
  • Fujishige S.Submodular Functions and Optimization (2005) 582nd ed.(Elsevier Science, Amsterdam) Google Scholar
  • Janakiraman G., Muckstadt J. A decomposition approach for a class of capacitated serial systems. Oper. Res. (2009) 57(6):1384–1393LinkGoogle Scholar
  • Karlin S., Scarf H., Arrow J., Karlin S., Scarf H. Inventory models of the Arrow-Harris-Marschak type with time lag. Studies in the Mathematical Theory of Inventory and Production (1959) (Stanford University Press, Palo Alto, CA) 155–178Chapter 9Google Scholar
  • Lu Y., Song J. S. Order-based cost optimization in assemble-to-order systems. Oper. Res. (2005) 53(1):151–169LinkGoogle Scholar
  • Morton T. E. Bounds on the solution of the lagged optimal inventory equation with no demand backlogging and proportional costs. SIAM Rev. (1969) 11(4):572–596CrossrefGoogle Scholar
  • Murota K.Discrete Convex Analysis, SIAM Monographs on Discrete Mathematics and Applications (2003) 10(Society for Industrial and Applied Mathematics, Philadelphia) CrossrefGoogle Scholar
  • Murota K., Shioura A. Fundamental properties of M-convex and L-convex functions in continuous variables. IEICE Trans. Fundamentals of Electronics, Comm. Comput. Sci. (2004) 87(5):1042–1052Google Scholar
  • Parker R., Kapuscinski R. Optimal policies for a capacitated two-echelon inventory system. Oper. Res. (2004) 52(5):739–755LinkGoogle Scholar
  • Topkis D. M.Supermodularity and Complementarity (1998) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Zipkin P. On the structure of lost-sales inventory models. Oper. Res. (2008) 56(4):937–944LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.