Abstract
In this paper we describe random start local search and tabu search for solving a multi-item, multi-machine discrete lot sizing and scheduling problem with sequence dependent changeover costs. We present two construction heuristics with a random component; one of them is purely random and another is based on the linear programming relaxation of the mixed integer programming model. They are used to generate initial solutions for random start local search and tabu search. We also propose two ways of exploring the neighborhoods, one based on a random subset of the neighborhood, and another based on exploring the whole neighborhood. Construction and improvement methods were combined on random start local search and tabu search, leading to a total of eight different methods. We present results of extensive computer experiments for analyzing the performance of all methods and their comparison with branchand-bound, and conclude with some remarks on the different approaches to the problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
references>J. Wesley Barnes and Manuel Laguna. A tabu search experience in production scheduling. In F. Glover, M. Laguna, E. Taillard, and D. de Werra, editors, Annals of Operations Research, volume 41, pages 141–156. J. C. Baltzer AG, 1993.
G. Belvaux and L. A. Wolsey. Lotsizelib: A library of models and matrices for lot-sizing problems. Internal report, Center for Operations Research and Econometrics, Universite Catholique de Louvain, 1999.
Gaetan Belvaux and Laurence A. Wolsey. Modelling practical lot-sizing problems as mixed integer programs. Discussion paper, Center for Operations Research and Econometrics, Belgium, 2000.
A. Drexl and A. Kimms. Lot sizing and scheduling — Survey and extensions. European Journal of Operational Research, 99: 221–235, 1997.
Fred Glover. Tabu search — Part I. ORSA Journal on Computing, 1: 190–206, 1989.
Fred Glover. Tabu search — Part II. ORSA Journal on Computing, 2: 4–32, 1990.
Fred Glover and Said Hanafi. Tabu search and finite convergence. Discrete Applied Mathematics, 119 (1–2): 3–36, 2002.
Said Hanafi. On the convergence of tabu search. Journal of Heuristics, 7: 47–58, 2000.
R. Kuik, M. Salomon, and L.N. van Wassenhove. Batching decisions: structure and models. European Journal of Operational Research, 75: 243–263, 1994.
Thomas Lengauer. Combinatorial Algorithms for Integrated Circuit Layout, chapter 8, pages 427–446. John Wiley and Sons, 1990.
A. Pereira, F. Carvalho, J. Pedroso, and M. Constantino. Benchmark instances for dynamic lot sizing and scheduling problems. Internet repository, 2001. http://www.ncc.up.pt/ jpp/dlsp.
C. van Eijl. A Polyhedral Approach to the Discrete Lot-Sizing and Scheduling Problem. PhD thesis, Technische Universiteit Eindhoven, 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Pereira, A., Carvalho, F., Constantino, M., Pedroso, J.P. (2003). Random Start Local Search and Tabu Search for a Discrete Lot-Sizing and Scheduling Problem. In: Metaheuristics: Computer Decision-Making. Applied Optimization, vol 86. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4137-7_27
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4137-7_27
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5403-9
Online ISBN: 978-1-4757-4137-7
eBook Packages: Springer Book Archive