AAAI Publications, Nineteenth International Conference on Automated Planning and Scheduling

Font Size: 
Solving Resource-Constrained Project Scheduling Problems with Time-Windows Using Iterative Improvement Algorithms
Angelo Oddi, Riccardo Rasconi

Last modified: 2009-10-16


This paper proposes an iterative improvement approach for solving the Resource Constraint Project Scheduling Problem with Time-Windows (RCPSP/max), a well-known and challenging NP-hard scheduling problem. The algorithm is based on Iterative Flattening Search (IFS), an effective heuristic strategy for solving multi-capacity optimization scheduling problems. Given an initial solution, IFS iteratively performs two-steps: a relaxation-step, that randomly removes a subset of solution constraints and a solving-step, that incrementally recomputes a new solution. At the end, the best solution found is returned. The main contribution of this paper is the extension to RCPSP/max of the IFS optimization procedures developed for solving scheduling problems without time-windows. An experimental evaluation performed on medium-large size and web-available benchmark sets confirms the effectiveness of the proposed procedures. In particular, we have improved the average quality w.r.t. the current bests, while discovering three new optimal solutions, thus demonstrating the general efficacy of IFS.


scheduling, iterative sampling, constraint-based reasoning

Full Text: PDF