We propose a min-flow algorithm for detecting Minimal Critical Sets (MCS) in Resource Constrained Project Scheduling Problems (RCPSP). The MCS detection is a fundamental step in the Precedence Constraint Posting method (PCP), one of the most successful approaches for the RCPSP. The proposed approach is considerably simpler compared to existing flow based MCS detection procedures and has better ...

In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) with minimum makespan objective by introducing as precedence constraints the so called “Feeding Precedences” (FP). For the RCPSP with FP we propose a new mathematical formulation and a branch and bound algorithm exploiting the latter formulation. The exact algorithm takes advantage also of a lower...

The key question addressed by the resource-constrained project scheduling problem (RCPSP) is to determine the start times for each activity such that precedence and resource constraints are satisfiedwhile achieving some objective. Priority rule-based heuristics are widely used for large problems. Rollout and justification can be integrated with priority rule heuristics to solve the RCPSP. We de...

In this paper we use genetic algorithms (GA) to deal with the ResourceConstrained Project Scheduling Problem (RCPSP ). We introduce a priority value encoding (representation) to implement the GA for RCPSP . First, we follow up the approach of Alcaraz and Maroto [1] to introduce an additional component in the encoding to indicate the scheduling mode (forward or backward) used to generate the cor...

We consider the resource constrained project scheduling problem (RCPSP) with precedence. All resources are renewable and the objective is to find a schedule that meets all resource and precedence constraints and minimizes the makespan. We propose a heuristic deterministic greedy algorithm solving this problem with the time complexity depending on the number of activities as n log n. The main id...

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

The production of civil aircrafts is confronted with a significant demand for the interconnectivity resources among distributed factories, while complex coupling relationships various might restrict improvement efficiency. Therefore, researching scheduling methods aircraft necessary, but previous studies have not taken material inventory into account sufficiently. This article proposes method t...

Water conservancy project scheduling is an extension to the classic resource-constrained problem (RCPSP). It limited by special time constraints called “forbidden windows” during which certain activities cannot be executed. To address this issue, a specific RCPSP model proposed, and approach designated for it incorporates both priority rule-based heuristic algorithm obtain acceptable solution, ...

The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...

An ant colony optimization approach (ACO) for the resource-constrained project scheduling problem (RCPSP) is presented. Combinations of two pheromone evaluation methods are used by the ants to find new solutions. We tested our ACO algorithm on a set of large benchmark problems from the PSPLIB. Compared to several other heuristics for the RCPSP including genetic algorithms, simulated annealing, ...