Inventory Control with Multiple Setup Costs

Published Online:https://doi.org/10.1287/msom.2013.0450

References

  • Alp O, Erkip NK, Gullu R (2003) Optimal lot-sizing/vehicle-dispatching policies under stochastic lead times and stepwise fixed costs. Oper. Res. 51(1):160–166.LinkGoogle Scholar
  • Cachon G (2001) Managing a retailer's shelf space, inventory and transportation. Manufacturing Service Oper. Management 3(3):211–229.LinkGoogle Scholar
  • Caliskan-Demirag O, Chen Y, Yang Y (2012) Ordering policies for periodic-review inventory systems with quantity-dependent fixed costs. Oper. Res. 60(4):785–796.LinkGoogle Scholar
  • Chao X, Zhou SX (2009) Optimal policy for a multiechelon inventory system with batch ordering and fixed replenishment intervals. Oper. Res. 57(2):377–390.LinkGoogle Scholar
  • Chen F (2000) Optimal policies for multi-echelon inventory problems with batch ordering. Oper. Res. 48(3):376–389.LinkGoogle Scholar
  • Federgruen A, Zipkin P (1986a) An inventory model with limited production capacity and uncertain demands I. The discounted-cost criterion. Math. Oper. Res. 11(2):193–207.LinkGoogle Scholar
  • Federgruen A, Zipkin P (1986b) An inventory model with limited production capacity and uncertain demands II. The average-cost criterion. Math. Oper. Res. 11(2):208–215.LinkGoogle Scholar
  • Gallego G, Scheller-Wolf A (2000) Capacitated inventory problems with fixed order costs: Some optimal policy structure. Eur. J. Oper. Res. 11(2):208–215.Google Scholar
  • Gallego G, Toktay LB (2004) All-or-nothing ordering under a capacity constraint. Oper. Res. 52(6):1001–1002.LinkGoogle Scholar
  • Hammond JH, Kelly M (1990) Merloni Elettrodomestici SpA: The transit point experiment. Case study, Harvard Business School, Boston, MA.Google Scholar
  • Heyman DP, Sobel MJ (1984) Stochastic Models in Operations Research, Vol. II (Dover Publications, Mineola, NY).Google Scholar
  • Huh WT, Janakiraman G (2012) On optimal policies for inventory systems with batch ordering. Oper. Res. 60(4):797–802.LinkGoogle Scholar
  • Iwaniec K (1979) An inventory model with full load ordering. Management Sci. 25(4):374–384.LinkGoogle Scholar
  • Lippman S (1969a) Optimal inventory policy with multiple set-up costs. Management Sci. 16(1):118–138.LinkGoogle Scholar
  • Lippman S (1969b) Optimal inventory policy with subadditive ordering costs and stochastic demands. SIAM J. Appl. Math. 17(3):543–559.CrossrefGoogle Scholar
  • Lippman ML (1971) Economic order quantities and multiple set-up costs. Management Sci. 18(1):39–47.LinkGoogle Scholar
  • Puterman ML (1994) Markov Decision Process: Discrete Stochastic Dynamic Programming (John Wiley & Sons, Hoboken, NJ).CrossrefGoogle Scholar
  • Scarf H (1960) The optimality of (S, s) policies in the dynamic inventory problem. Arrow KJ, Karlin S, Suppes P, eds. Mathematical Methods in Social Sciences, Chap. 13 (Stanford University Press, Stanford, CA).Google Scholar
  • Shaoxiang C (2004) The infinite horizon periodic review problem with setup costs and capacity constraints: A partial characterization of the optimal policy. Oper. Res. 52(3):409–421.LinkGoogle Scholar
  • Shaoxiang C, Lambrecht M (1996) X-Y band and modified (s, S) policy. Oper. Res. 44(6):1013–1019.LinkGoogle Scholar
  • Tanrikulu MM, Sen A, Alp O (2010) A joint replenishment policy with individual control and constant size orders. Internat. J. Production Res. 48(14):4253–4271.CrossrefGoogle Scholar
  • Veinott AF Jr (1965) The optimal inventory policy for batch ordering. Oper. Res. 13(3):424–432.LinkGoogle Scholar
  • Veinott AF Jr (1966) On the optimality of (s, S) inventory policies: New conditions and a new proof. SIAM J. Appl. Math. 14(5):1067–1083.CrossrefGoogle Scholar
  • Zhang L, Çetinkaya S (2011) Stochastic dynamic inventory problem under explicit inbound transportation cost capacity. Working paper, Texas A&M University, College Station.Google Scholar
  • Zheng Y, Chen F (1992) Inventory policies with quantized ordering. Naval Res. Logist. 39(3):285–305.CrossrefGoogle 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.