Buscar
Mostrando ítems 1-3 de 3
Artículo
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
(Elsevier, 2017)
The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many production ...
Artículo
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
(Elsevier, 2017)
In this paper we present a beam-search-based constructive heuristic to solve the permutation flowshop scheduling problem with total flowtime minimisation as objective. This well-known problem is NP-hard, and several ...
Artículo
Reduction of permutation flowshop problems to single machine problems using machine dominance relations
(Elsevier, 2017)
The Permutation Flowshop Scheduling Problem with Makespan objective (PFSP-M) is known to be NP-hard for more than two machines, and literally hundreds of works in the last decades have proposed exact and approximate ...