The Dynamics of Software Project Staffing: A System Dynamics Based Simulation Approach
IEEE Transactions on Software Engineering
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Genetic Algorithms for Project Management
Annals of Software Engineering
Job Shop Scheduling with Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
CMMI Guidlines for Process Integration and Product Improvement
CMMI Guidlines for Process Integration and Product Improvement
Software Requirements
Scheduling Software Projects to Minimize the Development Time and Cost with a Given Staff
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Making Resource Decisions for Software Projects
Proceedings of the 26th International Conference on Software Engineering
ICSM '05 Proceedings of the 21st IEEE International Conference on Software Maintenance
Supporting Software Release Planning Decisions for Evolving Systems
SEW '05 Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop
Emphasizing Human Capabilities in Software Development
IEEE Software
Hybrid Intelligence in Software Release Planning
International Journal of Hybrid Intelligent Systems
The Current State and Future of Search Based Software Engineering
FOSE '07 2007 Future of Software Engineering
Software product release planning through optimization and what-if analysis
Information and Software Technology
Optimized Resource Allocation for Software Release Planning
IEEE Transactions on Software Engineering
Value-Based Multiple Software Projects Scheduling with Genetic Algorithm
ICSP '09 Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes
Optimized assignment of developers for fixing bugs an initial evaluation for eclipse projects
ESEM '09 Proceedings of the 2009 3rd International Symposium on Empirical Software Engineering and Measurement
Information and Software Technology
Simulating worst case scenarios and analyzing their combined effect in operational release planning
ICSP'08 Proceedings of the Software process, 2008 international conference on Making globally distributed software development a success story
Evaluation of optimized staffing for feature development and bug fixing
Proceedings of the 2010 ACM-IEEE International Symposium on Empirical Software Engineering and Measurement
Cooperative co-evolutionary optimization of software project staff assignments and job scheduling
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Search-based software engineering: Trends, techniques and applications
ACM Computing Surveys (CSUR)
Exact scalable sensitivity analysis for the next release problem
ACM Transactions on Software Engineering and Methodology (TOSEM)
Hi-index | 0.00 |
Release planning for incremental software development assignsfeatures to releases such that technical, resource, risk and budgetconstraints are met. Each feature offers a piece of functionality.A feature can be offered as part of a release only if all itsnecessary tasks are done before the given release date. These tasksrequire different skills. Staffing for product releases asconsidered in this paper is the process of assigning humanresources from a given pool of developers who might have varyinglevels of skill to perform different tasks. In addition to that, weconsider time windows of absence of the developers. The primarygoal of staffing is to provide product releases of best qualitywhere quality means offering the most attractive features tocustomers in a timely manner. We call the problem STAFF-PRO. Theproblem is known to be NP-complete. Consequently, we have to besatisfied with solutions that are sufficiently good, but notnecessarily optimal in the case of mid-sized or large problems.Search-based methods relying on meta-heuristics have been proven tobe successful in similar contexts. In this research, a focusedsearch (FS) method is presented. This refers to a two-phasedsolution approach where Phase 1 applies integer linear programmingto a relaxed version of the full problem. Its solution is used as astarting point to perform FS in a reduced search space in Phase 2.The search itself is conducted by a genetic algorithm. It generatesa solution that fulfills all the stated resource and schedulingconstraints and is of a proven degree of optimality. We performedan empirical analysis of the proposed solution approach bycomparing FS and unfocused search (UFS) (without Phase 1) for aseries of 200 test examples. On average, FS performs about 15%better than UFS. The whole method was applied as an industrial casestudy performed at Chartwell Technology. The case studydemonstrates that application of the FS method to STAFF-PRO (i)allows a reduction in the time needed for generating acceptablestaffing plans, (ii) generates plans of proven quality that arebetter than manual plans and (iii) supports the various types ofre-planning necessary for varying parameters, budgets and resource.Copyright © 2008 John Wiley & Sons, Ltd.