Article ID: | iaor20097148 |
Country: | United Kingdom |
Volume: | 3 |
Issue: | 34 |
Start Page Number: | 258 |
End Page Number: | 270 |
Publication Date: | Nov 2008 |
Journal: | International Journal of Services Operations and Informatics |
Authors: | Richter Yossi, Naveh Yehuda, Gresh Donna L, Connors Daniel P |
Keywords: | programming: constraints, service |
Today many companies face the challenge of matching highly skilled professionals to high‐end positions in large organisations and human deployment agencies. Unlike traditional workforce management problems, such as shift scheduling, highly skilled employees are professionally distinguishable from each other and hence non‐interchangeable. Our work specifically focuses on the services industry, where much of the revenue comes from the assignment of highly professional workers. Here, non‐accurate matches may result in significant monetary losses and other negative effects. We deal with very large pools of both positions and employees, where optimal decisions should be made rapidly in a dynamic environment. Since traditional operations research methods fail to answer this problem, we employ Constraint Programming (CP), a subfield of Artificial Intelligence with strong algorithmic foundations.