Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
Ribas, I.; Companys , R.
Tipus d'activitat
Document cientificotècnic
Data
2016-04-11
Repositori
http://hdl.handle.net/2117/87311 Obrir en finestra nova
Resum
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 pape...
Citació
Ribas, I., Companys , R. "Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem". 2016.
Paraules clau
Distributed blocking flow shop, blocking flow shop, distributed permutation flow shop, heuristics
Grup de recerca
SCOM - Supply Chain and Operations Management

Participants

Arxius