Show simple item record

dc.contributor.authorRibas Vila, Immaculada
dc.contributor.authorCompanys Pascual, Ramón
dc.contributor.authorTort-Martorell Llabrés, Xavier
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
dc.date.accessioned2013-06-25T07:30:25Z
dc.date.created2013-04-27
dc.date.issued2013-04-27
dc.identifier.citationRibas, I.; Companys , R.; Tort-martorell, J. An efficient iterated local search algorithm for the total tardiness blocking flow shop problem. "International journal of production research", 27 Abril 2013, p. 1-16.
dc.identifier.issn0020-7543
dc.identifier.urihttp://hdl.handle.net/2117/19622
dc.description.abstractThis paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimisation. The proposed ILS makes use of a NEH-based procedure to generate the initial solution, and uses a local search to intensify the exploration that combines the insertion and swap neighbourhood and uses a perturbation mechanism consisting of three neighbourhood operators to diversify the search. The computational evaluation has shown the effectiveness of combining the insertion and swap neighbourhood during the search despite the insertion neighbourhood being more effective than the swap neighbourhood for this problem. Finally, the computation of this algorithm when evaluated against two other algorithms from the literature shows good performance.
dc.format.extent16 p.
dc.language.isoeng
dc.publisherTaylor & Francis
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses
dc.subject.lcshHeuristic algorithms
dc.subject.otherblocking flow shop
dc.subject.otherscheduling
dc.subject.othertardiness
dc.subject.otheriterated local search
dc.subject.othervariable local search
dc.subject.otherheuristics
dc.titleAn efficient iterated local search algorithm for the total tardiness blocking flow shop problem
dc.typeArticle
dc.subject.lemacHeurística
dc.contributor.groupUniversitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
dc.contributor.groupUniversitat Politècnica de Catalunya. GRESA - Grup de recerca en estadística aplicada
dc.identifier.doi10.1080/00207543.2013.802390
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://dx.doi.org/10.1080/00207543.2013.802390
dc.rights.accessRestricted access - publisher's policy
drac.iddocument12532023
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
upcommons.citation.authorRibas, I.; Companys , R.; Tort-martorell, J.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameInternational journal of production research
upcommons.citation.startingPage1
upcommons.citation.endingPage16


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain