Optimized staffing for product releases and its application at Chartwell Technology
Release planning for incremental software development assigns features to releases such that technical, resource, risk and budget constraints are met. Each feature offers a piece of functionality. A feature can be offered as part of a release only if all its necessary tasks are done before the given...
Gespeichert in:
Veröffentlicht in: | Journal of software maintenance and evolution 2008-09, Vol.20 (5), p.365-386 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Release planning for incremental software development assigns features to releases such that technical, resource, risk and budget constraints are met. Each feature offers a piece of functionality. A feature can be offered as part of a release only if all its necessary tasks are done before the given release date. These tasks require different skills. Staffing for product releases as considered in this paper is the process of assigning human resources from a given pool of developers who might have varying levels of skill to perform different tasks. In addition to that, we consider time windows of absence of the developers. The primary goal of staffing is to provide product releases of best quality where quality means offering the most attractive features to customers in a timely manner. We call the problem STAFF‐PRO. The problem is known to be NP‐complete. Consequently, we have to be satisfied with solutions that are sufficiently good, but not necessarily optimal in the case of mid‐sized or large problems. Search‐based methods relying on meta‐heuristics have been proven to be successful in similar contexts. In this research, a focused search (FS) method is presented. This refers to a two‐phased solution approach where Phase 1 applies integer linear programming to a relaxed version of the full problem. Its solution is used as a starting point to perform FS in a reduced search space in Phase 2. The search itself is conducted by a genetic algorithm. It generates a solution that fulfills all the stated resource and scheduling constraints and is of a proven degree of optimality. We performed an empirical analysis of the proposed solution approach by comparing FS and unfocused search (UFS) (without Phase 1) for a series of 200 test examples. On average, FS performs about 15% better than UFS. The whole method was applied as an industrial case study performed at Chartwell Technology. The case study demonstrates that application of the FS method to STAFF‐PRO (i) allows a reduction in the time needed for generating acceptable staffing plans, (ii) generates plans of proven quality that are better than manual plans and (iii) supports the various types of re‐planning necessary for varying parameters, budgets and resource. Copyright © 2008 John Wiley & Sons, Ltd. |
---|---|
ISSN: | 1532-060X 1532-0618 |
DOI: | 10.1002/smr.379 |