Buscar
Mostrando ítems 1-2 de 2
Artículo
A speed-up procedure for the hybrid flow shop scheduling problem
(Elsevier Ltd, 2021)
During the last decades, hundreds of approximate algorithms have been proposed in the literature addressing flow-shop-based scheduling problems. In the race for finding the best proposals to solve these problems, speedup ...
Artículo
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics
(Elsevier, 2018)
This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the ...