软件项目财务回报优化的动态规划算法

2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA) Pub Date : 2015-07-06 DOI:10.1109/IISA.2015.7388067

D. Tselios, P. Ipsilandis, V. Gerogiannis

{"title":"软件项目财务回报优化的动态规划算法","authors":"D. Tselios, P. Ipsilandis, V. Gerogiannis","doi":"10.1109/IISA.2015.7388067","DOIUrl":null,"url":null,"abstract":"The Incremental Funding Method (IFM) in software development projects aims at optimizing the financial return of a software project through proper sequencing of development activities and incremental releases of the software product. This paper presents a Dynamic Programming (DP) project scheduling algorithm that maximizes a software project's net present value (NPV) under IFM assumptions. Through an exemplar case study we demonstrate that the DP algorithm guarantees optimality in the project scheduling sequence and offers flexibility in adjusting the optimum project schedule dynamically, as market or development conditions change.","PeriodicalId":433872,"journal":{"name":"2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A dynamic programming algorithm for optimizing the financial return of software projects\",\"authors\":\"D. Tselios, P. Ipsilandis, V. Gerogiannis\",\"doi\":\"10.1109/IISA.2015.7388067\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Incremental Funding Method (IFM) in software development projects aims at optimizing the financial return of a software project through proper sequencing of development activities and incremental releases of the software product. This paper presents a Dynamic Programming (DP) project scheduling algorithm that maximizes a software project's net present value (NPV) under IFM assumptions. Through an exemplar case study we demonstrate that the DP algorithm guarantees optimality in the project scheduling sequence and offers flexibility in adjusting the optimum project schedule dynamically, as market or development conditions change.\",\"PeriodicalId\":433872,\"journal\":{\"name\":\"2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IISA.2015.7388067\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IISA.2015.7388067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

软件开发项目中的增量资助方法(IFM)旨在通过适当的开发活动排序和软件产品的增量发布来优化软件项目的财务回报。本文提出了一种动态规划(DP)项目调度算法，该算法在IFM假设下使软件项目的净现值(NPV)最大化。通过一个典型案例研究，我们证明了DP算法保证了项目进度序列的最优性，并提供了随着市场或开发条件的变化动态调整最优项目进度的灵活性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A dynamic programming algorithm for optimizing the financial return of software projects

The Incremental Funding Method (IFM) in software development projects aims at optimizing the financial return of a software project through proper sequencing of development activities and incremental releases of the software product. This paper presents a Dynamic Programming (DP) project scheduling algorithm that maximizes a software project's net present value (NPV) under IFM assumptions. Through an exemplar case study we demonstrate that the DP algorithm guarantees optimality in the project scheduling sequence and offers flexibility in adjusting the optimum project schedule dynamically, as market or development conditions change.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)

自引率

0.00%

发文量