Show simple item record

dc.contributor.authorRibas Vila, Immaculada
dc.contributor.authorCompanys Pascual, Ramón
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.date.accessioned2015-06-19T07:58:13Z
dc.date.available2018-09-01T00:30:25Z
dc.date.created2015-05-01
dc.date.issued2015-05-01
dc.identifier.citationRibas, I.; Companys , R. Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. "Computers and industrial engineering", 01 Maig 2015, vol. 87, p. 30-39.
dc.identifier.issn0360-8352
dc.identifier.urihttp://hdl.handle.net/2117/28346
dc.description.abstractThis paper proposes two constructive heuristics, i.e. HPF1 and HPF2, for the blocking flow shop problem in order to minimize the total flow time. They differ mainly in the criterion used to select the first job in the sequence since, as it is shown, its contribution to the total flow time is not negligible. Both procedures were combined with the insertion phase of NEH to improve the sequence. However, as the insertion procedure does not always improve the solution, in the resulting heuristics, named NHPF1 and NHPF2, the sequence was evaluated before and after the insertion to keep the best of both solutions. The structure of these heuristics was used in Greedy Randomized Adaptive Search Procedures (GRASP) with variable neighborhood search in the improvement phase to generate greedy randomized solutions. The performance of the constructive heuristics and of the proposed GRASPs was evaluated against other heuristics from the literature. Our computational analysis showed that the presented heuristics are very competitive and able to improve 68 out of 120 best known solutions of Taillard’s instances for the blocking flow shop scheduling problem with the total flow time criterion
dc.format.extent10 p.
dc.language.isoeng
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.otherScheduling
dc.subject.otherFlow shop
dc.subject.otherBlocking
dc.subject.otherTotal flow time
dc.subject.otherHeuristics
dc.titleEfficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization
dc.typeArticle
dc.subject.lemacHeurística
dc.contributor.groupUniversitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
dc.identifier.doi10.1016/j.cie.2015.04.013
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S036083521500162X
dc.rights.accessOpen Access
local.identifier.drac16376674
dc.description.versionPostprint (author’s final draft)
local.citation.authorRibas, I.; Companys , R.
local.citation.publicationNameComputers and industrial engineering
local.citation.volume87
local.citation.startingPage30
local.citation.endingPage39


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

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