Show simple item record

Improved local search for job shop scheduling 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.authorHernández Arauzo, Alejandro 
dc.date.accessioned2015-07-10T11:04:34Z
dc.date.available2015-07-10T11:04:34Z
dc.date.issued2009
dc.identifier.urihttp://hdl.handle.net/10651/31585
dc.identifier.urihttp://www.aaai.org/ocs/index.php/ICAPS/ICAPS09/paper/viewFile/738/1106spa
dc.description.abstractThis paper is concerned with local search methods to solve job shop scheduling problems with uncertain durations modelled as fuzzy numbers. Based on a neighbourhood structure from the literature, a reduced set of moves and the consequent structure are defined. Theoretical results show that the proposed neighbourhood contains all the improving solutions from the original neighbourhood and provide a sufficient condition for optimality. Additionally, a makespan lower bound is proposed which can be used to discard neighbours. Experimental results illustrate the good performance of both proposals, which considerably reduce the computational load of the local search, as well as a synergy effect when they are simultaneously usedspa
dc.format.extentp. 154-161spa
dc.language.isoengspa
dc.publisherAssociation for the Advancement of Artificial Intelligence (AAAI)spa
dc.relation.ispartofProceedings of the Nineteenth International Conference on Automated Planning and Schedulingspa
dc.rights© 2009 Association for the Advancement of Artificial Intelligence
dc.titleImproved local search for job shop scheduling with uncertain durationsspa
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