Buscar
Mostrando ítems 1-8 de 8
Artículo
NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness
(Elsevier, 2015)
Since Johnson׳s seminal paper in 1954, scheduling jobs in a permutation flowshop has been receiving the attention of hundreds of practitioners and researchers, being one of the most studied topics in the Operations Research ...
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 new set of high-performing heuristics to minimize flowtime in permutation flowshops
(Elsevier, 2015)
This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of total completion time minimisation. Since this problem is known to be NP-hard, most research has focussed on obtaining ...
Artículo
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
(Elsevier, 2014-05)
The most efficient approximate procedures so far for the flowshop scheduling problem with makespan objective – i.e. the NEH heuristic and the iterated greedy algorithm – are based on constructing a sequence by iteratively ...
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
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 ...
Artículo
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
(Elsevier, 2015)
This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation subject to a maximum allowed tardiness for the jobs, a problem that combines two desirable manufacturing ...
Artículo
The distributed permutation flow shop to minimise the total flowtime
(Elsevier Ltd, 2018-04)
In the last years, researchers are paying special attention to scheduling in distributed environments due to the increasing benefits of multi-factory manufacture. In this paper, we address the distributed permutation ...