This work describes a novel approach towards solving Multimode Resource Constrained Project Scheduling (MRCPS) Problems and an algorithm developed to implement this approach. The algorithm is intended to be used as an alternative to the various genetic algorithms currently being used to solve such problems. Using a deterministic approach that aims to select the optimum modes for execution as ef...

Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...

This abstract introduces a novel approach to intelligently select appropriate modes for each activity in the multi mode resource constrained project scheduling problem. The mode of an activity determines its duration and the resources that it requires. In order to obtain a good (or optimal) makespan, finding an appropriate mode for each activity is most important. The approach integrates differ...

In this paper we describe an extension of the Resource-Constrained Project Scheduling Problem (RCPSP). A literature review is presented to place our research in its proper context. The problem presented here belongs to the class of the optimization scheduling problems with multi-level (or multi-mode) activities. This means that the activities can be scheduled at different modes, each mode using...

In this work we present a multi-neighborhood, parallel local search approach for the Multi-Mode Resource-Constrained Multi-Project Scheduling Problem (MMRCMPSP). The search in multiple neighborhoods is conducted in parallel with dynamic load balancing among processors. Our solver works with an indirect solution representation and navigates through space of the feasible solutions by combining he...

In this work we present a multi-neighborhood, parallel local search approach for the Multi-Mode Resource-Constrained Multi-Project Scheduling Problem (MMRCMPSP). The search in multiple neighborhoods is conducted in parallel with dynamic load balancing among processors. Our solver works with an indirect solution representation and navigates through space of the feasible solutions by combining he...

the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...

Resource constrained project scheduling problem is one of the most important issues in project planning and management. The objective function of this problem is to minimize the completion time of a project. When there is budget constraint or high risk for investment, using the criteria such as cash flows is so important. The development of computer systems and processors makes it possible to t...

In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...