Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization

Autor
Ribas, I.; Companys , R.
Tipus d'activitat
Article en revista
Revista
Computers and industrial engineering
Data de publicació
2015-05-01
Volum
87
Pàgina inicial
30
Pàgina final
39
DOI
https://doi.org/10.1016/j.cie.2015.04.013 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/28346 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S036083521500162X Obrir en finestra nova
Resum
This paper proposes two constructive heuristics, i.e. HPF1 and HPF2, for the blocking flow shop problem in order to minimize the total flow time. They differ mainly in the criterion used to select the first job in the sequence since, as it is shown, its contribution to the total flow time is not negligible. Both procedures were combined with the insertion phase of NEH to improve the sequence. However, as the insertion procedure does not always improve the solution, in the resulting heuristics, n...
Citació
Ribas, I.; Companys , R. Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. "Computers and industrial engineering", 01 Maig 2015, vol. 87, p. 30-39.
Paraules clau
Blocking, Flow shop, Heuristics, Scheduling, Total flow time
Grup de recerca
SCOM - Supply Chain and Operations Management

Participants