A backtracking algorithm for solving mixed task scheduling and resource allocation problems

This paper addresses the solving of mixed Task Scheduling and Resource Allocation Problems in an integrated way using a backtracking algorithm. Several ordering heuristics are proposed to improve the efficiency of this algorithm. Experiments show the impact of these heuristics on the quality of the first solution obtained. We also compare our integrated approach with a sequential solving of scheduling and allocation problems.