Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem
Tipus de documentReport de recerca
Data publicació2016-04-11
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
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.
Descripció
In this working paper we show the best values found for the Taillard’s benchmark [17] applied to the DBFSP.
CitacióRibas, I., Companys , R. "Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem". 2016.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Best solutions for the DBFSP.pdf | 134,2Kb | Visualitza/Obre | ||
Best solutions for the DBFSP.pdf | best solutions forn Taillard's instances on DBFSP | 134,2Kb | Visualitza/Obre |