2598. Assigning new employees to positions
Invited abstract in session WC-12: Workforce assignment, stream Scheduling and Project Management.
Wednesday, 12:30-14:00Room: Clarendon SR 1.02
Authors (first author is the speaker)
| 1. | Leon Jendraszewski
|
| Mathematics, Technical University of Munich | |
| 2. | Andreas Wiese
|
| Mathematics, Technical University of Munich |
Abstract
We study the problem of assigning new employees to (partially) vacant positions which arises in the human resources departments of larger public institutions. In particular, our colleagues from the administration of the School of Computation, Information, and Technology (CIT) at the Technical University of Munich need to solve it on a regular basis. When assigning a new employee to position(s), one needs to consider aspects like the pay scale of the new employee, the pay scales of the available positions, which groups of positions they belong to, and other factors. In particular, we may need to partially assign several positions to a new employee, and this assignment may change over time, e.g., because some positions are already assigned during certain time intervals. Therefore, this problem can be seen as a scheduling problem on machines with non-availability periods. We present several MIP-formulations and fast combinatorial algorithms for practically relevant special cases which exploit several insights into the problem that we derive. Those form the backbone of a tool we developed to solve this problem in practice; our tool is now used by our colleagues from the administration of the CIT.
Keywords
- Human Resources Management
- Combinatorial Optimization
- Programming, Mixed-Integer
Status: accepted
Back to the list of papers