article

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

Authors:

Mohan Gopalakrishnan,

Jean-Marie Bourjolly,

Srimathy MohanAuthors Info & Claims

Management Science, Volume 47, Issue 6

Pages 851 - 863

Published: 01 June 2001 Publication History

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.

References

[1]

Anderson, E. J., B. S. Cheah. 1993. Capacitated lot-sizing with minimum batch sizes and setup times. Internat. J. Production Econom. 30-31 137-152.

[2]

Aras, O. A., L. A. Swanson. 1982. A lot sizing and sequencing algorithm for dynamic demands upon a single facility. J. Oper. Management. 2 177-185.

[3]

Cattrysse, D., M. Salomon, R. Kuik, L. N. Van Wassenhove. 1993. A dual ascent and column generation heuristic for the discrete lot sizing and scheduling problem with setup times. Management Sci. 39 477-486.

[4]

Dell'Amico, M., M. Trubian. 1993. Applying tabu search to the jobshop scheduling problem. Ann. Oper. Res. 41 231-252.

Digital Library

[5]

Diaby, M., H. C. Bahl, M. H. Karwan, S. Zionts. 1992. A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Management Sci. 38 1329-1340.

Digital Library

[6]

Florian, M., J. K. Lenstra, A. H. G. Rinnooy Kan. 1980. Deterministic production planning: algorithms and complexity. Management Sci. 26 669-679.

Digital Library

[7]

Gendreau, M., A. Hertz, G. Laporte. 1994. A tabu search heuristic for the vehicle routing problem. Management Sci. 40 1276-1290.

Digital Library

[8]

Glover, F., M. Laguna. 1993. Tabu search. C. Reeves, ed. Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford, U.K., 70-150.

[9]

Glover, F., G. Kochenberger, B. Alidaee. 1998. Adaptive memory tabu search. Management Sci. 44 336-345.

Digital Library

[10]

Glover, F., E. Taillard, D. de Werra. 1993. A users guide to tabu search. Ann. Oper. Res. 41 3-28.

Digital Library

[11]

Gopalakrishnan, M. 2000. A modified framework for modeling setup carryover in the capacitated lotsizing problem. Internat. J. Production Res. 38 3421-3424.

[12]

Gopalakrishnan, M., D. M. Miller, C. P. Schmidt. 1995. A framework for modeling setup carryover in the capacitated lot sizing problem. Internat. J. Production Res. 33 1973-1988.

[13]

Hertz., A., E. Taillard, D. de Werra. 1997. Tabu search. E. Aarts, J.K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley & Sons, New York, 121-136.

[14]

Lozano, S., J. Larraneta, L. Onieva. 1991. Primal-dual approach to the single level capacitated lot-sizing problem. Euro. J. Oper. Res. 51 354-366.

[15]

Rochat, Y., E. Taillard. 1995. Probabilistic diversification and intensification in local search for vehicle routing J. Heuristics 1 147-167.

[16]

Salomon, M., R. Kuik, L. N. Van Wassenhove. 1993. Statistical search methods for lotsizing problems. Ann. Oper. Res. 41 453-468.

Digital Library

[17]

Trigeiro, W. W., L. J. Thomas, J. O. McClain. 1989. Capacitated lot sizing with setup times. Management Sci. 35 353-366.

Digital Library

[18]

Wagner, H. M., T. M. Whitin. 1958. Dynamic version of the economic lot size model. Management Sci. 5 89-96.

Digital Library

Cited By

Wu T(2022)Predictive Search for Capacitated Multi-Item Lot Sizing ProblemsINFORMS Journal on Computing10.1287/ijoc.2021.107334:1(385-406)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1287/ijoc.2021.1073
Fiorotto DJans Rde Araujo S(2017)An analysis of formulations for the capacitated lot sizing problem with setup crossoverComputers and Industrial Engineering10.1016/j.cie.2016.12.037106:C(338-350)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.cie.2016.12.037
Carvalho DNascimento M(2016)Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and itemsComputers and Operations Research10.1016/j.cor.2016.01.01971:C(137-148)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1016/j.cor.2016.01.019
Show More Cited By

Index Terms

A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

A tabu search heuristic procedure for the capacitated facility location problem

A tabu search heuristic procedure is developed, implemented and computationally tested for the capacitated facility location problem. The procedure uses different memory structures. Visited solutions are stored in a primogenitary linked quad tree. For ...
An iterated tabu search heuristic for the Single Source Capacitated Facility Location Problem

Graphical abstractDisplay Omitted HighlightsStudies the Single Source Capacitated Facility Location Problem.Develops an iterated tabu search heuristic.Computational results show that this simple heuristic produces high-quality solutions. This paper ...
An efficient tabu search for solving the uncapacitated single allocation hub location problem

Given an efficient tabu search the uncapacitated single allocation hub location problem.Given some new tabu rules.Given some new theoretical results for computing the changes in the objective function's value for three types of moves.Improved the best ...

Comments

Information & Contributors

Information

Published In

cover image Management Science

Management Science Volume 47, Issue 6

June 2001

145 pages

ISSN:0025-1909

Issue’s Table of Contents

Publisher

INFORMS

Linthicum, MD, United States

Publication History

Published: 01 June 2001

Received: 15 June 1998

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wu T(2022)Predictive Search for Capacitated Multi-Item Lot Sizing ProblemsINFORMS Journal on Computing10.1287/ijoc.2021.107334:1(385-406)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1287/ijoc.2021.1073
Fiorotto DJans Rde Araujo S(2017)An analysis of formulations for the capacitated lot sizing problem with setup crossoverComputers and Industrial Engineering10.1016/j.cie.2016.12.037106:C(338-350)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.cie.2016.12.037
Carvalho DNascimento M(2016)Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and itemsComputers and Operations Research10.1016/j.cor.2016.01.01971:C(137-148)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1016/j.cor.2016.01.019
Xiao JYang HZhang CZheng LGupta J(2015)A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup timesComputers and Operations Research10.1016/j.cor.2015.04.01063:C(72-82)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1016/j.cor.2015.04.010
Gören HTunalı S(2015)Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approachApplied Intelligence10.1007/s10489-014-0626-x42:4(805-816)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1007/s10489-014-0626-x
Thomas BManni E(2014)Scheduled penalty Variable Neighborhood SearchComputers and Operations Research10.1016/j.cor.2013.12.00452:PB(170-180)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1016/j.cor.2013.12.004
Caserta MVoβ S(2013)A MIP-based framework and its application on a lot sizing problem with setup carryoverJournal of Heuristics10.1007/s10732-011-9161-719:2(295-316)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1007/s10732-011-9161-7
Wu TAkartunalı KSong JShi L(2013)Mixed integer programming in production planning with backlogging and setup carryoverDiscrete Event Dynamic Systems10.1007/s10626-012-0141-323:2(211-239)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1007/s10626-012-0141-3
Shim IKim HDoh HLee D(2011)A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costsComputers and Industrial Engineering10.1016/j.cie.2011.06.00261:4(920-929)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1016/j.cie.2011.06.002
Brahimi NDauzere-Peres SWolsey L(2010)Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup timesComputers and Operations Research10.1016/j.cor.2009.04.00537:1(182-188)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1016/j.cor.2009.04.005
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents