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/31597

Title: Tabu search and genetic algorithm for scheduling with total flow time minimization
Author(s): González Fernández, Miguel Ángel
Rodríguez Vela, María del Camino
Sierra Sánchez, María Rita
Varela Arias, José Ramiro
Issue date: 2010
Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
Format extent: p. 33-41
Abstract: In this paper we confront the job shop scheduling problem with total flow time minimization. We start extending the disjunctive graph model used for makespan minimization to represent the version of the problem with total flow time minimization. Using this representation, we adapt local search neighborhood structures originally defined for makespan minimization. The proposed neighborhood structures are used in a genetic algorithm hybridized with a simple tabu search method, outperforming state-of-the-art methods in solving problem instances from several datasets
URI: http://hdl.handle.net/10651/31597
Appears in Collections:Ponencias, Discursos y Conferencias

Files in This Item:

File Description SizeFormat
coplas'10-paper4.pdf187,42 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