Buscar
Mostrando ítems 1-3 de 3
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
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
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 ...