mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Search-based resource scheduling for bug fixing tasks
Chinese Academy of Sciences, Beijing.
Blekinge Institute of Technology. (IS (Embedded Systems))ORCID iD: 0000-0003-0611-2655
2010 (English)In: Proceedings - 2nd International Symposium on Search Based Software Engineering, SSBSE 2010, 2010, 133-142 p.Conference paper, Published paper (Refereed)
Abstract [en]

The software testing phase usually results in a large number of bugs to be fixed. The fixing of these bugs require executing certain activities (potentially concurrent) that demand resources having different competencies and workloads. Appropriate resource allocation to these bug-fixing activities can help a project manager to schedule capable resources to these activities, taking into account their availability and skill requirements for fixing different bugs. This paper presents a multi-objective search-based resource scheduling method for bug-fixing tasks. The inputs to our proposed method include i) a bug model, ii) a human resource model, iii) a capability matching method between bug-fixing activities and human resources and iv) objectives of bug-fixing. A genetic algorithm (GA) is used as a searchalgorithm and the output is a bug-fixing schedule, satisfying different constraints and value objectives. We have evaluated our proposed scheduling method on an industrial data set and have discussed three different scenarios. The results indicate that GA is able to effectively schedule resources by balancing different objectives. We have also compared the effectiveness of using GA with a simple hill-climbing algorithm. The comparison shows that GA is able to achieve statistically better fitness values than hill-climbing.

Place, publisher, year, edition, pages
2010. 133-142 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-22277DOI: 10.1109/SSBSE.2010.24Scopus ID: 2-s2.0-79952053760ISBN: 978-076954195-2 (print)OAI: oai:DiVA.org:mdh-22277DiVA: diva2:661358
Conference
2nd International Symposium on Search Based Software Engineering, SSBSE 2010; Benevento; Italy; 7 October 2010 through 9 October 2010
Available from: 2013-11-03 Created: 2013-10-31 Last updated: 2013-12-03Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Afzal, Wasif
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 13 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf