Browsing Organización Industrial y Gestión de Empresas I by Subject "Heuristics"
Now showing items 1-17 of 17
-
Article
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 ...
-
Article
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 ...
-
Article
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 ...
-
Article
Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation
(Elsevier, 2022-06)In this paper, we address the assembly flowshop scheduling problem, which is a generalisation of two well-known scheduling ...
-
Article
Comparison of heuristics for flowtime minimisation in permutation flowshops
(Elsevier, 2005)In this paper, we address the problem of sequencing jobs in a permutation flow shop with the objective of minimising the ...
-
Article
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 ...
-
Article
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 ...
-
Article
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 ...
-
Article
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 ...
-
Article
New approximate algorithms for the customer order scheduling problem with total completion time objective
(Elsevier, 2017-02)In this paper, we study a customer order scheduling problem where a number of orders, composed of several product types, ...
-
Article
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 ...
-
Article
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 ...
-
Article
Permutation flowshop scheduling with periodic maintenance and makespan objective
(Elsevier, 2020-05)In this paper, we address the permutation flowshop scheduling problem with cyclical unavailability periods where no operation ...
-
Article
Single machine scheduling with periodic machine availability
(Elsevier Ltd, 2018-09)In this paper we address the problem of scheduling jobs on a single machine with cyclical machine availability periods. ...
-
Article
Single machine scheduling with periodic machine availability
(Elsevier, 2018-09)In this paper we address the problem of scheduling jobs on a single machine with cyclical machine availability periods. ...
-
Article
The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
(Elsevier, 2017-12)In this paper, we address the 2-stage assembly scheduling problem where there are m machines in the first stage to manufacture ...
-
Article
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 ...