Abstract
In the field of resource constrained scheduling, the papers in the
literature are mainly focused on minimizing the maximum completion
time of a set of tasks to be carried out, paying attention to
respecting the maximum simultaneous availability of each resource
type in the system. This work, instead, considers the issues of
balancing the resource usage and minimizing the peak of the
resources allocated each time in the schedule, while keeping the
makespan low. To this aim we propose a local search algorithm
which acts as a multi start greedy heuristic. Extensive
experiments on various randomly generated test instances are
provided. Furthermore, we present a comparison with lower bounds
and known heuristics.
Anno
2003
Tipo pubblicazione
Altri Autori
Caramia M., Dell;Olmo P.