{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:08:54Z","timestamp":1742378934109,"version":"3.37.3"},"reference-count":29,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T00:00:00Z","timestamp":1222128000000},"content-version":"vor","delay-in-days":22,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Softw. Maint. Evol.: Res. Pract."],"published-print":{"date-parts":[[2008,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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\u2010PRO. The problem is known to be NP\u2010complete. Consequently, we have to be satisfied with solutions that are sufficiently good, but not necessarily optimal in the case of mid\u2010sized or large problems. Search\u2010based methods relying on meta\u2010heuristics have been proven to be successful in similar contexts. In this research, a focused search (FS) method is presented. This refers to a two\u2010phased 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\u2010PRO (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\u2010planning necessary for varying parameters, budgets and resource. Copyright \u00a9 2008 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/smr.379","type":"journal-article","created":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T11:49:13Z","timestamp":1278676153000},"page":"365-386","source":"Crossref","is-referenced-by-count":17,"title":["Optimized staffing for product releases and its application at Chartwell Technology"],"prefix":"10.1002","volume":"20","author":[{"given":"Puneet","family":"Kapur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Ngo\u2010The","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther","family":"Ruhe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2008,11,19]]},"reference":[{"volume-title":"Software Requirements","year":"2003","author":"Wiegers K","key":"e_1_2_1_2_2"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.3233\/HIS-2004-11-212","article-title":"Hybrid intelligence in software release planning","volume":"1","author":"Ruhe G","year":"2004","journal-title":"Hybrid Intelligent Systems"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2007.10.017"},{"key":"e_1_2_1_5_2","unstructured":"SaliuO RuheG.Supporting software release planning decisions for evolving systems. Proceedings of the 29th IEEE\/NASA Software Engineering Workshop April 2005."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2006.47"},{"key":"e_1_2_1_7_2","unstructured":"Ngo\u2010TheA RuheG.Optimized resource allocation for software release planning. IEEE Transactions on Software Engineering2008; accepted for publication."},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010Completeness","year":"1979","author":"Garey M","key":"e_1_2_1_8_2"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2005.137"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"PadbergF.Scheduling software projects to minimize the development time and cost with a given staff. Software Engineering Conference APSEC 2001 Eighth Asia\u2010Pacific 2001;187\u2013194.","DOI":"10.1109\/APSEC.2001.991476"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-sen:20030559"},{"volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","year":"1989","author":"Goldberg DE","key":"e_1_2_1_12_2"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"HarmanM.The current state and future of search based software engineering. International Conference on Software Engineering ICSE 2007 Series on the Future of Software Engineering 2007;342\u2013357.","DOI":"10.1109\/FOSE.2007.29"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012543203763"},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"AntoniolG PentaMD HarmanM.Search\u2010based techniques applied to optimization of project planning for a massive maintenance project. IEEE International Conference on Software Maintenance ICSM Budapest 2005;240\u2013252.","DOI":"10.1109\/ICSM.2005.79"},{"key":"e_1_2_1_18_2","unstructured":"ChicanoF AlbaE.Management of software projects with gas. Sixth Meta\u2010heuristics International Conference MIC2005 2005."},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.21738"},{"key":"e_1_2_1_20_2","doi-asserted-by":"crossref","unstructured":"FentonN MarshW NeilM CatesP ForeyS TailorT.Making resource decisions for software projects. Twenty\u2010sixth International Conference on Software Engineering (ICSE 2004) May 2004;397\u2013406.","DOI":"10.1109\/ICSE.2004.1317462"},{"key":"e_1_2_1_21_2","unstructured":"JainAS MeeranS.A state\u2010of\u2010the\u2010art review of job\u2010shop scheduling techniques. Technical Report Department of Applied Physics Electronics and Mechanical Engineering University of Dundee Scotland 1998."},{"key":"e_1_2_1_22_2","unstructured":"DavisL.Job shop scheduling with genetic algorithms. In Proceedings of the International Conference on Genetic Algorithms and their Applications Grefenstette JJ (ed.). 1983;136\u2013140."},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C"},{"volume-title":"Knapsack Problems","year":"2003","author":"Kellerer H","key":"e_1_2_1_24_2"},{"volume-title":"Experimenting with Genetic Algorithms and Coupling Measures to Devise Optimal Integration Test Orders, Software Engineering with Computational Intelligence","year":"2003","author":"Briand L","key":"e_1_2_1_25_2"},{"key":"e_1_2_1_26_2","unstructured":"GALib.http:\/\/lancet.mit.edu\/ga\/[1 October2007]."},{"key":"e_1_2_1_27_2","unstructured":"EshelmanLJ SchafferJD.Preventing premature convergence in genetic algorithms by preventing incest. ICGA1991;115\u2013122."},{"key":"e_1_2_1_28_2","unstructured":"www.ilog.com[15 January2008]."},{"volume-title":"CMMI\u2014Guidelines for Process Integration and Product Improvement","year":"2006","author":"Chrissis MB","key":"e_1_2_1_29_2"},{"key":"e_1_2_1_30_2","unstructured":"Expert Decision Inc.www.releaseplanner.com[30 June2008]."}],"container-title":["Journal of Software Maintenance and Evolution: Research and Practice"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fsmr.379","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/smr.379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T20:07:00Z","timestamp":1740254820000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/smr.379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["10.1002\/smr.379"],"URL":"https:\/\/doi.org\/10.1002\/smr.379","archive":["Portico"],"relation":{},"ISSN":["1532-060X","1532-0618"],"issn-type":[{"type":"print","value":"1532-060X"},{"type":"electronic","value":"1532-0618"}],"subject":[],"published":{"date-parts":[[2008,9]]}}}