A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover

Authors:
Mohan Gopalakrishnan;Ke Ding;Jean-Marie Bourjolly;Srimathy Mohan
Affiliations:
-;-;-;-
Venue:
Management Science
Year:
2001

Citing 0
Cited 8

A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times

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
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times

Computers and Operations Research
A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs

Computers and Industrial Engineering
MIP formulations and heuristics for two-level production-transportation problems

Computers and Operations Research
A MIP-based framework and its application on a lot sizing problem with setup carryover

Journal of Heuristics
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper presents a tabu-search heuristic for the capacitated lot-sizing problem (CLSP) with set-up carryover. This production-planning problems allows multiple items to be produced within a time period, and setups for items to be carried over from one period to the next. Two interrelated decisions, sequencing and lot sizing, are present in this problem. Our tabu-search heuristic consists of five basic move types--three for the sequencing decisions and two for the lot-sizing decisions. We allow infeasible solutions to be generated at a penalty during the course of the search. We use several search strategies, such as dynamic tabu list, adaptive memory, and self-adjusting penalties, to strengthen our heuristic. We also propose a lower-bounding procedure to estimate the quality of our heuristic solution. We have also modified our heuristic to produce good solutions for the CLSP without set-up carryover. The computational study, conducted on a set of 540 test problems, indicates that on average our heuristic solutions are within 12% of a bound on optimality. In addition, for the set of test problems our results indicate an 8% reduction in total cost through set-up carryover.