Buscar
Mostrando ítems 1-2 de 2
Artículo
Efficient heuristics for the hybrid flow shop scheduling problem with missing operations
(Elsevier, 2019)
In this paper, we address the hybrid flowshop scheduling problem for makespan minimisation. More specifically, we are interested in the special case where there are missing operations, i.e. some stages are skipped, a ...
Artículo
Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness
(Elsevier, 2016)
In this paper we address the problem of scheduling jobs in a permutation flowshop with a just-in-time objective, i.e. the minimisation of the sum of total tardiness and total earliness. Since the problem is NP-hard, there ...