genetic algorithm for solving the software project management problem

Dejan Štumberger (2011) genetic algorithm for solving the software project management problem. EngD thesis.

Abstract

In this graduation thesis, a genetic algorithm for solving the software project management problem is discussed. A software project consists of activities which need to be implemented as quickly as possible and/or with minimal cost and with minimal overlap of activities, with use of available resources. These are employees with skills. In the first part of the thesis, genetic algorithms are presented. Then the software project management problem is formally described. Description of the realization of a genetic algorithm for the software project management problem follows. The thesis is completed by testing the algorithm in order to provide guidance for selecting parameters of the genetic algorithm, such that it will organize the activities and the resources of the software project optimally with respect to given criteria.

Item Type:

Thesis (EngD thesis)

Keywords:

feasible solution - genetic algorithm - optimization problem - critical path method - software project management feasible solution - genetic algorithm - optimization problem - critical path method - software project management feasible solution - genetic algorithm - optimization problem - critical path method - software project management

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
doc. dr. Arjana Žitnik		Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=00008451412)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

1378

Date Deposited:

09 Jun 2011 11:34

Last Modified:

13 Aug 2011 00:39

URI:

http://eprints.fri.uni-lj.si/id/eprint/1378

Actions (login required)

View Item