A genetic algorithm for the resource constrained multi-project scheduling problem

José F. Gonçalves (jfgoncalfep.up.pt)
Jorge J.M. Mendes (jjmisep.ipp.pt)
Mauricio G.C. Resende (mgcrresearch.att.com)

Abstract: This paper presents a genetic algorithm for the Resource Constrained Multi-Project Scheduling Problem (RCMPSP). The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.

Keywords: Project management, meta-heuristics, genetic algorithm, scheduling.

Category 1: Applications -- OR and Management Sciences (Scheduling )

Category 2: Combinatorial Optimization (Meta Heuristics )

Citation: AT&T Labs Technical Report TD-668LM4, October 2004.

Download: [PDF]

Entry Submitted: 10/29/2004
Entry Accepted: 10/31/2004
Entry Last Modified: 10/29/2004

Modify/Update this entry