Buscar
Mostrando ítems 11-20 de 34
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 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
A review and classification of computer-based manufacturing scheduling tools
(Elsevier, 2016)
Computer-based manufacturing scheduling tools can play a key role in the management of industrial operations, as obtaining economic and reliable schedules is at the core of excellence in customer service and of efficiency ...
Artículo
Guidelines for the deployment and implementation of manufacturing scheduling systems
(Taylor & Francis, 2011)
It has frequently been stated that there exists a gap between production scheduling theory and practice. In order to put theoretical findings into practice, advances in scheduling models and solution procedures should be ...
Artículo
Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times
(Elsevier, 2019-05)
This work considers a scheduling problem identified in a factory producing customised Heating, Ventilation and Air Conditioning (HVAC) equipment. More specifically, the metal folding section is modelled as unrelated parallel ...
Artículo
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimize total flowtime
(Elsevier, 2016)
This paper focuses on the blocking flow shop scheduling problem with the objective of total flowtime minimisation. This problem assumes that there are no buffers between machines and, due to its application to many ...
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
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
(Taylor & Francis, 2014)
As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by ...
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 ...
Artículo
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 which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the ...