In Multi-Skill Project Scheduling Problem (MSPSP) with hierarchical levels of skills, there are more than one skill type and for each skill type there are levels corresponding to proficiencies in that skill. The purpose of the problem is to minimize or maximize an objective by assigning resources with different kinds of skills and skill levels to the project activities according to the activity requirements while satisfying the other problem dependent constraints. Although single-objective case of the problem has been studied by a few researchers, biobjective case has not been studied yet. In this study, two objectives, which are the makespan and the total skill wasted, are taken into account and while trying to minimize the makespan, minimizing the total skills wasted is aimed. By the second objective, overqualification for the jobs is tried to be minimized in order to prevent job dissatisfaction. The biobjective problem is solved using a Multiobjective Genetic Algorithm, NSGA-II. The results of the proposed algorithm are compared with the GAMS results for small-sized problems and with the random search for larger problem sizes.
Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12612417/index.pdf |
Date | 01 September 2010 |
Creators | Gurbuz, Elif |
Contributors | Sepil, Canan |
Publisher | METU |
Source Sets | Middle East Technical Univ. |
Language | English |
Detected Language | English |
Type | M.S. Thesis |
Format | text/pdf |
Rights | To liberate the content for public access |
Page generated in 0.0011 seconds