Multi-Mode Resource Constrained Multi-Project Selecting and Scheduling Problem to Maximize Net Present Value

In this article, with the aim of maximizing net present value and considering various ways of the payment, the problem of selecting and scheduling several projects using mathematical programming and constraint programming have been investigated, in a way that the project feasibility with regards to the level of available resources is guaranteed and all of the prerequisite relationships are observed. Activities with the different modes of resources can be done. They uses renewable (human resources, equipment) and non-renewable (raw materials, budgets) resources. In calculating the costs, the overtime cost of renewable resources, late penalties or rewards of delivery before the project due date is considered. Created Models are tested by a number of projects from the PSPLIB libraries.