Buscar
Mostrando ítems 11-20 de 21
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 ...
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
Integrated Project Scheduling and Staff Assignment with Controllable Processing Times
(Hindawi Publishing Corporation, 2014)
This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employeeswith certain ...
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 ...
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
Deterministic Assembly Scheduling Problems: A Review and Classification of Concurrent-Type Scheduling Models and Solution Procedures
(Elsevier, 2019-03)
Many activities in industry and services require the scheduling of tasks that can be concurrently executed, the most clear example being perhaps the assembly of products carried out in manufacturing. Although numerous ...