DSpace Repository

Dynamic Effort Allocation Problem Using Genetic Algorithm Approach

Show simple item record

dc.contributor.author Chanda, Udayan
dc.date.accessioned 2023-05-01T09:38:38Z
dc.date.available 2023-05-01T09:38:38Z
dc.date.issued 2014-06
dc.identifier.uri http://www.mecs-press.org/ijmecs/ijmecs-v6-n6/v6n6-6.html
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10606
dc.description.abstract Effort distribution plays a major role in software engineering field. Because the limited price projects are becoming common today, the process of effort estimation becomes crucial, to control the budget agreed upon. In last 10 years, numerous software reliability growth models (SRGM) have been developed but majority of model are under static assumption. The basic goal of this article is to explore an optimal resource allocation plan to minimize the software cost throughout the testing phase and operational phase under dynamic condition using genetic algorithm technique. This article also studies the resource allocation problems optimally for various conditions by investigating the activities of the model parameters and also suggests policies for the optimal release time of the software in market place. en_US
dc.language.iso en en_US
dc.publisher MECS Press en_US
dc.subject Management en_US
dc.subject SRGM en_US
dc.subject Optimal Control Theory en_US
dc.subject Testing Effort Allocation en_US
dc.subject Genetic algorithm en_US
dc.subject Release time problem en_US
dc.title Dynamic Effort Allocation Problem Using Genetic Algorithm Approach en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account