Improved lower bounds for the capacitated lot sizing problem with setup times.

DOI10.1016/j.orl.2003.06.001zbMath1137.90584OpenAlexW2116355414MaRDI QIDQ1417600

Raf Jans, Zeger Degraeve

Publication date: 5 January 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://repub.eur.nl/pub/326/ERS-2003-026-LIS.pdf

zbMATH Keywords

relaxationDantzig-Wolfe decompositionLagrangeLower boundsCapacitated lot sizing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (31)

Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ Hybrid methods for lot sizing on parallel machines ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ A rolling-horizon approach for multi-period optimization ⋮ Multiple machine continuous setup lotsizing with sequence-dependent setups ⋮ A computational analysis of lower bounds for big bucket production planning problems ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines ⋮ Fixed-charge transportation on a path: optimization, LP formulations and separation ⋮ Improved lower bounds for the capacitated lot sizing problem with setup times. ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Modeling industrial lot sizing problems: a review ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ Fixed-Charge Transportation on a Path: Linear Programming Formulations ⋮ Lagrangean relaxation based heuristics for lot sizing with setup times ⋮ A capacitated lot sizing problem with stochastic setup times and overtime ⋮ Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case ⋮ On discrete lot-sizing and scheduling on identical parallel machines ⋮ A computational comparison of cyclical and non-cyclical control for stochastic production-inventory systems ⋮ Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times ⋮ Robust formulations for economic lot-sizing problem with remanufacturing ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times ⋮ Knapsack problems with setups ⋮ Approximate extended formulations

Uses Software

• LINDO
• Knapsack

Cites Work

• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• A minimal algorithm for the multiple-choice knapsack problem
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
• Dynamic Version of the Economic Lot Size Model
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
• Uncapacitated lot-sizing: The convex hull of solutions
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• The Multiple-Choice Knapsack Problem

This page was built for publication: Improved lower bounds for the capacitated lot sizing problem with setup times.