A Tabu search algorithm to minimize lateness in scheduling problems with setup times

  • Authors:

  • Miguel A. González;Camino R. Vela;Ramiro Varela

  • Affiliations:

  • A.I. Centre and Department of Computer Science, University of Oviedo, Gijón, Spain;A.I. Centre and Department of Computer Science, University of Oviedo, Gijón, Spain;A.I. Centre and Department of Computer Science, University of Oviedo, Gijón, Spain

  • Venue:
  • CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We face the Job Shop Scheduling Problem with Sequence Dependent Setup Times and maximum lateness minimization as objective function. We propose a disjunctive graph representation for this problem that allows to define the concept of critical path properly. From this representation, we have defined a neighborhood structure suitable to cope with lateness minimization. This neighborhood structure is exploited in combination with a Tabu Search algorithm. We report results from an experimental study across conventional benchmark instances showing that this approach outperforms some of the current state-of-the-art methods.