An Exact Algorithm for the Mode Identity Project Scheduling Problem

Journal of Optimization in Industrial Engineering

مقاله 7، دوره 5، شماره 10، خرداد 2012، صفحه 55-63   

نوع مقاله: Original Manuscript

نویسندگان

Behrouz Afshar Nadjafi^{* 1}؛ Amir Rahimi²؛ Hamid Karimi²

¹Assistant Professor, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

²MSc, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

چکیده

In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project scheduling problem with 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.

کلیدواژه‌ها

Project Scheduling؛ Branch and Bound؛ Mode-Identity؛ Multi-Mode؛ Resource Constrained