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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Correspondence to: Massimiliano Caramia
We wish to thank the anonymous referees for their useful comments which have led to this improved version of the paper.
Rights and permissions
About this article
Cite this article
Caramia, M., Dell'Olmo, P. Assessing the resource usage in scheduling with incompatibilities. OR Spectrum 25, 521–547 (2003). https://doi.org/10.1007/s00291-003-0138-2
Issue Date:
DOI: https://doi.org/10.1007/s00291-003-0138-2