Buscar
Mostrando ítems 1-10 de 34
Artículo
Constructive and composite heuristics for the 2-stage assembly scheduling problem with periodic maintenance and makespan objective
(Elsevier, 2022-11-15)
This paper addresses the 2-stage assembly scheduling problem to minimise makespan with availability constraints, where the machines are not always available due to periodic maintenance activities. To the best of our ...
Artículo
Exploring the benefits of scheduling with advanced and real-time information integration in Industry 4.0: A computational study
(Elsevier, 2022-05)
The technological advances recently brought to the manufacturing arena (collectively known as Industry 4.0) offer huge possibilities to improve decision-making processes in the shop floor by enabling the integration of ...
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
New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem
(Elsevier, 2020-02)
In this paper, we address the two-stage multi-machine assembly scheduling problem, a layout consisting of several dedicated parallel machines in the first stage and identical parallel machines in the second stage. The ...
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
Comparison of heuristics for rescheduling in permutation flowshops
(ADINGOR, 2009)
Rescheduling is one of the main consequences of the variability in the shop floor, as a number of unforeseeable disruptions make impossible to follow the original schedule. In this paper we study a flowshop rescheduling ...
Artículo
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
(Elsevier, 2019)
In this paper we address the classical hybrid flow shop scheduling problem with makespan objective. As this problem is known to be NP-hard and a very common layout in real-life manufacturing scenarios, many studies have ...
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 ...