Please use this identifier to cite or link to this item:
Title: Repetitive project scheduling using genetic algorithms
Keywords: repetitive projects, genetic algorithms, schedule optimization
Issue Date: 17-Jan-2005
Citation: TAN HENG WEE (2005-01-17). Repetitive project scheduling using genetic algorithms. ScholarBank@NUS Repository.
Abstract: Repetitive projects consist of multiple units that are identical or similar in nature, with various activities or trades repeatedly executed from one physical unit to another during the construction process. This repetitive construction process renders it desirable to schedule the execution of these trades as uninterrupted and continuous work sequences by imposing a work continuity constraint whenever necessary. This study proposes a scheduling approach for repetitive projects by using a set of recurrence equations which can ensure work continuity through imposing a scheduling constraint that adjusts the calculations of activity start/finish times. This set of equations also forms the basis for optimizing the schedules of repetitive projects with an evolutionary optimization technique. The Genetic Algorithm is used to search for the best schedule by varying the crew size and work continuity requirements of the project activities. The schedules which have lower work continuity and do not meet deadlines are penalized.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
E. Full Thesis.pdf803.95 kBAdobe PDF



Page view(s)

checked on May 22, 2019


checked on May 22, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.