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 relaxationdecompositionmetaheuristicsmathematical programmingCLSPgreedy heuristicsCLSPLdynamic capacitated lot-sizingMLCLSP

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 (66)

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 ⋮ A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing ⋮ A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation ⋮ An evaluation of semidefinite programming based approaches for discrete lot-sizing problems ⋮ Polynomial cases of the economic lot sizing problem with cost discounts ⋮ Multi-period descriptive sampling for scenario generation applied to the stochastic capacitated lot-sizing problem ⋮ A modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission control ⋮ 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

• Mlclsp
• bc-prod

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The discrete lot-sizing and scheduling problem
• Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing
• Capacitated lot-sizing with extensions: a review
• A heuristic approach for big bucket multi-level production planning problems
• Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• A modified priority index for Günther's lot-sizing heuristic under capacited single stage production
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• Deterministic lotsizing models for production planning
• Multi-item lot size determination and scheduling under capacity constraints
• An efficient algorithm for the capacitated single item dynamic lot size problem
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
• Lot sizing and scheduling -- survey and extensions
• Lotsizing and scheduling for production planning
• On practical resource allocation for production planning and scheduling with period overlapping setups
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• A new heuristic approach for the multi-item dynamic lot sizing problem
• A heuristic method for lot-sizing in multi-stage systems
• Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
• The general lotsizing and scheduling problem
• Progress with single-item lot-sizing
• Solving mixed integer programming production planning problems with setups by shadow price information.
• Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem
• Heuristic genetic algorithms for general capacitated lot-sizing problems
• Experience with fine-grained parallel genetic algorithms
• Planning lot sizes and capacity requirements in a single stage production system
• Future paths for integer programming and links to artificial intelligence
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
• Lot sizing in capacitated production planning and control systems
• Statistical search methods for lotsizing problems
• Single item lot sizing problems
• Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources
• A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
• Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
• The Capacitated Lot-Sizing Problem with Linked Lot Sizes
• Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
• Evolutionary algorithms for production planning problems with setup decisions
• A multi-class multi-level capacitated lot sizing model
• Decomposition Principle for Linear Programs
• Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
• Heuristics for theN-product,M-stage, economic lot sizing and scheduling problem with dynamic demand
• Capacitated Multi-Item Lot-Sizing Problems with Time Windows
• Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
• Combining population-based and exact methods for multi-level capacitated lot-sizing problems
• Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• The Deterministic Dynamic Product Cycling Problem
• Heuristics for Multilevel Lot-Sizing with a Bottleneck
• The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
• Deterministic Production Planning: Algorithms and Complexity
• Computational Complexity of the Capacitated Lot Size Problem
• Some Extensions of the Discrete Lotsizing and Scheduling Problem
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
• Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
• LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
• An effective heuristic for the CLSP with set-up times
• A Heuristic for a Resource-capacitated Multi-stage Lot-sizing Problem with Lead Times
• Solving the CLSP by a Tabu Search Heuristic
• Lot Sizing in Serial Assembly Systems with Multiple Constrained Resources
• METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES
• A Deterministic Multi-Period Production Scheduling Model with Backlogging
• An Efficient Algorithm for Multi-Item Scheduling
• Variable neighborhood search: Principles and applications

This page was built for publication: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches