Weighted tardiness minimization in job shops with setup times by hybrid genetic algorithm

Authors:
Miguel A. González;Camino R. Vela;Ramiro Varela
Affiliations:
Department of Computer Science, University of Oviedo, Gijón, Spain;Department of Computer Science, University of Oviedo, Gijón, Spain;Department of Computer Science, University of Oviedo, Gijón, Spain
Venue:
CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Year:
2011

Citing 5
Cited 0

Job shop scheduling by simulated annealing

Operations Research
Tabu Search

Tabu Search
A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

Computers and Operations Research
Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times

IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we confront the weighted tardiness minimization in the job shop scheduling problem with sequence-dependent setup times. We start by extending an existing disjunctive graph model used for makespan minimization to represent the weighted tardiness problem. Using this representation, we adapt a local search neighborhood originally defined for makespan minimization. The proposed neighborhood structure is used in a genetic algorithm hybridized with a simple tabu search method. This algorithm is quite competitive with state-of-theart methods in solving problem instances from several datasets of both classical JSP and JSP with setup times.