Skip to main content

Applying Constraint Programming to Identification and Assignment of Service Professionals

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6308))

Abstract

Today many companies face the challenge of matching highly-skilled professionals to high-end positions in large organizations and human deployment agencies. Non-accurate matches in these businesses can result in significant monetary losses and other negative effects. Unlike traditional Workforce Management (WM) problems such as shift scheduling, highly-skilled employees are professionally distinguishable from each other and hence non-interchangeable. Therefore, the techniques used for shift-scheduling can’t be applied to the highly-skilled WM domain. Our work focuses on providing a Constraint Programming solution for supporting the assignment of highly-skilled professionals. Our experience shows that CP is well adapted to this problem. CP supports very well the underlying constraints. In addition, the rich expressive language supported by CP allows us to provide a convenient mechanism for changing and adding new matching and preference constraints. Based on this technology, we have built a tool that is currently being used by IBM service organizations and provides strong business results.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Naveh, Y., Rimon, M., Jaeger, I., Katz, Y., Vinov, M., Marcus, E., Shurek, G.: Constraint-based random stimuli generation for hardware verification. AI Magazine 28, 13–30 (2007)

    Google Scholar 

  2. Naveh, Y., Richter, Y., Altshuler, Y., Gresh, D.L., Connors, D.P.: Workforce optimization: Identification and assignment of professional workers using constraint programming. IBM J. Res. and Dev. 51(3), 263–279 (2007)

    Article  Google Scholar 

  3. Richter, Y., Naveh, Y., Gresh, D.L., Connors, D.P.: Optimatch: Applying constraint programming to workforce management of highly-skilled employees. In: IEEE/INFORMS International Conference on Service Operations and Logistics, and Informatics (SOLI), pp. 173–178 (2007)

    Google Scholar 

  4. Gilat, D., Landau, A., Ribak, A., Shiloach, Y., Wasserkrug, S.: Swops– shift work optimized planning and scheduling. In: Proc. 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT), pp. 518–523 (2006)

    Google Scholar 

  5. Gresh, D.L., Connors, D.P., Fasano, J.P., Wittrock, R.: Applying supply chain optimization techniques to workforce planning problems. IBM J. Res. and Dev. 51(3), 251–261 (2007)

    Article  Google Scholar 

  6. Munaf, D., Tester, B.: And/or parallel programming in practice. Technical Report WP12:1203, British Telecom Research Lab, London, UK (1993)

    Google Scholar 

  7. Yang, R.: Solving a workforce management problem with constraint programming. In: The 2nd International Conference on the Practical Application of Constraint Technology, pp. 373–387 (1996)

    Google Scholar 

  8. Metivier, J., Boizumault, P., Loudni, S.: Solving nurse rostering problems using soft global constraints. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 73–87. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: Minizinc: Towards a standard cp modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. van Hentenryck, P.: The OPL optimization programming language, Cambridge, MA, USA (1999)

    Google Scholar 

  11. Dechter, R.: Constraint Processing. Elsevier Scinece, Amsterdam (2003)

    Google Scholar 

  12. Richter, Y., Freund, A., Naveh, Y.: Generalizing alldifferent: The somedifferent constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 468–483. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asaf, S. et al. (2010). Applying Constraint Programming to Identification and Assignment of Service Professionals. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15396-9_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15395-2

  • Online ISBN: 978-3-642-15396-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics