ss as: Af King Sa Abstract Extensive research has been devoted to resource constrained project scheduling problem (RCPSP). Resources are renewable and there is a unique way to perform the activities. This work develops a population based evolutionary algorithm namely differential evolution (DE) to schedule project activities to minimize makespan subject to precedence constraints and resources a...

Resource Constrained Project Scheduling Problem (RCPSP) is a well known problem that is easy to describe but very difficult to solve, and therefore, it has attracted the attention of many researchers over the last few decades. In this context, heuristics are the only option when solving realistically-sized projects. In this paper we develop a steady-state genetic algorithm that uses a dynamic p...

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

This paper presents an experimental investigation of the Sounds of Silence (SoS) harmony search metaheuristic for the multi-mode resource-constrained project scheduling problem (MRCPSP) using a pre-optimized starting repertoire. The presented algorithm is based on the time oriented version of the SoS harmony search metaheuristic developed by Csébfalvi et al. [1] for the single-mode resource-con...

Now-a-days different meta-heuristic approaches, their variants and hybrids are being applied for solving Combinatorial Optimization Problems (COP). In this paper Resource Constrained Project Scheduling Problem (RCPSP) has been presented as a COP. This is a common problem for many construction projects. It is highly constrained and is categorized as a NP-hard problem. In our earlier work Simulat...

Resource-constrained project scheduling is an NPhard optimisation problem. There are many different heuristic strategies how to shift activities in time when resource requirements exceed their available amounts. These strategies are frequently based on priorities of activities. In this paper, we assume that a suitable heuristic has been chosen to decide which activities should be performed imme...

A composition arranges available services resulting in a defined flow of executions. Before the composition is carried out, a discovery service identifies candidate services. Then, a selection process chooses the optimal candidates. This paper discusses how the selection can consider different Quality-of-Service (QoS) categories as selection criteria to select the most suitable candidates for t...

This paper presents using policy tree and estimation of distribution algorithms (EDAs) to solve resource-constrained project scheduling problem (RCPSP) with considering rework with probability. Firstly, the algorithm adopts policy tree to model the project scheduling problem, which contains decision variables, stochastic variables and precedence relations, trying to make proactive scheduling an...

Scheduling problems have been studied a lot over the last decade. Due to the complexity and the variety of such problems, most works consider static problems in which activities are known in advance and constraints are fixed. However, every scheduling problem is subject to unexpected events (consider for example a new activity to schedule, or a machine breakdown). In these cases, a new solution...

This paper proposes a Genetic Algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). Resources are renewable and there is a unique way to perform the activities. This work employs Genetics Algorithms to schedule project activities to minimize makespan subject to precedence constraints and resources availability. A serial generation scheme is used to obtain the schedule. The ...