Linear programming models for a stochastic dynamic capacitated lot sizing problem

DOI10.1016/j.cor.2015.01.007zbMath1348.90045OpenAlexW1981763621MaRDI QIDQ337545

Timo Hilger, Horst Tempelmeier

Publication date: 10 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.01.007

zbMATH Keywords

lot sizingcapacitiesdynamic demandrandom demand

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (12)

Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution ⋮ Capacitated dynamic production and remanufacturing planning under demand and return uncertainty ⋮ The stochastic lot-sizing problem with quantity discounts ⋮ A note on ``Linear programming models for a stochastic dynamic capacitated lot sizing problem ⋮ Erratum to: ``Linear programming models for a stochastic dynamic capacitated lot sizing problem ⋮ A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times ⋮ The robust multi-plant capacitated 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 ⋮ A capacitated lot sizing problem with stochastic setup times and overtime ⋮ Data-driven assignment of delivery patterns with handling effort considerations in retail ⋮ Editorial. Quantitative approaches in production management

Cites Work

• The stochastic economic lot scheduling problem: a survey
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• Lotsizing and scheduling for production planning
• On the single item fill rate for a finite horizon.
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Dynamic capacitated lot sizing with random demand and dynamic safety stocks
• Average fill rate and horizon length
• The Capacitated Lot-Sizing Problem with Linked Lot Sizes
• ABC _β–a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint
• Multi-item capacitated lot-sizing with demand uncertainty
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• Production Planning by Mixed Integer Programming

This page was built for publication: Linear programming models for a stochastic dynamic capacitated lot sizing problem