Proposing a Model on Preemptive Multi-mode Resource-constrained Project Scheduling Problem

In this paper, we present a new mathematical model for a preemptive multi-mode resource-constrained project scheduling problem, in which multiple execution modes are available for each activities of the project. Activities are allowed to be preempted at any time and restarted later at no additional cost. The objective is minimization the makespan. We present computational results for the P-MRCPSP which proves validation of proposed model.