Since Resource-Constrained Project Scheduling Problem (RCPSP) is a well-known NP-hard problem, it is difficult to solve large-scale practical cases by using traditional exact algorithms. Genetic algorithm (GA) is a kind of intelligent algorithm for approximate optimization, which can ascertain global optimization or suboptimal solution within a reasonable time. This article presented a new simu...

Resource-constrained project scheduling problem is the traditional optimization problem considering constraint conditions of resource supply, which makes the problem more difficult to solve in real life. Resourceconstrained project scheduling problem is a typical NP-hard problem, which is quite popular issue in recent years. This article firstly analyzes the literature review of resourceconstra...

This paper focuses on estimating maximum resource loads in ResourceConstrained Project Scheduling Problem (RCPSP). We examine a variant of vector sum problem with fractions: considering preemptions allowed, determine what part of each of n jobs should be accomplished in order to minimize sum of squares of non-consumed amounts of resources, taking into account the resource constraints along with...

Project scheduling with uncertain durations becomes a research focus with the development of uncertainty theory. Most researches concerned aim at minimizing project makespan or project cost according to different decision criterions. However, few works considered resource constraint, which initially appeared in deterministic resource-constrained project scheduling problem (RCPSP) and reflects t...

In the past decades, resource on resource-constrained project scheduling problem (RCPSP) has grown rapidly, resulting in an overwhelming amount of solution procedures that provide (near)-optimal solutions a reasonable time. Despite rapid progress, little is still known what makes instance hard to solve. Inspired by previous research study shown even small instances with only up 30 activities so...

We present a Branch and Bound approach for the resource constrained project scheduling problem where activity durations are assumed to be random according to independent probability distributions. Our aim is to compute an optimal scheduling policy that minimize the expected project cost with respect to some regular measure of performance.

Multi-mode Resource Constrained Project Selection and Scheduling Considering the Reinvestment Strategy in a Flexible Time Horizon

Resource-constrained project scheduling problems are one of the most studied scheduling problem, and constraint programming with nogood learning provides the state-of-the-art solving technology for them, at least when the aim is minimizing makespan. In this paper we examine the closely related problem of scheduling producers and consumers of discrete resources and reservoirs. Producer/consumer ...