Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy

DOI10.1016/j.cor.2019.03.007zbMath1458.90034OpenAlexW2924449888WikidataQ128184625 ScholiaQ128184625MaRDI QIDQ2003567

Cem Iyigun, Mustafa K. Doğru, A. Cem Randa, Ulaş Özen

Publication date: 9 July 2019

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

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

zbMATH Keywords

heuristicstatic-dynamic uncertaintynon-stationarypenalty coststochastic lot-sizing problem

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (2)

Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times

Cites Work

• On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
• On stochastic lot-sizing problems with random lead times
• An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
• Nervousness in inventory control: Analytical results
• Dynamic lot sizing with random demand and non-stationary costs
• Single item lot sizing problems
• Dynamic Version of the Economic Lot Size Model
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• Computational Complexity of the Capacitated Lot Size Problem
• Optimality of (s, S) Policies in Inventory Models with Markovian Demand
• Computing Optimal (s, S) Inventory Policies
• Unnamed Item

This page was built for publication: Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy