Metaheuristic for parallel machines scheduling with resource-assignable sequence dependent setup times

Authors:
Luís H.C. Bicalho;André G. dos Santos;José E.C. Arroyo
Affiliations:
Universidade Federal de Viçosa, Viçosa, MG, Brazil;Universidade Federal de Viçosa, Viçosa, MG, Brazil;Universidade Federal de Viçosa, Viçosa, MG, Brazil
Venue:
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Year:
2011

Citing 5
Cited 0

Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach

Computers and Industrial Engineering
Parallel Machine Scheduling by Column Generation

Operations Research
A combination of evolutionary algorithm, mathematical programming, and a new local search procedure for the just-in-time job-shop scheduling problem

LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Iterated local search with path relinking for solving parallel machines scheduling problem with resource-assignable sequence dependent setup times

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
The complexity of scheduling job families about a common due date

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe and show the results of a combination of two metaheuristics to solve an unrelated parallel machines scheduling problem in which the setup times depend not only on the machine and job sequence, but also on the amount of resource assigned. This problem has been proposed recently on the literature and since then a couple of metaheuristics have been used to address it. The one proposed here, called GTS, consists of two phases: initially, some solutions are generated by the GRASP metaheuristic; subsequently, the Tabu Search (TS) is applied in the best solution found by GRASP. The numerical experiments show that the GTS heuristic was able to improve the results in 70% (251 out of 360) of the larger instances available in the literature.