Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times

  • Authors:

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

  • Affiliations:

  • Computing Technologies Group, Department of Computing, Artificial Intelligence Center, University of Oviedo, Gijón, Spain 33271;Computing Technologies Group, Department of Computing, Artificial Intelligence Center, University of Oviedo, Gijón, Spain 33271;Computing Technologies Group, Department of Computing, Artificial Intelligence Center, University of Oviedo, Gijón, Spain 33271

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Job Shop Scheduling Problem (JSP) is an example of a combinatorial optimization problem that has interested researchers for several decades. In this paper we confront an extension of this problem called JSP with Sequence Dependent Setup Times (SDST-JSP). The approach extends a genetic algorithm and a local search method that demonstrated to be efficient in solving the JSP. For local search, we have formalized neighborhood structures that generalize three well-know structures defined for the JSP. We have conducted an experimental study across conventional benchmark instances showing that the genetic algorithm exploited in combination with the local search, considering all three neighborhoods at the same time, provides the best results. Moreover, this approach outperforms the current state-of-the-art methods.