Record Details

Assignment of trainees to software project requirements: A stable matching based approach

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Assignment of trainees to software project requirements: A stable matching based approach
 
Creator GHAROTE, M
PATIL, R
LODHA, S
RAMAN, R
 
Subject RESOURCE-ALLOCATION
OPTIMIZATION
MODELS
CONSTRUCTION
ALGORITHMS
WORKFORCE
Workforce allocation
Stable matching
Information technology
Service management
Assignment problems survey
 
Description Greedy and optimization approaches used for assigning trainees to software project requirements can give rise to unstable pairs. The presence of unstable pairs can unnecessarily hamper both trainee and project requirement satisfaction. In this paper, we use the theory of stable matching to remove the unstable pairs. We propose an efficient method to predict preferences for both trainees and project requirements using the utility theory. Our computational experiments suggest that the stable matching approach performs better with average trainee and project requirement satisfaction in terms of the preference ranks of allocated choices. Compared to cost based optimization model, the proposed approach obtains significantly better trainee project match at the expense of small additional allocation cost. (C) 2015 Elsevier Ltd. All rights reserved.
 
Publisher PERGAMON-ELSEVIER SCIENCE LTD
 
Date 2016-01-14T13:20:37Z
2016-01-14T13:20:37Z
2015
 
Type Article
 
Identifier COMPUTERS & INDUSTRIAL ENGINEERING, 87,228-237
0360-8352
1879-0550
http://dx.doi.org/10.1016/j.cie.2015.05.017
http://dspace.library.iitb.ac.in/jspui/handle/100/17600
 
Language en