RUO Home

Repositorio Institucional de la Universidad de Oviedo

View Item 
  •   RUO Home
  • Producción Bibliográfica de UniOvi: RECOPILA
  • Capítulos de libros
  • View Item
  •   RUO Home
  • Producción Bibliográfica de UniOvi: RECOPILA
  • Capítulos de libros
  • View Item
    • español
    • English
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of RUOCommunities and CollectionsBy Issue DateAuthorsTitlesSubjectsxmlui.ArtifactBrowser.Navigation.browse_issnAuthor profilesThis CollectionBy Issue DateAuthorsTitlesSubjectsxmlui.ArtifactBrowser.Navigation.browse_issn

My Account

LoginRegister

Statistics

View Usage Statistics

RECENTLY ADDED

Last submissions
Repository
How to publish
Resources
FAQs

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

Author:
González Fernández, Miguel ÁngelUniovi authority; Rodríguez Vela, María del CaminoUniovi authority; Varela Arias, José RamiroUniovi authority
Publication date:
2011
Editorial:

Springer

Publisher version:
http://dx.doi.org/10.1007/978-3-642-25274-7_37
Citación:
Advances in Artificial Intelligence, p. 363-372 (2011); doi:10.1007/978-3-642-25274-7_37
Serie:

Lecture Notes in Computer Science;7023

Descripción física:
p. 363-372
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-the-art methods in solving problem instances from several datasets of both classical JSP and JSP with setup times

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-the-art methods in solving problem instances from several datasets of both classical JSP and JSP with setup times

Description:

Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2011 (14th. 2011. La Laguna, España)

URI:
http://hdl.handle.net/10651/11339
ISBN:
978-3-642-25273-0
ISSN:
0302-9743
Identificador local:

20111628

DOI:
10.1007/978-3-642-25274-7_37
Patrocinado por:

This research has been supported by the Spanish Ministry of Science and Innovation under research project MICINN-FEDER TIN2010- 20976-C02-02 and by the Principality of Asturias under grant FICYT-BP07-109

Collections
  • Capítulos de libros [6535]
  • Informática [875]
Files in this item
Thumbnail
untranslated
Postprint (195.8Kb)
Métricas
Compartir
Exportar a Mendeley
Estadísticas de uso
Estadísticas de uso
Metadata
Show full item record
Página principal Uniovi

Biblioteca

Contacto

Facebook Universidad de OviedoTwitter Universidad de Oviedo
The content of the Repository, unless otherwise specified, is protected with a Creative Commons license: Attribution-Non Commercial-No Derivatives 4.0 Internacional
Creative Commons Image