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

DOI10.1016/J.COR.2019.03.007MaRDI QIDQ2003567zbMATH OpenOpenAlexWikidataFDO

Authors A. Cem Randa, Mustafa K. Doǧru, Cem Iyigun, 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

heuristicnon-stationarypenalty coststatic-dynamic uncertaintystochastic lot-sizing problem

Mathematics Subject Classification ID

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

Recommendations

• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• Linear programming models for a stochastic dynamic capacitated lot sizing problem
• Production strategies for a stochastic lot-sizing problem with constant capacity
• A Cost Adjustment Heuristic for Dynamic Lot-Sizing with Uncertain Demand Timing
• An efficient lot-sizing heuristic for a periodic-review inventory system under non-stationary stochastic demand

Cites work

• An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
• Computational Complexity of the Capacitated Lot Size Problem
• Computing Optimal (s, S) Inventory Policies
• Dynamic lot sizing with random demand and non-stationary costs
• Dynamic version of the economic lot size model
• scientific article; zbMATH DE number 3322720 (Why is no real title available?)
• Nervousness in inventory control: Analytical results
• On stochastic lot-sizing problems with random lead times
• On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
• Optimality of (s, S) Policies in Inventory Models with Markovian Demand
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• Single item lot sizing problems
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints

Cited in

(12)

• Production strategies for a stochastic lot-sizing problem with constant capacity
• Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
• Heuristic procedures for a stochastic lot-sizing problem in make-to-order manufacturing
• Fix and relax heuristic for a stochastic lot-sizing problem
• 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
• Linear programming models for a stochastic dynamic capacitated lot sizing problem
• A Cost Adjustment Heuristic for Dynamic Lot-Sizing with Uncertain Demand Timing
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
• The lot-size adaptation approach for the two-level stochastic capacitated lot-sizing problem
• Multi-stage scenario-based stochastic programming for managing lot sizing and workforce scheduling at Vestel

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

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