期刊名称：JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)
印刷版ISSN：2251-9904
出版年度：2012
卷号：5
期号：10
页码：55-63
语种：English
出版社：ISLAMIC AZAD UNIVERSITY, QAZVIN BRANCH
摘要：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
