{"id":{"repo_id":"nus","oai_identifier":"oai:scholarbank.nus.edu.sg:10635/14544"},"canonical_url":"https://search.dev.ndltd.org/etd/nus/oai:scholarbank.nus.edu.sg:10635/14544","repository":{"repo_id":"nus","name":"National University of Singapore","base_url":"https://scholarbank.nus.edu.sg/oai/request"},"display":{"title":"Repetitive project scheduling using genetic algorithms","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.","abstract_html":"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.","abstract_has_math":false,"creators":["TAN HENG WEE"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2005,"date_issued":"2005-01-17","date_published":"2005-01-17","updated_at":"2026-07-24T03:32:04Z","subjects":["repetitive projects, genetic algorithms, schedule optimization"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["TAN HENG WEE"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2005-01-17"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://scholarbank.nus.edu.sg/handle/10635/14544"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["repetitive projects, genetic algorithms, schedule optimization"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://scholarbank.nus.edu.sg/bitstreams/19cc070b-4ce3-4bfe-8674-8727e6f3de4a/download"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:format.checksum.md5","label":"Dc Format Checksum Md5","values":["13428b3277036ff2698a2c5287d0d2e8","6519c8a25c97c8904e1ed41fa21dd853"]},{"key":"dc:title","label":"Title","values":["Repetitive project scheduling using genetic algorithms"]}]}],"canonical_facts":{"dc:creator":["TAN HENG WEE"],"dc:date.issued":["2005-01-17"],"dc:description.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."],"dc:format.checksum.md5":["13428b3277036ff2698a2c5287d0d2e8","6519c8a25c97c8904e1ed41fa21dd853"],"dc:identifier.uri":["https://scholarbank.nus.edu.sg/bitstreams/19cc070b-4ce3-4bfe-8674-8727e6f3de4a/download"],"dc:relation.isreferencedby":["https://scholarbank.nus.edu.sg/handle/10635/14544"],"dc:subject":["repetitive projects, genetic algorithms, schedule optimization"],"dc:title":["Repetitive project scheduling using genetic algorithms"],"dc:type":["Thesis"]},"updated_at":"2026-07-24T03:32:04Z"}