The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Software testing techniques (2nd ed.)
Software testing techniques (2nd ed.)
Lisp and Symbolic Computation
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A genetic algorithm for public transport driver scheduling
Computers and Operations Research - Special issue on genetic algorithms
Solving transportation problems with nonlinear side constraints with tabu search
Computers and Operations Research
The OPL optimization programming language
The OPL optimization programming language
The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Genetic Algorithm for Employee Staffing and Scheduling Problems
Proceedings of the 5th International Conference on Genetic Algorithms
Constraint Programming and Database Query Languages
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Experiments on Networks of Employee Timetabling Problems
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Sketch pad a man-machine graphical communication system
DAC '64 Proceedings of the SHARE design automation workshop
Constraint Processing
BT Technology Journal
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
A Multi-Agent Infrastructure for Mobile Workforce Management in a Service Oriented Enterprise
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3 - Volume 03
Applying supply chain optimization techniques to workforce planning problems
IBM Journal of Research and Development - Business optimization
Generalizing alldifferent: the somedifferent constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Applying supply chain optimization techniques to workforce planning problems
IBM Journal of Research and Development - Business optimization
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Leveraging social networks for corporate staffing and expert recommendation
IBM Journal of Research and Development
Applying constraint programming to identification and assignment of service professionals
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Effective decision support systems for workforce deployment
IBM Journal of Research and Development
Scheduling mobile collaborating workforce for multiple urgent events
Journal of Network and Computer Applications
The big deal: applying constraint satisfaction technologies where it makes the difference
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Identifying unreliable sources of skill and competency information
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Inferring and validating skills and competencies over time
Applied Ontology
Hi-index | 0.00 |
Matching highly skilled people to available positions is a high-stakes task that requires careful consideration by experienced resource managers. A wrong decision may result in significant loss of value due to understaffing, underqualification or overqualification of assigned personnel, and high turnover of poorly matched workers. While the importance of quality matching is clear, dealing with pools of hundreds of jobs and resources in a dynamic market generates a significant amount of pressure to make decisions rapidly. We present a novel solution designed to bridge the gap between the need for high-quality matches and the need for timeliness. By applying constraint programming, a subfield of artificial intelligence, we are able to deal successfully with the complex constraints encountered in the field and reach near-optimal assignments that take into account all resources and positions in the pool. The considerations include constraints on job role, skill level, geographical location, language, potential retraining, and many more. Constraints are applied at both the individual and team levels. This paper introduces the technology and then describes its use by IBM Global Services, where large numbers of service and consulting employees are considered when forming teams assigned to customer projects.