Project scheduling under multiple resources constraints using a genetic algorithm

Part of : WSEAS transactions on business and economics ; Vol.5, No.11, 2008, pages 487-496

Issue:
Pages:
487-496
Author:
Abstract:
The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorialoptimization for which extensive investigation has been devoted to the development of efficient algorithms.During the last couple of years many heuristic procedures have been developed for this problem, but still theseprocedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resourceconstrained project scheduling problem. The chromosome representation of the problem is based on randomkeys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of theactivities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken fromthe literature and compared with other approaches. The computational results validate the effectiveness of theproposed algorithm.
Subject:
Subject (LC):
Keywords:
construction management, project management, scheduling, genetic algorithm, RCPSP
Notes:
Περιέχει γραφήματα, πίνακες και βιβλιογραφία