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

Authors:
Raf Jans;Zeger Degraeve
Affiliations:
Rotterdam School of Management, Erasmus University, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands;London Business School, Regent's Park, London NW1 4SA, UK
Venue:
Operations Research Letters
Year:
2004

Citing 5
Cited 6

Solving multi-item capacitated lot-sizing problems using variable redefinition

Operations Research
Capacitated lot sizing with setup times

Management Science
Analysis of relaxations for the multi-item capacitated lot-sizing problem

Annals of Operations Research
bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

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

Operations Research Letters

Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints

INFORMS Journal on Computing
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times

Computers and Operations Research
Fixed-charge transportation on a path: linear programming formulations

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Improved lower bounds for the capacitated lot sizing problem with setup times

Operations Research Letters
A computational analysis of lower bounds for big bucket production planning problems

Computational Optimization and Applications
A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present new lower bounds for the capacitated lot sizing problem, applying decomposition to the network reformulation. The demand constraints are the linking constraints and the problem decomposes into subproblems per period containing the capacity and setup constraints. Computational results and a comparison to other lower bounds are presented.