In this paper, we consider the Resource Constrained Project Scheduling Problem (RCPSP). New feasibility tests for the energetic reasoning are introduced based on new integer programming (IP) formulations. Experimental results are presented based on PSPLIB instances.

This paper describes how the Resource-Constrained Project Scheduling Problem (RCPSP) can be used as a basis for real-time decision support in the disruption management of the aircraft turnaround, the most typical airport ground process. For this purpose, the RCPSP is extended by the possibility to describe alternative activities, which can be used to model potential process modi cations. An evo...

In this paper Hybrid Ant Colony Optimization (HAntCO) approach in solving Multi–Skill Resource Constrained Project Scheduling Problem (MS–RCPSP) has been presented. We have proposed hybrid approach that links classical heuristic priority rules for project scheduling with Ant Colony Optimization (ACO). Furthermore, a novel approach for updating pheromone value has been proposed, based on both th...

The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey the resource constraints and the precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of the problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow), when every activity has a given cash flow...

In projects with a flexible project structure, the activities that have to be scheduled are not completely known beforehand. Instead, scheduling such a project includes the decision whether to carry out particular activities at all. This also effects precedence constraints between the finally implemented activities. However, established model formulations and solution approaches for the resourc...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem (RCPSP) have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences, feasible completion times or feasible subsets, they all aim at nding as fast as possible a makespan minimal schedule among the resource and precedence feasi...

In this work, we consider RCPSP/max with durational uncertainty. We focus on computing robust Partial Order Schedules (or, in short POS) which can be executed with risk controlled feasibility and optimality, i.e., there is stochastic posteriori quality guarantee that the derived POS can be executed with all constraints honored and completion before robust makespan. To address this problem, we p...

Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...