Optimatch: Applying Constraint Programming to Workforce Management of Highly-skilled Employees

Yossi Richter, Y. Naveh, D. Gresh, D. Connors
{"title":"Optimatch: Applying Constraint Programming to Workforce Management of Highly-skilled Employees","authors":"Yossi Richter, Y. Naveh, D. Gresh, D. Connors","doi":"10.1109/SOLI.2007.4383953","DOIUrl":null,"url":null,"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.","PeriodicalId":154053,"journal":{"name":"2007 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Conference on Service Operations and Logistics, and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOLI.2007.4383953","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

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.
优化匹配:约束规划在高技能员工劳动力管理中的应用
如今,许多公司都面临着将高技能专业人员与大型组织和人力部署机构的高端职位相匹配的挑战。与传统的劳动力管理问题(如轮班调度)不同,高技能员工在专业上彼此区分,因此不可互换。我们的工作主要集中在服务行业,其中大部分收入来自高度专业的工人的分配。在这里,不准确的匹配可能会导致重大的金钱损失和其他负面影响。我们需要处理大量的职位和员工,在动态环境中快速做出最佳决策。由于传统的运筹学(OR)方法无法回答这个问题,我们采用约束规划(CP),这是人工智能的一个分支领域,具有强大的算法基础。我们的CP模型建立在为这个问题设计的新的约束传播器(但也适用于其他地方),以及用于分析描述高端专业人员和职位的复杂文本的信息检索方法之上。IBM服务组织正在使用基于该技术的Optimatch,它提供了强有力的实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信