To access the full text documents, please follow this link: http://hdl.handle.net/2117/87311

Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem
Ribas Vila, Immaculada; Companys Pascual, Ramón
Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses; Universitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
In this working paper we show the best values found for the Taillard’s benchmark [17] applied to the DBFSP.
The 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.
Àrees temàtiques de la UPC::Economia i organització d'empreses
Supply chain, logistics and operations management
Distributed blocking flow shop
blocking flow shop
distributed permutation flow shop
heuristics
Empreses -- Planificació
Algorismes
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Article - Draft
Report
         

Show full item record

Related documents

Other documents of the same author

Companys Pascual, Ramón; Ribas Vila, Immaculada
Companys Pascual, Ramón; Ribas Vila, Immaculada; Mateo Doll, Manuel
Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier
 

Coordination

 

Supporters