The Capacitated Lot-Sizing Problem with Linked Lot Sizes

Authors:
Christopher Suerie;Hartmut Stadtler
Affiliations:
-;-
Venue:
Management Science
Year:
2003

Citing 0
Cited 13

Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

Journal of Heuristics
Lot sizing and furnace scheduling in small foundries

Computers and Operations Research
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

Computers and Operations Research
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints

INFORMS Journal on Computing
Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum

Computers and Operations Research
Capacitated lot sizing with linked lots for general product structures in job shops

Computers and Industrial Engineering
Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

Journal of Scheduling
A math-heuristic for the multi-level capacitated lot sizing problem with carryover

EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
A MIP based heuristic for capacitated MRP systems

Computers and Industrial Engineering
Multi-stage simultaneous lot-sizing and scheduling for flow line production

OR Spectrum
A MIP-based framework and its application on a lot sizing problem with setup carryover

Journal of Heuristics
A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders

Computers and Operations Research
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper a new mixed integer programming (MIP) model formulation and its incorporation into a time-oriented decomposition heuristic for the capacitated lot-sizing problem with linked lot sizes (CLSPL) is proposed. The solution approach is based on an extended model formulation and valid inequalities to yield a tight formulation. Extensive computational tests prove the capability of this approach and show a superior solution quality with respect to other solution algorithms published so far.