in this paper, a new genetic algorithm (ga) is presented 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. a random key and the related mode list (ml) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (mssg...

Resource Constrained Project Scheduling Problem (RCPSP) is the most general scheduling problem. Job shop scheduling, flow shop scheduling and other scheduling problems are the subsets of RCPSP. The present paper examines the multimode multi-objective resource constrained project scheduling problem (RCPSP) with partial precedence relations. To enhance the practical aspects of this prominent prob...

This study presents and evaluates a modified ant colony optimization (ACO) approach for the resource-constrained project scheduling problems. A modified ant colony system is proposed to solve the resource-constrained scheduling problems. A two-dimensional matrix is proposed in this study for scheduling activities with time, and it has a parallel scheme for solving project scheduling problems. T...

This paper presents a hybrid heuristic for constrained resource allocation in PERT type networks. Here, the assumption is made that the constrained resource is renewable for allocation to the activities of project. In addition, we consider finish-start precedence constraints with zero time lag. The activities durations are independent continuous random variables, preemption is not allowed and r...

The project scheduling and resource allocation problems have been studied using different optimization methods. The resource leveling problem was proposed to reduce the resource fluctuation and was always studied independently resource constraint problem. For example, resource-constrained project scheduling problem (RCPSP) was proposed to optimize scheduling under resource constraints. This res...

In practice, organizations work in general on more than one project which share some or all the available resources. In this work hybrid heuristics that combine Random Sampling heuristics and Backward-Forward methods are developed for the Resource-Constrained Multi-Project Scheduling Problem (RCMPSP). This heuristic approach has been successfully applied to resource-constrained single project s...

We propose a novel approach to compute bounds on the objective function value of a wide class of resource-constrained project scheduling problems. The basis is a polynomial-time algorithm to solve the following scheduling problem: Given a set of activities with start-time dependent costs and temporal constraints in the form of time windows, find a feasible schedule of minimum total cost. Motiva...