An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints

DOI10.1016/j.ejor.2011.06.034zbMath1237.90029OpenAlexW2132236995WikidataQ57539216 ScholiaQ57539216MaRDI QIDQ420867

Ulaş Özen, Roberto Rossi, S. Armagan Tarim, Mustafa K. Doğru

Publication date: 23 May 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/1430197/tarim_dogru_ozen_rossi_2009.pdf

zbMATH Keywords

inventoryrelaxationmixed integer programmingservice levelstatic-dynamic uncertaintystochastic non-stationary demand

Mathematics Subject Classification ID

Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Related Items (10)

On a Deterministic Approximation of Inventory Systems with Sequential Service-Level Constraints ⋮ Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution ⋮ Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times ⋮ A reformulation for the stochastic lot sizing problem with service-level constraints ⋮ An integrated model for lot sizing with supplier selection and quantity discounts ⋮ New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem ⋮ An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem ⋮ An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand ⋮ Capacitated disassembly scheduling under stochastic yield and demand ⋮ Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy

Cites Work

• Unnamed Item
• On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
• A global chance-constraint for stochastic inventory systems under service level constraints
• An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
• Dynamic lot sizing with random demand and non-stationary costs
• Constraint programming for computing non-stationary \((R, S)\) inventory policies
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• Elements of Large-Scale Mathematical Programming Part I: Concepts

This page was built for publication: An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints