Abstract. Elastic scheduling with alternative resources and precedence constraints is described in this paper. Each activity has defined a time window, in which the whole activity must be processed. The goal is to find a schedule minimizing costs on resources. First a special case of the problem is introduced, which deals only with one resource in the schedule. After that a model with more resources is introduced, where each activity has assigned exactly one resource. For this problem no polynomial algorithm is known. Finally a constraint satisfaction optimization model for alternative resources is described. This model uses constraint programming techniques such as edge finding and alternative resources modeling
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.