Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem

Consultar RECERCAT

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/87311

Título:	Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem
Autor/a:	Ribas Vila, Immaculada; Companys Pascual, Ramón
Otros autores:	Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses; Universitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
Abstract:	In this working paper we show the best values found for the Taillard’s benchmark [17] applied to the DBFSP.
Abstract:	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.
Materia(s):	-À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
Derechos:	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Tipo de documento:	Artículo - Borrador Informe
Compartir: