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
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
A common framework and taxonomy for multicriteria scheduling problems with Interfering and competing Jobs: Multi-agent scheduling problems
(2014)
Most classical scheduling research assumes that the objectives sought are common to all jobs to be scheduled. However, many real-life applications can be modeled by considering different sets of jobs, each one with its ...