The stochastic lot sizing problem with piecewise linear concave ordering costs
From MaRDI portal
Publication:342128
DOI10.1016/J.COR.2015.07.004zbMATH Open1349.90049OpenAlexW1130414749MaRDI QIDQ342128FDOQ342128
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
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
inventoryconcave ordering costsgeneralized \((R, S)\) policygeneralized \((s, S)\) policystochastic lot sizing
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
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- On the Optimality of Generalized (s, S) Policies
- Planning stability under \((s,S)\) inventory control rules
- Piecewise linear lower and upper bounds for the standard normal first order loss function
- Optimal Inventory Policy with Two Suppliers
- The Optimality of Generalized (s, S) Policies under Uniform Demand Densities
Cited In (9)
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- A perfect information lower bound for robust lot-sizing problems
- Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs
- Stochastic lot sizing problem with nervousness considerations
- Two-stage stochastic lot-sizing problem under cost uncertainty
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
- Lot-sizing with fixed charges on stocks: the convex hull
- The stochastic lot-sizing problem with quantity discounts
- 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)
