Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Comparing three-step heuristics for the permutation flow shop problem

Autor
Ribas, I.; Companys, R.; Tort-Martorell, J.
Tipus d'activitat
Article en revista
Revista
Computers & operations research
Data de publicació
2010-03-03
DOI
https://doi.org/10.1016/j.cor.2010.02.006 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/6755 Obrir en finestra nova
Resum
In this paper a three steps heuristic for the permutation flow shop problem is proposed. The objective is to minimize the maximum time for completing the jobs, or the makespan. The first two steps are inspired by the NEH heuristic, to which a new tie breaking strategy has been incorporated in the insertion phase. Furthermore, the reversibility property of the problem dealt with is taken as a tool for improving the obtained solution. The third step consists of an iterated local search procedure w...
Citació
Ribas, I.; Companys, R.; Tort-Martorell, J. Comparing three-step heuristics for the permutation flow shop problem. "Computers and operations research", 03 Març 2010.
Grup de recerca
ADBD - Anàlisi de Dades Complexes per a les Decisions Empresarials

Participants