An application of a generalised assignment problem: assigning recruiters to geographical locations Online publication date: Sat, 09-May-2015
by Alan McKendall; Wafik Iskander; Sherron McKendall; Ann Chester
International Journal of Operational Research (IJOR), Vol. 22, No. 1, 2015
Abstract: In order to increase the number of underrepresented students pursuing college degrees in health sciences fields in the state of West Virginia, the Health Sciences and Technology Academy (HSTA), a pre-college enrichment programme, was established. Due to a limited budget, a limited number of recruiters are available to recruit as many West Virginia High School students who satisfy the programme's selection criteria. As a result, recruiters are assigned to geographical locations (populations of potential HSTA students) such that the total value of the student populations assigned is maximised with respect to the programme selection criteria. This problem is defined as a generalised assignment problem (GAP), since more than one student population can be assigned to a recruiter such that the capacity of the recruiter is not exceeded. In this paper, a mathematical model, a construction algorithm, and a tabu search heuristic are presented for the proposed GAP.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook