Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/5798
Title: Project schedule optimisation utilising genetic algorithms
Authors: Lancaster, John
Advisors: Cheng, K
Ozbayrak, M
Issue Date: 2007
Publisher: Brunel University School of Engineering and Design PhD Theses
Abstract: This thesis extends the body of research into the application of Genetic Algorithms to the Project Scheduling Problem (PSP). A thorough literature review is conducted in this area as well as in the application of other similar meta-heuristics. The review extends previous similar reviews to include PSP utilizing the Design Structure Matrix (DSM), as well as incorporating recent developments. There is a need within industry for optimisation algorithms that can assist in the identification of optimal schedules when presented with a network that can present a number of possible alternatives. The optimisation requirement may be subtle only performing slight resource levelling or more profound by selecting an optimal mode of execution for a number of activities or evaluating a number of alternative strategies. This research proposes a unique, efficient algorithm using adaptation based on the fitness improvement over successive generations. The algorithm is tested initially using a MATLAB based implementation to solve instances of the travelling salesman problem (TSP). The algorithm is then further developed both within MATLAB and Microsoft Project Visual Basic to optimise both known versions of the Resource Constrained Project Scheduling Problems as well as investigating newly defined variants of the problem class.
Description: This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.
URI: http://bura.brunel.ac.uk/handle/2438/5798
Appears in Collections:Mechanical and Aerospace Engineering
Dept of Mechanical Aerospace and Civil Engineering Theses

Files in This Item:
File Description SizeFormat 
FulltextThesis.pdf71.55 MBAdobe PDFView/Open


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