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 schedulin...

nowadays organization especially r&d; centers are dealing with project portfolio selection decisions under uncertainty. moreover in the most of the past research, project portfolio selection and scheduling are often considered to be independent problem. this leads to insufficient result in real world. so in this research simultaneous project portfolio selection and scheduling problem is modelin...

in this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the p-mmrcpsp while due dates are included i...

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).&#10In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...

The resource-constrained project scheduling problem is to find a schedule that minimizes the project duration subject to precedence relations and resource constraints. To further account for economic aspects of the project, one may add an objective of cash nature to the problem. In addition, dynamic nature and variations in real world are known to introduce uncertainties into data. Therefore, t...

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...

in this paper, a fully informed particle swarm (fips) algorithm is proposed for solving the multi-mode resource-constrained project scheduling problem (mrcpsp) with minimization of project makespan as the objective subject to resource and precedence constraints. in the proposed fips, a random key and the related mode list (ml) representation scheme are used as encoding schemes and the multi-mod...

due to project evaluation complexity and resource constraints, the project portfolio optimization is numerous decision making challenges. hence, many researches have been done to introduce model and methods for portfolio optimization. but most of them have not considered the interaction between projects. considering the interactions between projects increase complexity of portfolio optimization...