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.identifier.citationRibas, I., Companys , R. "Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem". 2016.
dc.descriptionIn this working paper we show the best values found for the Taillard’s benchmark [17] applied to the DBFSP.
dc.description.abstractThe distributed blocking flow shop scheduling problem (DBFSP) allows modeling the scheduling process in companies with more than one factory. It configures production systems as flow shop lines where the blocking constraint must be considered. To the best of our knowledge, this variant of the distributed permutation flow shop scheduling problem has not been studied. In this working paper, we show the best solutions found during our research for the Taillard’s instances adapted to this problem.
dc.format.extent7 p.
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses
dc.subject.lcshSupply chain, logistics and operations management
dc.subject.otherDistributed blocking flow shop
dc.subject.otherblocking flow shop
dc.subject.otherdistributed permutation flow shop
dc.titleBest known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem
dc.typeExternal research report
dc.subject.lemacEmpreses -- Planificació
dc.contributor.groupUniversitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
dc.rights.accessOpen Access
upcommons.citation.authorRibas, I.; Companys, R.

Files in this item


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