About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SOLI 2007
Conference paper
Optimatch: Applying constraint programming to workforce management of highly-skilled employees
Abstract
Today many companies face the challenge of matching highly-skilled professionals to high-end positions in large organizations 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 (OR) methods fail to answer this problem, we employ Constraint Programming (CP), a subfield of Artificial Intelligence with strong algorithmic foundations. Our CP model builds on new constraint propagators designed for this problem (but applicable elsewhere), as well as on information retrieval methods used for analyzing the complex text describing high-end professionals and positions. Optimatch, which is based on this technology and is being used by IBM services organizations, provides strong experimental results. © 2007 IEEE.