Scientific and Technical Journal


ISSN Print 2221-3937
ISSN Online 2221-3805

The software projects are characterized by a long planning horizon, which entails the policy of release management. A short-term version of this problem is known as the Next Release Problem. A central issue release planning is determining which features should be included in which releases. This problem is NP-hard and thus cannot be solved analytically. To reduce the complexity, it is proposed to apply a simple clustering algorithm. The similarity coefficient combines precedence based similarity, predecessor based similarity and successor based similarity. The resource constraints for the particular release define a clear cutting point for the cluster size. Proposed approach reduces the complexity of the problem from O(n!), where n is the number of features, to O(m2), where m is the number of releases. One example is considered. There is pointed that to improve the results of features allocation to releases the priorities of features should be taken into account.

  1. Denisiuk, A. V. and Liubchenko, V. V. (2013). Actual problems of software quality [Aktualnye problem kachestva programmnogo obespecheniia]. Elektrotekhnicheslie i komputernye sistemy, 9(85), pp. 142–148.
  2. Durillo, J. J., Zhang, Y., Alba, E., Harman, M. and Nebro, A. J. (2011). A study of the bi-objective next release problem. Empirical Software Engineering, 16(1), pp. 29–60.
  3. Ruhe, G. and Saliu, M. O. (2005). The art and science of software release planning.IEEE Software, 6(22), pp. 47–53.
  4. Nogin, V. D. (2002). Decision making in the multicriteria environment: a qualitative approach [Priniatie reshenii v mnogokriterialnoi srede: kolichestvennyi podkhod]. Moskow: FIZMATLIT, 176 p.
  5. Harman, M. and Jones, B. F. (2001). Search based software engineering. Information and Software Technology, 43(14), pp. 833–839.
  6. Liubchenko, V. V. Decision support system for next release problem [Systema pidtrymky pryiniattia rishen dlia zadachi nastupnogo relizu]. Shtuchnyi intelekt, 1-2 (67-68), pp. 106–110.
  7. Etgar, R., Gelbard, R. and Cohen, Yu. (2016). Project Scope Partitioning by Clustering Features into Releases of Long R&D Projects. Procedia Computer Science, 100, pp. 1235–1241.
Last download:
30 Oct 2018

[ © KarelWintersky ] [ All articles ] [ All authors ]
[ © Odessa National Polytechnic University, 2014-2018. Any use of information from the site is possible only under the condition that the source link! ]