Font Size: a A A

Assigning Army recruiters: Personal preferences vs recruiting station requirements

Posted on:2001-10-05Degree:M.SType:Thesis
University:University of LouisvilleCandidate:Phlegar, Emory Everett, JrFull Text:PDF
GTID:2469390014454612Subject:Mathematics
Abstract/Summary:
Each month the Army assigns recruiters to recruiting stations across the country. Recruiting stations located in different areas of the country service different populations and usually desire recruiters that exhibit similar characteristics as their population. For example, a recruiter with a particular race, language ability and gender profile may be best suited to a particular region of the country. In addition, individual recruiters may have a preference as to which recruiting station they are assigned. This thesis addresses the problem of assigning recruiters to recruiting stations based on both the recruiters preference and the recruiting station's needs. The stable marriage problem is analogous to this recruiter assignment problem. A stable marriage algorithm was modified for this recruiter assignment problem.;This is the first attempt of any kind to assign recruiters to recruiting stations using an automated process. These modifications include determining which attributes to use in making assignments possible, implementing a weighting system to develop the Recruiting Station Choice Matrix and developing a method of ranking recruiting stations to create the Recruiter Choice Matrix.
Keywords/Search Tags:Recruiting, Recruiter, Choice matrix
Related items