The next release problem

被引:201
作者
Bagnall, AJ [1 ]
Rayward-Smith, VJ [1 ]
Whittley, IM [1 ]
机构
[1] Univ E Anglia, Sch Informat Syst, Comp Sci Sector, Norwich NR4 7TJ, Norfolk, England
关键词
next release; software systems; software enhancements;
D O I
10.1016/S0950-5849(01)00194-X
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Companies developing and maintaining complex software systems need to determine the features that should be added to their system as part of the next release. They will wish to select these features to ensure the demands of their client base are satisfied as much as possible while at the same time ensuring that they themselves have the resources to undertake the necessary development. This situation is modelled in this paper and the problem of selecting an optimal next release is shown to be NP-hard. The use of various modem heuristics to find a high quality but possibly suboptimal solution is described. Comparative studies of these heuristics are given for various test cases. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:883 / 890
页数:8
相关论文
共 11 条
[1]  
[Anonymous], 1972, COMPLEXITY COMPUTER
[2]  
Bixby RE, 2000, INT FED INFO PROC, V46, P19
[3]  
DRAKOS N, SEMINAL NETWORK
[4]   GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES [J].
FEO, TA ;
RESENDE, MGC .
JOURNAL OF GLOBAL OPTIMIZATION, 1995, 6 (02) :109-133
[5]  
GELLAT CD, 1983, SCIENCE, V220, P671
[6]  
GLOVER F, 1989, ORSA J COMPUTING
[7]  
GLOVER F, 1990, ORSA J COMPUTING
[8]   CONVERGENCE OF AN ANNEALING ALGORITHM [J].
LUNDY, M ;
MEES, A .
MATHEMATICAL PROGRAMMING, 1986, 34 (01) :111-124
[9]  
MANIEZZO V, 1996, IEEE T SYSTEMS MAN B
[10]   EQUATION OF STATE CALCULATIONS BY FAST COMPUTING MACHINES [J].
METROPOLIS, N ;
ROSENBLUTH, AW ;
ROSENBLUTH, MN ;
TELLER, AH ;
TELLER, E .
JOURNAL OF CHEMICAL PHYSICS, 1953, 21 (06) :1087-1092