The stochastic lot sizing problem with piecewise linear concave ordering costs

DOI10.1016/J.COR.2015.07.004zbMath1349.90049OpenAlexW1130414749MaRDI QIDQ342128

Burak Eksioglu, Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.07.004

zbMATH Keywords

inventoryconcave ordering costsgeneralized \((R, S)\) policygeneralized \((s, S)\) policystochastic lot sizing

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (4)

The stochastic lot-sizing problem with quantity discounts ⋮ Stochastic lot sizing problem with nervousness considerations ⋮ A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times ⋮ Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount

Cites Work

• Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand
• Nervousness in inventory management: Comparison of basic control rules
• Planning stability under \((s,S)\) inventory control rules
• Piecewise linear lower and upper bounds for the standard normal first order loss function
• Constraint programming for stochastic inventory systems under shortage cost
• Optimal Inventory Policy with Two Suppliers
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• On the Optimality of Generalized (s, S) Policies
• The Optimality of Generalized (s, S) Policies under Uniform Demand Densities

This page was built for publication: The stochastic lot sizing problem with piecewise linear concave ordering costs