Constraint Programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in the area of projects portfolio prototyping. The paper deals with multi-resource and multi-criteria problem in which more than one shared renewable resource type may be required by manufacturing operation and the availability of each type is time-windows limited. The problem belongs to a class of NP-complete ones. The aim of the paper is to present a knowledge based and CP-driven approach to resource allocation conflicts resolution framework.

Proposed framework stands behind a methodology aimed at task oriented DSS tolls designing. The Portfolio Project Prototyping System designed due to this methodology provides a prompt and interactive service to a set of routine queries

stated both in straight and reverse way. Multiple illustrative examples are discussed.