This thesis is about software project scheduling and use of earned value method on software projects.
As a result of the study, a solution for software project scheduling problems is proposed. A mathematical formulation, developed using integer programming method, is at the heart of the solution. Objective of the formulation is to minimize the development costs consisting of direct labor cost, indirect costs and probable penalty costs. The formulation takes the capability and compatibility variances among resources into account whereas contemporary approaches mostly focus on resource availability. Formulation is of type discrete time and takes the time span to be searched as input. Therefore a heuristic approach has been developed for providing time span input to the models developed using the formulation. The heuristic approach has been proven to be calculating a time span that does not hinder achieving the absolute optimum schedule and shortens the solution time of the integer programs. The heuristic approach and problem formulation have been incorporated into a computer program that generates integer programs and heuristic solutions.
This thesis also describes a method for preparing an earned value plan, based on the scheduling solution defined. The method aims to help project managers in determining the status of their projects and deciding whether any corrective action is required or not. Besides the method, approaches for incorporating indirect costs and penalty costs, which are not explicitly discussed in literature, into final cost estimation have been described.
Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12606362/index.pdf |
Date | 01 July 2005 |
Creators | Kanik, Yusuf |
Contributors | Kocyigit, Altan |
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.0016 seconds