Offshore engineering construction projects are large and complex, having the characteristics of multiple execution modes resource constraints. Their complex internal scheduling processes can be regarded as resourceconstrained project problems (RCPSPs). To solve RCPSP in offshore more rapidly, a hybrid genetic algorithm was established. defects algorithms, which easily fall into local optimal so...

This paper deals with the Resource-Constrained Project scheduling Problem (RCPSP) under activity duration uncertainty. Based on scenarios, the object is to minimize the worst-case performance among a set of initial scenarios which is referred to as the min-max robustness objective. Due to the complexity of the tackled problem, we propose the application of the GRASP method which is qualified as...

In this paper we review different approaches for scheduling projects in multi-project environments. We show the evolution of the methodologies from the Resource Constrained Project Scheduling Problem to the Decentralized Resource Constrained Multi-Project Scheduling Problem. We argue that traditional methods used in project scheduling cannot cope with the complexity of current real portfolios p...

The aim of the present article is to optimize the robustness objective for the Resource-Constrained Project scheduling Problem (RCPSP) dealing with activity duration uncertainty. The studied robustness consists in minimizing the worst-case performance, referred to as the min-max robustness objective, among a set of initial scenarios. We propose an enhanced GRASP approach as a solution to the gi...

The Resource Constrained Project Scheduling Problem is an important problem in project management, manufacturing and resource optimization. We focus on a variant of RCPSP with time lags and uncertain activity durations. We adopt a Precedence Constraint Posting approach and add precedence constraints to the original project graph so that all resource conflicts are solved and a consistent assignm...

The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling algorithms such as heuristic-biased stochastic sampling (HBSS) and value-biased stochastic sampling (VBSS), wherein a heuristic is used to bias a stochastic policy for choosing among alternative branches in the search...

Abstract The Test Laboratory Scheduling Problem (TLSP) is a real-world scheduling problem that extends the well-known Resource-Constrained Project (RCPSP) by several new constraints. Most importantly, jobs have to be assembled out of smaller tasks solver, before they can scheduled. In this paper, we introduce different metaheuristic solution approaches for problem. We propose four neighborhoods...

The resource constrained project scheduling problem (RCPSP) can be given as follows. A single project consists of a set J = {0,1, . . . ,n,n+1} of activities which have to be processed. Fictitious activities 0 and n+1 correspond to the “project start” and to the “project end”, respectively. The activities are interrelated by two kinds of constraints. First, precedence constraints force activity...