Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A genetic algorithm for biobjective multi-skill project scheduling problem with hierarchical levels of skills
Download
index.pdf
Date
2010
Author
Gürbüz, Elif
Metadata
Show full item record
Item Usage Stats
150
views
109
downloads
Cite This
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.
Subject Keywords
Genetic algorithms.
,
Levels.
URI
http://etd.lib.metu.edu.tr/upload/12612417/index.pdf
https://hdl.handle.net/11511/20169
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
A genetic algorithm for resource leveling of construction projects
Iranagh, Mahdi Abbasi; Sönmez, Rifat (2012-01-01)
Critical path method (CPM) is commonly used in scheduling of construction projects. However, CPM only considers the precedence relations between the activities and does not consider resource optimization during scheduling of projects. Optimal allocation of resources can be achieved by resource levelling. Resource levelling is crucial for effective use of construction resources particularly to minimize the project costs. However, commercial scheduling software has very limited capabilities for solving the re...
Adaptation and Fine-Tuning of the Weighted Sum Method on Personnel Assignment Problem with Hierarchical Ordering and Team Constraints
Arslanoglu, Yilmaz; Toroslu, İsmail Hakkı (2011-09-28)
This work deals with the multi-objective optimization problem, Personnel Assignment Problem with Hierarchical Ordering and Team Constraints, which appears in personnel assignment of large hierarchical organizations, such as military. Weighted Sum Method, which is one of the pioneering approaches towards multi-objective optimization, is considered as the means of solution to the problem. The adaptation of this intuitive and successful method to the problem, and an analysis on fine-tuning of its various param...
A new systematic and flexible method for developing hierarchical decision-making models
BELDEK, ULAŞ; Leblebicioğlu, Mehmet Kemal (2015-01-01)
The common practice in multilevel decision-making (DM) systems is to achieve the final decision by going through a finite number of DM levels. In this study, a new multilevel DM model is proposed. This model is called the hierarchical DM (HDM) model and it is supposed to provide a flexible way of interaction and information flow between the consecutive levels that allows policy changes in DM procedures if necessary. In the model, in the early levels, there are primary agents that perform DM tasks. As the le...
An interactive genetic algorithm applied to the multiobjective knapsack problem
Pamuk, S; Köksalan, Mustafa Murat (2001-01-01)
Multiobjective combinatorial problems are commonly encountered in practice and would benefit from the development of metaheuristics where the search effort is interactively guided towards the solutions favored by the decision maker. The present study introduces such an Interactive Genetic Algorithm designed for a general multiobjective combinatorial framework and discusses its behavior in simulations on the Multiobjective Knapsack Problem. The evolution strategies being employed reflect the multiobjective n...
An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
Phelps, S; Köksalan, Mustafa Murat (2003-12-01)
We propose an evolutionary metaheuristic for multiobjective combinatorial optimization problems that interacts with the decision maker (DM) to guide the search effort toward his or her preferred solutions. Solutions are presented to the DM, whose pairwise comparisons are then used to estimate the desirability or fitness of newly generated solutions. The evolutionary algorithm comprising the skeleton of the metaheuristic makes use of selection strategies specifically designed to address the multiobjective na...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Gürbüz, “A genetic algorithm for biobjective multi-skill project scheduling problem with hierarchical levels of skills,” M.S. - Master of Science, Middle East Technical University, 2010.
