Buscar
Mostrando ítems 11-20 de 32
Tesis Doctoral
The 2-stage Assembly Scheduling Problem
(2022-11-22)
Today, manufacturing systems face new global challenges that require flexibility and quick reactions. To remain competitive, companies must also focus on the minimisation of time, as it leads to cost reductions, shorter ...
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 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
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimize total tardiness
(Elsevier, 2018)
The permutation flow shop scheduling problem is one of the most studied operations research related problems. Literally, hundreds of exact and approximate algorithms have been proposed to optimise several objective functions. ...
Artículo
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 can be processed. Under this constraint, all machines must stop at the same time due to the shift ...
Ponencia
Assessing the potential of decentralised scheduling: An experimental study for the job shop case
(Elsevier, 2022)
In this paper we investigate how decentralised scheduling approaches can be used to improve manufacturing scheduling. In view of the potential shown by some of these novel decentralised approaches, we conduct a series ...
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
Controllable Processing Times in Project and Production Management: Analysing the trade-off between processing times and the amount of resources
(Hindawi, 2015)
The amount of resources assigned to a task highly influences its processing time. Traditionally, different functions have been used in the literature in order to map the processing time of the task with the amount of ...