Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

  • Authors:

  • Miguel A. González;Camino R. Vela;Inés González-Rodríguez;Ramiro Varela

  • Affiliations:

  • Department of Computing, Computing Technologies Group, Artificial Intelligence Center, University of Oviedo, Gijón, Spain 33271;Department of Computing, Computing Technologies Group, Artificial Intelligence Center, University of Oviedo, Gijón, Spain 33271;Department of Mathematics, Statistics and Computing, University of Cantabria, Santander, Spain 39005;Department of Computing, Computing Technologies Group, Artificial Intelligence Center, University of Oviedo, Gijón, Spain 33271

  • Venue:
  • Journal of Intelligent Manufacturing
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search algorithm. To assess the performance of this algorithm, we present the results of an extensive experimental study, including an analysis of the tabu search algorithm under different running conditions and a comparison with the state-of-the-art algorithms. The experiments are performed across two sets of conventional benchmarks with 960 and 17 instances respectively. The results demonstrate that the proposed tabu search algorithm is superior to the state-of-the-art methods both in quality and stability. In particular, our algorithm establishes new best solutions for 817 of the 960 instances of the first set and reaches the best known solutions in 16 of the 17 instances of the second set.