An Exact Algorithm for the Mode Identity Project Scheduling Problem

محورهای موضوعی : Design of Experiment

Behrouz Afshar Nadjafi ¹ , Amir Rahimi ² , Hamid Karimi ³

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

تاریخ دریافت : 1390/04/11 تاریخ پذیرش : 1390/12/18 تاریخ انتشار : 1390/12/25

کلید واژه: 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.