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

Iterative Flattening Search (IFS) is a meta-heuristic strategy for solving multi-capacity scheduling problems. Given an initial solution, IFS iteratively applies: (1) a relaxationstep, in which a subset of scheduling decisions are randomly retracted from the current solution; and (2) a flattening-step, in which a new solution is incrementally recomputed from this partial schedule. Whenever a be...

In this paper, we study the problem of how to react when an ongoing project is disrupted. The focus is on the resourceconstrained project scheduling problem with finish–start precedence constraints. We begin by proposing a classification scheme for the different types of disruptions and then define the constraints and objectives that comprise what we call the recovery problem. The goal is to ge...

In this paper, we present a variant of classical scheduling problems which deal with restricted resources. Unlike other models studied in the literature, the proposed model has no upper bound for the amount of available resources. The objective of this variant is to find a solution that maximises this amount at the end of the planning horizon. A hybrid evolutionary algorithm is proposed for thi...

Article history: Received 5 December 2012 Received in revised form 2 August 2013 Accepted 30 September 2013 Available online 8 October 2013

This paper gives an overview of a new approach to Resource Constrained Project Scheduling. The approach is based on the combination of a novel optimization technique with limited discrepancy search, and generates the best known solutions to benchmark problems of realistic size and character.

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

We develop a decomposition method for project scheduling problems with adjacent resources. Adjacent resources are resources for which the units assigned to a job are required to be in some sense adjacent. Possible examples of adjacent resources are dry docks, shop floor spaces, and assembly areas. We focus on the Time-Constrained Project Scheduling Problem (TCPSP), [4], with one 1-dimensional a...