Application of GA optimization for solving precedent relationship problem in project scheduling

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

7 Scopus Citations
View graph of relations



Original languageEnglish
Pages (from-to)2067-2081
Journal / PublicationMathematical and Computer Modelling
Issue number9-10
Publication statusPublished - May 2013


Based on Genetic Algorithms (GAs) with the matrix approach, the presented model introduces a pre-decision algorithm combining electronic spreadsheets to visually unfold the precedent relationship of activities in project scheduling problems. Trying to avoid large modification to traditional genetic algorithm operators and chromosome structures, the proposed method is improved by reducing time consumption in searching solutions. To demonstrate the technique, two types of scheduling problems for the construction industry are described and tested: traditional contracts with fixed finishing time constraint and the Build-Operate-Transfer (BOT) contracts which have a flexible finishing time with a reward/penalty arrangement. The results clearly show that the model can generate a promising upgrading when compared with the use of traditional GA method in chromosome structures and searching time. © 2011 Elsevier Ltd.

Research Area(s)

  • Genetic algorithms, Project scheduling, Time and cost optimization