Show simple item record

A new local search for the job shop problem with uncertain durations

dc.contributor.authorGonzález Rodríguez, Inés 
dc.contributor.authorRodríguez Vela, María del Camino 
dc.contributor.authorPuente Peinador, Jorge 
dc.contributor.authorVarela Arias, José Ramiro 
dc.date.accessioned2015-07-13T07:16:26Z
dc.date.available2015-07-13T07:16:26Z
dc.date.issued2008
dc.identifier.urihttp://hdl.handle.net/10651/31590
dc.description.abstractIn the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local search, based on a new definition of critical path for fuzzy durations. A theoretical analysis of the proposed structure shows that it improves a previous one from the literature. It also shows that feasibility and connectivity hold, these being two highly desirable properties. Experimental results are reported which further illustrate the potential of the proposalspa
dc.format.extentp. 124-131spa
dc.language.isoengspa
dc.publisherAssociation for the Advancement of Artificial Intelligence (AAAI)spa
dc.relation.ispartofProceedings of the Eighteenth International Conference on Automated Planning and Scheduling (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.titleA new local search for the job shop problem with uncertain durationseng
dc.typeinfo:eu-repo/semantics/conferenceObjectspa
dc.type.dcmitextspa
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessspa


Files in this item

untranslated

This item appears in the following Collection(s)

Show simple item record

© 2008 Association for the Advancement of Artificial Intelligence
This item is protected with a Creative Commons License