The stochastic lot sizing problem with piecewise linear concave ordering costs

DOI10.1016/J.COR.2015.07.004MaRDI QIDQ342128zbMATH OpenOpenAlexFDO

Authors Huseyin Tunc, Onur A. Kilic, Burak Eksioglu, 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)

Recommendations

• Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy
• The stochastic lot-sizing problem with quantity discounts
• Optimal policies for inventory systems with concave ordering costs
• Computing non-stationary \((s, S)\) policies using mixed integer linear programming
• On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures

Cites work

• Constraint programming for stochastic inventory systems under shortage cost
• 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
• On the Optimality of Generalized (s, S) Policies
• Optimal Inventory Policy with Two Suppliers
• Piecewise linear lower and upper bounds for the standard normal first order loss function
• Planning stability under \((s,S)\) inventory control rules
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• The Optimality of Generalized (s, S) Policies under Uniform Demand Densities

Cited in

(10)

• A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
• On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
• The stochastic lot-sizing problem with quantity discounts
• A perfect information lower bound for robust lot-sizing problems
• Lot-sizing with fixed charges on stocks: the convex hull
• Two-stage stochastic lot-sizing problem under cost uncertainty
• Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy
• Stochastic lot sizing problem with nervousness considerations
• Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs
• Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342128)