Repository logo
Communities & Collections
Browse DSpace
  • English
  • Türkçe
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Baş, Mahmut"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Thumbnail Image
    Item
    Sarmal ve çevik yazılım geliştirme çizelgesinin sezgisel yöntemlerle optimizasyonu ve karşılaştırması
    (Bahçeşehir Üniversitesi Fen Bilimleri Enstitüsü, 2015-10) Baş, Mahmut; Adem, Karahoca
    The software development projects are getting more complex by time and evolving technology. The increasing complexity in software projects brought difficulty in management of human resources. In this work, scheduling of staff that will contribute in such complex software development project with cost and productivity calculations is handled. The purpose is to complete the project with lowest cost and highest with performing staff. Spiral software development and agile software development processes are used in this work. And then, heuristic approach and project scheduling with limited resources are defined, then, genetic algorithm, simulated annealing, ant colony algorithm in between heuristic methods are mentioned. A c# .Net application is developed which contains spiral software development and agile software development processes sample. In this application, tasks and human resources are defined, optimization algorithms for spiral and agile software development are run 5 times with same input, and results are compared in terms of total work time, cost reduction and productivity increase. Conclusion of tests showed that genetic algorithm has seen more powerful in spiral software development with lots of tasks and complex software development models. After genetic algorithm secondarily ant colony algorithm and thirdly simulated annealing algorithm comes. Ant colony algorithm is observed as more useful for less task models like agile software development. And then, simulated annealing algorithm comes in the end, with results close to ant colony algorithm.
BİLGİ
  • Etkinlikler
  • Duyurular
  • Ekibimiz
  • Veritabanları
  • Kütüphane Kuralları
  • Ödünç Verme
  • S.S.S
  • İletişim
İLETİŞİM

Çırağan Caddesi, Osmanpaşa Mektebi Sokak,
No:4-6,34353 Beşiktaş/İstanbul
(0212) 381 02 20 - 02 23
library@lib.bau.edu.tr

DSpace software copyright © 2002-2025 Support by ZeGeSoft

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify