Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

An application of a generalised assignment problem: assigning recruiters to geographical locations

An application of a generalised assignment problem: assigning recruiters to geographical locations 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. Keywords: generalised assignment problem; GAP; tabu search; meta-heuristic; integer programme; adjacency constraint. Reference to this paper should be made as follows: McKendall, A., Iskander, W., McKendall, S. and Chester, A. (2015) `: assigning recruiters to geographical locations', Int. J. Operational Research, Vol. 22, No. 1, pp.31­47. Biographical notes: Alan McKendall is http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Operational Research Inderscience Publishers

An application of a generalised assignment problem: assigning recruiters to geographical locations

International Journal of Operational Research , Volume 22 – Jan 1, 2015
Download PDF
17 pages

Loading next page...
 
/lp/inderscience-publishers/an-application-of-a-generalised-assignment-problem-assigning-gxnHqVTEi6

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Publishers
ISSN
1745-7645
eISSN
1745-7653
DOI
10.1504/IJOR.2015.065938
Publisher site
See Article on Publisher Site

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. Keywords: generalised assignment problem; GAP; tabu search; meta-heuristic; integer programme; adjacency constraint. Reference to this paper should be made as follows: McKendall, A., Iskander, W., McKendall, S. and Chester, A. (2015) `: assigning recruiters to geographical locations', Int. J. Operational Research, Vol. 22, No. 1, pp.31­47. Biographical notes: Alan McKendall is

Journal

International Journal of Operational Research – Inderscience Publishers

Published: Jan 1, 2015

There are no references for this article.