English español

Repositorio de la Universidad de Oviedo. > Producción Bibliográfica de UniOvi: RECOPILA > Ponencias, Discursos y Conferencias >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10651/31596

Title: An efficient memetic algorithm for the flexible job shop with setup times
Author(s): González Fernández, Miguel Ángel
Rodríguez Vela, María del Camino
Varela Arias, José Ramiro
Issue date: 2013
Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
Format extent: p. 91-99
Abstract: This paper addresses the flexible job shop scheduling problem with sequence-dependent setup times (SDSTFJSP). This is an extension of the classical job shop scheduling problem with many applications in real production environments. We propose an effective neighborhood structure for the problem, including feasibility and non improving conditions, as well as procedures for fast neighbor estimation. This neighborhood is embedded into a genetic algorithm hybridized with tabu search. We conducted an experimental study to compare the proposed algorithm with the state-of-the-art in the SDST-FJSP and also in the standard FJSP. In this study, our algorithm has obtained better results than those from other methods. Moreover, it has established new upper bounds for a number of instances
URI: http://hdl.handle.net/10651/31596
Appears in Collections:Ponencias, Discursos y Conferencias

Files in This Item:

File Description SizeFormat
5969-30083-1-PB.pdf166,25 kBAdobe PDFView/Open

Exportar a Mendeley

This item is licensed under a Creative Commons License
Creative Commons

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Base de Datos de Autoridades Biblioteca Universitaria Consultas / Sugerencias