Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Efficient heuristics for the parallel blocking flow shop scheduling problem

Autor
Ribas, I.; Companys , R.; Tort-Martorell, J.
Tipus d'activitat
Article en revista
Revista
Expert systems with applications
Data de publicació
2017-05-15
Volum
74
Pàgina inicial
41
Pàgina final
54
DOI
https://doi.org/10.1016/j.eswa.2017.01.006 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/100670 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0957417417300064 Obrir en finestra nova
Resum
We consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint. The applied criterion is to minimize the makespan, i.e., the maximum completion time of all the jobs in F flow shops (lines). The Parallel Flow Shop Scheduling Problem (PFSP) is conceptually similar to another problem known in the literature as the Distributed Permutation Flow Shop Scheduling Problem (DPFSP), which allows mod...
Citació
Ribas, I., Companys , R., Tort-Martorell, J. Efficient heuristics for the parallel blocking flow shop scheduling problem. "Expert systems with applications", 15 Maig 2017, vol. 74, p. 41-54.
Paraules clau
Blocking flow shop, Distributed permutation flow shop, Parallel flow shop, Scheduling
Grup de recerca
ADBD - Anàlisi de Dades Complexes per a les Decisions Empresarials
SCOM - Supply Chain and Operations Management

Participants