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.accessioned2017-02-08T11:54:07Z
dc.date.available2019-05-15T00:30:20Z
dc.date.issued2017-05-15
dc.identifier.citationRibas, I., Companys , R., Tort-Martorell, J. Efficient heuristics for the parallel blocking flow shop scheduling problem. "Expert systems with applications", 15 Maig 2017, vol. 74, p. 41-54.
dc.identifier.issn0957-4174
dc.identifier.urihttp://hdl.handle.net/2117/100670
dc.description.abstractWe consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint. The applied criterion is to minimize the makespan, i.e., the maximum completion time of all the jobs in F flow shops (lines). The Parallel Flow Shop Scheduling Problem (PFSP) is conceptually similar to another problem known in the literature as the Distributed Permutation Flow Shop Scheduling Problem (DPFSP), which allows modeling the scheduling process in companies with more than one factory, each factory with a flow shop configuration. Therefore, the proposed methods can solve the scheduling problem under the blocking constraint in both situations, which, to the best of our knowledge, has not been studied previously. In this paper, we propose a mathematical model along with some constructive and improvement heuristics to solve the parallel blocking flow shop problem (PBFSP) and thus minimize the maximum completion time among lines. The proposed constructive procedures use two approaches that are totally different from those proposed in the literature. These methods are used as initial solution procedures of an iterated local search (ILS) and an iterated greedy algorithm (IGA), both of which are combined with a variable neighborhood search (VNS). The proposed constructive procedure and the improved methods take into account the characteristics of the problem. The computational evaluation demonstrates that both of them –especially the IGA– perform considerably better than those algorithms adapted from the DPFSP literature.
dc.format.extent14 p.
dc.language.isoeng
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.lcshMathematical optimization
dc.subject.lcshOperations research
dc.subject.otherParallel flow shop
dc.subject.otherDistributed permutation flow shop
dc.subject.otherBlocking flow shop
dc.subject.otherScheduling
dc.titleEfficient heuristics for the parallel blocking flow shop scheduling problem
dc.typeArticle
dc.subject.lemacOptimització matemàtica
dc.subject.lemacInvestigació operativa
dc.subject.lemacProducció -- Control
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. ADBD - Anàlisi de Dades Complexes per a les Decisions Empresarials
dc.identifier.doi10.1016/j.eswa.2017.01.006
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0957417417300064
dc.rights.accessOpen Access
local.identifier.drac19668131
dc.description.versionPostprint (author's final draft)
local.citation.authorRibas, I.; Companys, R.; Tort-Martorell, J.
local.citation.publicationNameExpert systems with applications
local.citation.volume74
local.citation.startingPage41
local.citation.endingPage54


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record