Show simple item record

Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

dc.contributor.authorGonzález Fernández, Miguel Ángel 
dc.contributor.authorRodríguez Vela, María del Camino 
dc.contributor.authorGonzález Rodríguez, Inés 
dc.contributor.authorVarela Arias, José Ramiro 
dc.date.accessioned2013-01-30T10:06:03Z
dc.date.available2013-01-30T10:06:03Z
dc.date.issued2013
dc.identifier.citationJournal of Intelligent Manufacturing, 24(4), p. 741-754 (2013); doi:10.1007/s10845-011-0622-5spa
dc.identifier.issn0956-5515
dc.identifier.urihttp://hdl.handle.net/10651/8055
dc.description.abstractWe tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search algorithm. To assess the performance of this algorithm, we present the results of an extensive experimental study, including an analysis of the tabu search algorithm under different running conditions and a comparison with the state-of-the-art algorithms. The experiments are performed across two sets of conventional benchmarks with 960 and 17 instances respectively. The results demonstrate that the proposed tabu search algorithm is superior to the state-of-the-art methods both in quality and stability. In particular, our algorithm establishes new best solutions for 817 of the 960 instances of the first set and reaches the best known solutions in 16 of the 17 instances of the second set
dc.format.extentp. 741-754spa
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofJournal of Intelligent Manufacturing, 24(4)spa
dc.rights© Springer
dc.titleLateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup timesspa
dc.typeinfo:eu-repo/semantics/article
dc.identifier.local20120189spa
dc.identifier.doi10.1007/s10845-011-0622-5
dc.type.dcmitextspa
dc.relation.publisherversionhttp://dx.doi.org/10.1007/s10845-011-0622-5


Files in this item

untranslated

This item appears in the following Collection(s)

Show simple item record