CP-based decision support for scheduling

The paper presents the declarative approach to design of a reference model aimed at project prototyping. The reference model contains the finite set of decision variables, their domains and linking those constraints, i.e. can be seen as a kind of Constraint Satisfaction Problem. Consequently, the model considered can be treated as a knowledge base specifying both a class of enterprises and the projects that could be conducted on their base. So, the model provides a platform for rapid prototyping of alternative versions of project scheduling. The routine queries can be formulated in the straight or reverse way. In that context, the proposed reference model can be implemented in constraint programming (CP) techniques