An Exact Algorithm for the Mode Identity Project Scheduling Problem
الموضوعات :Behrouz Afshar Nadjafi 1 , Amir Rahimi 2 , Hamid Karimi 3
1 - Assistant Professor, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
2 - MSc, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
3 - MSc, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
الکلمات المفتاحية: Project Scheduling, Resource Constrained, Branch and Bound, Mode-Identity, Multi-Mode,
ملخص المقالة :
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) withmode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to beprocessed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project scheduling problemwith mode identity. The proposed algorithm is extended with some bounding rules to reduce the size of branch and bound tree. Finally,some test problems are solved and their computational results are reported.
