Random Start Local Search and Tabu Search for a Discrete Lot-Sizing and Scheduling Problem
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.
KeywordsLot sizing Scheduling Metaheuristics Tabu search Random start local search.
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Said Hanafi. On the convergence of tabu search. Journal of Heuristics, 7: 47–58, 2000.Google Scholar
- Thomas Lengauer. Combinatorial Algorithms for Integrated Circuit Layout, chapter 8, pages 427–446. John Wiley and Sons, 1990.Google Scholar
- 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.Google Scholar