Show simple item record

Combining neighbourhoods in fuzzy job shop problems

dc.contributor.authorPuente Peinador, Jorge 
dc.contributor.authorRodríguez Vela, María del Camino 
dc.contributor.authorGonzález Rodríguez, Inés 
dc.date.accessioned2013-01-30T10:05:24Z
dc.date.available2013-01-30T10:05:24Z
dc.date.issued2011
dc.identifier.citationAdvances in Artificial Intelligence, p. 343-352 (2011); doi:10.1007/978-3-642-25274-7_35spa
dc.identifier.isbn978-3-642-25273-0
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/10651/7924
dc.descriptionConference of the Spanish Association for Artificial Intelligence, CAEPIA 2011(14th. 2011. La Laguna, Spain)
dc.description.abstractIn the sequel, we propose a new neighbourhood structure for local search for the fuzzy job shop scheduling problem, which is a variant of the well-known job shop problem, where uncertain durations are modelled as fuzzy numbers and the objective is to minimise the expected makespan of the resulting schedule. The new neighbourhood structure is based on changing the position of a task in a critical block. We provide feasibility conditions and a makespan estimate which allows to select only feasible and promising neighbours. The experimental results illustrate the success of our proposal in reducing expected makespan within a memetic algorithm. The experiments also show that combining the new structure with an existing neighbourhood from the literature considering both neighborhoods at the same time, provides the best results
dc.description.sponsorshipAll authors are supported by MEC-FEDER Grant TIN2010-20976-C02-02
dc.format.extentp. 343-352spa
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofAdvances in Artificial Intelligencespa
dc.relation.ispartofseriesLecture Notes in Computer Science;7023
dc.rights© 2011 Springer
dc.titleCombining neighbourhoods in fuzzy job shop problemsspa
dc.typeinfo:eu-repo/semantics/bookPart
dc.identifier.local20111662spa
dc.identifier.doi10.1007/978-3-642-25274-7_35
dc.type.dcmitextspa
dc.relation.projectIDMEC-FEDER/TIN2010-20976-C02-02
dc.relation.publisherversionhttp://dx.doi.org/10.1007/978-3-642-25274-7_35spa


Files in this item

untranslated

This item appears in the following Collection(s)

Show simple item record