Document Type
Lecture
Publication Date
9-18-2003
Abstract
The problem of assigning workers to jobs is discussed. The workers list desirable job choices and the jobs list desirable worker candidates. These lists are incomplete lists as it is infeasible that a particular worker has information about the complete list of jobs available in many real world situations. It is useful to determine which job-worker pairs are desirable so that assignments may be made. An approach to determining the most desirable job-worker matches is presented. A particular application of the approach to the Naval Personnel Assignment problem is discussed. This approach is computationally feasible for large problems and can be implemented in high level languages such as Matlab.
Relational Format
presentation
Recommended Citation
Reid, James, "Job Assisgnment Problems" (2003). Combinatorics Seminar. 112.
https://egrove.olemiss.edu/math_combinatorics/112
