Optimization Online


A Random Key Based Genetic Algorithm for the Resource Constrained Project Scheduling Problem

J.J.M. Mendes (jjm***at***isep.ipp.pt)
J.F. Gonçalves (jfgoncal***at***fep.up.pt)
M.G.C. Resende (mgcr***at***research.att.com)

Abstract: This paper presents a genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities of the activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.

Keywords: Project Management, Scheduling, Genetic Algorithms, Random Keys, RCPSP.

Category 1: Applications -- OR and Management Sciences (Production and Logistics )

Category 2: Combinatorial Optimization (Meta Heuristics )

Citation: AT&T Labs Research Technical Report TD-6DUK2C, June 30, 2005.

Download: [PDF]

Entry Submitted: 07/03/2005
Entry Accepted: 07/04/2005
Entry Last Modified: 07/03/2005

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society