Solution of the resource-constrained activity networks.

Simple item page
dc.contributor.authorMohammed Moizuddin
dc.date1996
dc.date.accessioned2022-05-18T05:25:15Z
dc.date.available2022-05-18T05:25:15Z
dc.degree.departmentCollege of Computer Science and Engineering
dc.degree.grantorKing Fahad for Petrolem University
dc.description.abstractResource available for the completion of each activity of a project (represented as an activity network) are always limited in the real life and so, finding the optimal schedule for the activities is very hard. Such a problem is termed as Resouce-Constrained Project Scheduling (RCPS) Problem, which is classed as an NP-hard combinatorial optimization problem. Three solution methodologies based on simulated annealing, genetic algorithm and tabu search are developed. The proposed approaches are implemented on the 110 benchmark problems of Patterson. The parameters needed for each proposed algorithm were determined. Also, to validate the solution methodologies, a comparison is done with the popular procedures existing in the literature and the results are encouraging.
dc.identifier.other5475
dc.identifier.urihttps://drepo.sdl.edu.sa/handle/20.500.14154/1848
dc.language.isoen
dc.publisherSaudi Digital Library
dc.thesis.levelMaster
dc.thesis.sourceKing Fahad for Petrolem University
dc.titleSolution of the resource-constrained activity networks.
dc.typeThesis
Files
Collections