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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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 multi-mode resource constrained project scheduling
Download
093399.pdf
Date
2000
Author
Güvenç, Burak
Metadata
Show full item record
Item Usage Stats
170
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/2849
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
A genetic algorithm for 2d shape optimization
Chen, Wei Hang; Oral, Süha; Department of Mechanical Engineering (2008)
In this study, an optimization code has been developed based on genetic algorithms associated with the finite element modeling for the shape optimization of plane stress problems. In genetic algorithms, constraints are mostly handled by using the concept of penalty functions, which penalize infeasible solutions by reducing their fitness values in proportion to the degrees of constraint violation. In this study, An Improved GA Penalty Scheme is used. The proposed method gives information about unfeasible ind...
A genetic algorithm for graph partitioning
Akman, Esra; Polat, Faruk; Department of Computer Engineering (1995)
A Multi-Objective Incremental Path Planning Algorithm for Mobile Agents
Oral, Tugcem; Polat, Faruk (2012-12-07)
Path planning is a crucial issue in unknown environments where an autonomous mobile agent has to reach a particular destination from some initial location. There are several incremental algorithms such as D-star[1], D-star Lite [2] that are able to ensure reasonable paths in terms of path length in unknown environments. However, in many real-world problems we realize that path length is not only the sole objective. For example in computer games, a non-player character needs to not only find a minimum cost p...
A Hybrid genetic algorithm for multi mode resource constrained scheduling problem for large size projects
Gürel, Mustafa; Sönmez, Rifat; Department of Civil Engineering (2015)
Just like in all industries, some of the available resources, in order to finish a project on time, are constrained in construction industry. To be able to finish the project on time has high importance both for the contractor and for the owner. Project scheduling in which resources are limited for a particular time are called as resource constrained project scheduling problems (RCPSP) and occupies a significant place in construction management. Especially for large scale projects, little success has been a...
A genetic algorithm for biobjective multi-skill project scheduling problem with hierarchical levels of skills
Gürbüz, Elif; Sepil, Canan; Department of Industrial Engineering (2010)
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 probl...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
B. Güvenç, “A genetic algorithm for multi-mode resource constrained project scheduling,” Middle East Technical University, 2000.