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

DOI10.1016/J.EJOR.2011.06.034MaRDI QIDQ420867zbMATH OpenOpenAlexWikidataFDO

Authors 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

inventorymixed integer programmingrelaxationservice levelstatic-dynamic uncertaintystochastic non-stationary demand

Mathematics Subject Classification ID

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

Recommendations

• A reformulation for the stochastic lot sizing problem with service-level constraints
• An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
• A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• Formulations for dynamic lot sizing with service levels

Cites work

• 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
• Constraint programming for computing non-stationary \((R, S)\) inventory policies
• Dynamic lot sizing with random demand and non-stationary costs
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Network flows. Theory, algorithms, and applications.
• On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints

Cited in

(15)

• An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
• New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
• Capacitated disassembly scheduling under stochastic yield and demand
• On a deterministic approximation of inventory systems with sequential service-level constraints
• An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
• On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
• Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
• A reformulation for the stochastic lot sizing problem with service-level constraints
• Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times
• A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
• Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
• Model formulations for the capacitated lot-sizing problem with service-level constraints
• An integrated model for lot sizing with supplier selection and quantity discounts
• Preprocessing techniques and column generation algorithms for stochastically efficient demand
• Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy

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

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