Mostrar el registro sencillo del ítem

A new admissible heuristic for the job shop scheduling problem with total flow time

dc.contributor.authorSierra Sánchez, María Rita 
dc.contributor.authorVarela Arias, José Ramiro 
dc.date.accessioned2015-12-14T11:18:40Z
dc.date.available2015-12-14T11:18:40Z
dc.date.issued2008
dc.identifier.urihttp://users.dsic.upv.es/~msalido/workshop-cp-icaps08/papers.html
dc.identifier.urihttp://hdl.handle.net/10651/34031
dc.identifier.urihttp://www.aaai.org/Conferences/conferences.php
dc.description.abstractIn this paper, we face the Job Shop Scheduling problem with total flow time minimization with A∗ Nilsson’s algorithm. We propose a new heuristic based on problem relaxation to One Machine Sequencing problem with tardiness minimization. This heuristic is improved by means of the well-known generalized Emmons’ constraint propagation rules. Additionally, we use a pruning by dominance method to reduce the effective search space. We report results from an experimental study conducted to evaluate the performance of the proposed heuristic and to compare the A* approach with a classic local search procedure. The results show that the proposed heuristic is efficient as A* is able to reach optimal solutions for instances that are not always solved to optimality with the local search procedure; even running for a larger timespa
dc.description.sponsorshipThis work has been supported by the Spanish Ministry of Science and Education under research project MEC-FEDER TIN2007-67466-C02-01spa
dc.language.isoengspa
dc.publisherAssociation for the Advancement of Artificial Intelligencespa
dc.relation.ispartofCOPLAS 2008 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems. (ICAPS 2008)spa
dc.rights© 2008 Association for the Advancement of Artificial Intelligence
dc.rightsCC Reconocimiento - No comercial - Sin obras derivadas 4.0 Internacional
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectHeuristic searchspa
dc.subjectJob shop schedulingspa
dc.subjectTotal flow timespa
dc.titleA new admissible heuristic for the job shop scheduling problem with total flow timeeng
dc.typeconference outputspa
dc.relation.projectIDMEC-FEDER/TIN2007-67466-C02-01spa
dc.rights.accessRightsopen accessspa
dc.type.hasVersionAM


Ficheros en el ítem

untranslated

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

Mostrar el registro sencillo del ítem

© 2008 Association for the Advancement of Artificial Intelligence
Este ítem está sujeto a una licencia Creative Commons