Applying Genetic Algorithm to Resource Constrained Multi-Project Scheduling Problems
| Autor: | Wun-Hao Jhong, 鍾文豪 |
|---|---|
| Rok vydání: | 2008 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 96 Resource-constrained multiple project scheduling problems (RCMPSP) consider precedence relationship among activities and the capacity constraints of multiple resources for multiple projects. RCMPSP are NP-hard due to these practical constraints indicating an exponential calculation time to reach optimal solution. In order to improve the speed and the performance of problem solving, heuristic approaches are widely applied to solve RCMPSP. This research applies Genetic algorithm (GA) and heuristic approach to solve RCMPSP with an objective to minimize the total tardiness. Project due dates are set as the unconstrained critical path duration, similar to the way used in literature. The proposed GA is compared with three typical heuristics for RCMPSP: Maximum Total Work Content (MAXTWK), Earliest Due Date (EDD), and Minimum Slack First (MINSLK). Two typical RCMPSP from literature are used as a test bed for performance evaluation. The results demonstrate that GA outperforms the three heuristic methods in term of the total tardiness. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|