Solving Preemptive Multimode Resource Constraint Project Scheduling Problem Considering Fast-Tracking Using Genetic Algorithm

Please enable javascript in your browser.

Manshadian, Hamed | 2014

522 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 45639 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Shadrokh, Shahram
Abstract:
In this project, we present a mathematical model for preemptive multi-mode resource-constrained project scheduling problem considering fast tracking (PMRCPSP-FT). The number of activity preemptions could be defined in the model. We used two types of resources in our model: Renewable resources and Non-renewable resources. Each activity can be accomplished in just one mode and each mode represents activity resource requirements, its duration and its maximum number of allowable preemptions. The objective is to minimize the project makespan. Considering the complexity of the problem, the exact solution is not achievable for big or real size problems. We use a genetic algorithm to solve the model. In order to validate the performance of our approach, we solved some problems in exact method and compared our results with GA procedure. The results reveal that our GA method provides appropriate outcome in much more shorter time than the exact method
Keywords:
Project Scheduling ; Resource Constraint ; Genetic Algorithm ; Activity Preemption ; Activities Fast-Tracking

No TOC