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.
Tipo Pubblicazione:
Contributo in atti di convegno
Publisher:
Springfield, Amsterdam , Paesi Bassi
Source:
ECAI 2010 - 19th European Conference on Artificial Intelligence., pp. 967–968, Lisbon, Portugal, August 16-20, 2010
Date:
2010
Resource Identifier:
http://www.cnr.it/prodotto/i/343102
https://dx.doi.org/10.3233/978-1-60750-606-5-967
info:doi:10.3233/978-1-60750-606-5-967
urn:isbn:978-1-60750-605-8
Language:
Eng
ISTC Author:
