The main result of the paper is the reduction of the RCPSP/max problem to a Disjunctive Temporal Problem that allows customization of specific properties within a backtracking search procedure for makespan optimization. In addition, a branching strategy is proposed able to deduce new constraints which explicitly represent infeasible or useless search paths. A new variable ordering heuristic (called clustering) is also used which provides a further boosting to the algorithm's effectiveness.
Project Scheduling as a Disjunctive Temporal Problem
Contributo in atti di convegno
Springfield, Amsterdam , Paesi Bassi
ECAI 2010 - 19th European Conference on Artificial Intelligence., pp. 967–968, Lisbon, Portugal, August 16-20, 2010