Dynamic capacitated lot-sizing problems: a classification and review of solution approaches

DOI10.1007/s00291-008-0150-7zbMath1183.90162OpenAlexW2022394275MaRDI QIDQ2379665

Stefan Helber, Horst Tempelmeier, Florian Sahling, Lisbeth Buschkühl

Publication date: 19 March 2010

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-008-0150-7

zbMATH Keywords

Lagrangian relaxation decomposition metaheuristics mathematical programming CLSP greedy heuristics CLSPL dynamic capacitated lot-sizing MLCLSP

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Dynamic programming (90C39)

Related Items

Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear ⋮ Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Integrating deterioration and lifetime constraints in production and supply chain planning: a survey ⋮ Lead time considerations for the multi-level capacitated lot-sizing problem ⋮ A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution ⋮ Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling-horizon scheduling system ⋮ Optimal production-inventory policy for an integrated multi-stage supply chain with time-varying demand ⋮ Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints ⋮ Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator ⋮ Capacitated dynamic production and remanufacturing planning under demand and return uncertainty ⋮ Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ Multi-product valid inequalities for the discrete lot-sizing and scheduling problem ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems ⋮ Designing new heuristics for the capacitated lot sizing problem by genetic programming ⋮ Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems ⋮ The inventory replenishment planning and staggering problem: a bi-objective approach ⋮ Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: robust formulation and a decomposition solution approach ⋮ Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system ⋮ Design of mathematical models for the integration of purchase and production lot-sizing and scheduling problems under demand uncertainty ⋮ A computational analysis of lower bounds for big bucket production planning problems ⋮ Multi-stage simultaneous lot-sizing and scheduling for flow line production ⋮ Dynamic capacitated lot sizing with random demand and dynamic safety stocks ⋮ New construction heuristic for capacitated lot sizing problems ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ The robust multi-plant capacitated lot-sizing problem ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times ⋮ Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount ⋮ Unnamed Item ⋮ An integrated model for production and distribution planning of perishable products with inventory and routing considerations ⋮ A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks ⋮ Influence of consumer purchasing behaviour on the production planning of perishable food ⋮ Capacitated lot sizing problems with inventory bounds ⋮ Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup ⋮ A capacitated lot-sizing model with sequence-dependent setups, parallel machines and bi-part injection moulding ⋮ Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions ⋮ An integrated approach for production lot sizing and raw material purchasing ⋮ Integer programming models for mid-term production planning for high-tech low-volume supply chains ⋮ A capacitated lot sizing problem with stochastic setup times and overtime ⋮ Classifying and modeling setups and cleanings in lot sizing and scheduling ⋮ Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case ⋮ A dynamic uncapacitated lot-sizing problem with co-production ⋮ Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics ⋮ Integrated production and distribution planning in the fast moving consumer goods industry: A block planning application ⋮ A single-item lot-sizing problem with a by-product and inventory capacities ⋮ Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ The crop growth planning problem in vertical farming ⋮ An evaluation of semidefinite programming based approaches for discrete lot-sizing problems ⋮ Polynomial cases of the economic lot sizing problem with cost discounts ⋮ Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory ⋮ Unnamed Item ⋮ A Two Stage Approach for Balancing a Periodic Long-Haul Transportation Network ⋮ Solving Multi-Level Capacitated Lot Sizing Problems via a Fix-and-Optimize Approach ⋮ Robust optimization for lot-sizing problems under yield uncertainty ⋮ A Lagrangian heuristic for capacitated single item lot sizing problems ⋮ Timed route approaches for large multi-product multi-step capacitated production planning problems ⋮ A decomposition approach for the general lotsizing and scheduling problem for parallel production lines ⋮ Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach

Uses Software

Cites Work