Preemptiv e scheduling with precedences and alternative resources

This paper presents a search algorithm solving an elastic scheduling problem with alternative resources, where a feasible schedule with minimal costs on resources is demanded. The proposed technique is based on detecting "problematic" precedence constraints deflned between activities processed on difierent resources. Assignment of alternative resources is realized as an extension of the search algorithm using overload checking. Preliminary experimental results show, that the proposed technique works well for problems with a smaller number of precedence constraints.