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

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.