TY - GEN
T1 - RAPTOR
T2 - 2019 IEEE International Conference on Software Maintenance and Evolution, ICSME 2019
AU - Kashiwa, Yutaro
N1 - Funding Information:
ACKNOWLEDGMENT I would like to express my gratitude to my supervisor Masao Ohira, who is guiding me throughout my Ph.D. program. This research is conducted as part of Grant-in-Aid for Japan Society for the Promotion of Science Research Fellow and Scientific Research (JP17J03330).
Publisher Copyright:
© 2019 IEEE.
PY - 2019/9
Y1 - 2019/9
N2 - Over a decade, many bug assignment methods have been proposed in order to assist developers to read bug reports submitted daily and numerously, and to assign an appropriate developer. However, they tend to concentrate their assignments on a small number of particular developers. Applying the methods to the projects which have releases would reduce the number of bugs that developers can fix by the next release date because the time that developers can devote to bug-fixing is limited. In this study, we propose the release-aware bug-fixing task assignment method to mitigate the task concentration and increase the number of bugs that developers can fix by the next release date. This method employs mathematical programming to find the best combination at project level while the traditional methods find the best pair of a bug and a developer (at individual level).
AB - Over a decade, many bug assignment methods have been proposed in order to assist developers to read bug reports submitted daily and numerously, and to assign an appropriate developer. However, they tend to concentrate their assignments on a small number of particular developers. Applying the methods to the projects which have releases would reduce the number of bugs that developers can fix by the next release date because the time that developers can devote to bug-fixing is limited. In this study, we propose the release-aware bug-fixing task assignment method to mitigate the task concentration and increase the number of bugs that developers can fix by the next release date. This method employs mathematical programming to find the best combination at project level while the traditional methods find the best pair of a bug and a developer (at individual level).
UR - http://www.scopus.com/inward/record.url?scp=85077206183&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85077206183&partnerID=8YFLogxK
U2 - 10.1109/ICSME.2019.00101
DO - 10.1109/ICSME.2019.00101
M3 - Conference contribution
AN - SCOPUS:85077206183
T3 - Proceedings - 2019 IEEE International Conference on Software Maintenance and Evolution, ICSME 2019
SP - 629
EP - 633
BT - Proceedings - 2019 IEEE International Conference on Software Maintenance and Evolution, ICSME 2019
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 30 September 2019 through 4 October 2019
ER -