- -

Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics

Mostrar el registro sencillo del ítem

Ficheros en el ítem

[Cerrado]
Nombre: Villa - Minimizing ...
Tamaño: 446.1Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author Alvarez Valdes, Ramón es_ES
dc.contributor.author Tamarit, J.M. es_ES
dc.contributor.author Villa Juliá, Mª Fulgencia es_ES
dc.date.accessioned 2015-07-06T10:17:38Z
dc.date.available 2015-07-06T10:17:38Z
dc.date.issued 2015-02
dc.identifier.issn 0305-0548
dc.identifier.uri http://hdl.handle.net/10251/52728
dc.description.abstract We consider the problem of scheduling a set of jobs on a set of identical parallel machines where the objective is to minimize the total weighted earliness and tardiness penalties with respect to a common due date. We propose a hybrid heuristic algorithm for constructing good solutions, combining priority rules for assigning jobs to machines and a local search with exact procedures for solving the one-machine subproblems. These solutions are then used in two metaheuristic frameworks, Path Relinking and Scatter Search, to obtain high quality solutions for the problem. The algorithms are tested on a large number of test instances to assess the efficiency of the proposed strategies. The results show that our algorithms consistently outperform the best reported results for this problem. es_ES
dc.description.sponsorship This study has been partially supported by the Spanish Ministry of Science and Technology, DPI2011-24977, and by Generalitat Valenciana, PROMETEO/2013/049. en_EN
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof Computers and Operations Research es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Scheduling es_ES
dc.subject Earliness-tardiness es_ES
dc.subject Parallel machines es_ES
dc.subject Hybrid metaheuristics es_ES
dc.subject Path Relinking es_ES
dc.subject Scatter Search es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.cor.2014.08.020
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//DPI2011-24977/ES/APLICACIONES LOGISTICAS E INDUSTRIALES DE LOS PROBLEMAS DE EMPAQUETAMIENTO Y CORTE/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/GVA//PROMETEO%2F2013%2F049/ES/Modelos y algoritmos para problemas de optimización combinatoria/ es_ES
dc.rights.accessRights Cerrado es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat es_ES
dc.description.bibliographicCitation Alvarez Valdes, R.; Tamarit, J.; Villa Juliá, MF. (2015). Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics. Computers and Operations Research. 54:1-11. https://doi.org/10.1016/j.cor.2014.08.020 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1016/j.cor.2014.08.020 es_ES
dc.description.upvformatpinicio 1 es_ES
dc.description.upvformatpfin 11 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 54 es_ES
dc.relation.senia 266608
dc.identifier.eissn 1873-765X
dc.contributor.funder Ministerio de Ciencia e Innovación es_ES
dc.contributor.funder Generalitat Valenciana es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem