IBM®
Skip to main content
    Country/region [change]    Terms of use
 
 
 
    Home    Products    Services & solutions    Support & downloads    My account    

IBM Journal of Research and Development
Business Optimization   Volume 51, Number 3/4, 2007
Table of contents: HTMLPDF This article: HTMLPDF   Copyright info

Workforce optimization: Identification and assignment of professional workers using constraint programming - References

 by Y. Naveh,
Y. Richter,
Y. Altshuler,
D. L. Gresh,
and D. P. Connors
References

  1. R. Cerulli, M. Gaudioso, and R. Mautone, “A Class of Manpower Scheduling Problems,” Math. Methods Oper. Res. 36, No. 1, 93–105 (1992).
  2. D. Lesaint, C. Voudouris, N. Azarmi, I. Alletson, and B. Laithwaite, “A Field Workforce Scheduling,” BT Technol. J. 21, No. 4, 23–26 (2004).
  3. R. L. Kliem and H. B. Anderson, “Teambuilding Styles and Their Impact on Project Management Results,” Project Manage. J. 27, No. 1, 41–50 (1996).
  4. G. Eitzen, D. Panton, and G. Mills, “Multi-Skilled Workforce Optimisation,” Ann. Oper. Res. 127, No. 1/4, 359–372 (2004).
  5. R. Dechter, Constraint Processing, Morgan Kaufmann Publishers, San Francisco, CA, 2004.
  6. R. Yang, “Solving a Workforce Management Problem with Constraint Programming,” Proceedings of the 2nd International Conference on the Practical Application of Constraint Technology, London, U.K., 1996, pp. 373–387.
  7. D. L. Gresh, D. P. Connors, J. P. Fasano, and R. J. Wittrock, “Applying Supply Chain Optimization Techniques to Workforce Planning Problems,” IBM J. Res. & Dev. 51, No. 3/4, 251–261 (2007, this issue).
  8. D. Gilat, A. Landau, A. Ribak, Y. Shiloach, and S. Wasserkrug, “SWOPS (Shift Work Optimized Planning and Scheduling),” Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, Czech Republic, 2006, pp. 518–523.
  9. R. Nanda and J. Browne, Introduction to Employee Scheduling, Van Nostrand Reinhold, New York, 1992.
  10. J. P. van den Berg and D. M. Panton, “Personnel Shift Assignment: Existence Conditions and Network Models,” Networks 24, No. 7, 385–394 (1994).
  11. A. S. Appelblad and S. Lönn, “A Study of Workforce Arrangement,” Master's Thesis, Department of Informatics, Göteborg University, Göteborg, Sweden, 2004.
  12. A. T. Ernst, H. Jiang, M. Krishnamoorthy, and D. Sier, “Staff Scheduling and Rostering: A Review of Applications, Methods, and Models,” Euro. J. Oper. Res. 153, No. 1, 3–27 (2004).
  13. E. K. Burke and E. Soubeiga, “A Real-World Workforce Scheduling Problem in the Hospitality Industry: Theoretical Models and Algorithmic Methods” see http://webhost.ua.ac.be/eume/workshops/reallife/burke.pdf.
  14. T. H. Hultberg and D. M. Cardoso, “The Teacher Assignment Problem: A Special Case of the Fixed Charge Transportation Problem,” Euro. J. Oper. Res. 101, No. 3, 463–473 (1997).
  15. S. E. Bechtold, M. J. Brusco, and M. Showalter, “A Comparative Evaluation of Labor Tour Scheduling Methods,” Decision Sci. 22, No. 4, 683–699 (1991).
  16. H. K. Alfares, “Optimum Workforce Scheduling Under the (14, 21) Days-Off Timetable,” J. Appl. Math. & Decision Sci. 6, No. 3, 191–199 (2002).
  17. A. Billionnet, “Integer Programming to Schedule a Hierarchical Workforce with Variable Demands,” Euro. J. Oper. Res. 114, No. 1, 105–114 (1999).
  18. J. C. Beck, P. Prosser, and E. Selensky, “Vehicle Routing and Job Shop Scheduling: What's the Difference?,” Proceedings of the 13th International Conference on Automated Planning and Scheduling, Trenton, Italy, 2003; see http://tidel.mie.utoronto.ca/pubs/icaps03.pdf.
  19. B. Cao and G. Uebe, “Solving Transportation Problems with Nonlinear Side Constraints with Tabu Search,” Computers & Oper. Res. 22, No. 6, 593–603 (1995).
  20. M. Sun, J. E. Aronson, P. G. McKeown, and D. Drinka, “A Tabu Search Heuristic Procedure for the Fixed Charge Transportation Problem,” Euro. J. Oper. Res. 106, No. 2, 441–456 (1998).
  21. U. Aickelin and K. A. Dowsland, “Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem,” J. Scheduling 3, No. 3, 139–153 (2000).
  22. F. F. Easton and N. Mansour, “A Distributed Genetic Algorithm for Employee Staffing and Scheduling Problems,” Proceedings of the 5th International Conference on Genetic Algorithms, Urbana-Champaign, IL, 1993, pp. 360–367.
  23. A. Wren and D. O. Wren, “A Genetic Algorithm for Public Transport Driver Scheduling,” Computers & Oper. Res. 22, No. 1, 101–110 (1995).
  24. D. K. W. Chiu, S. C. Cheung, and H.-F. Leung, “A Multi-Agent Infrastructure for Mobile Workforce Management in a Service Oriented Enterprise,” Proceedings of the 38th Annual Hawaii International Conference on System Sciences, Big Island, HI, 2005, p. 85.3.
  25. P. Cowling, G. Kendall, and E. Soubeiga, “A Parameter-Free Hyperheuristic for Scheduling a Sales Summit,” Proceedings of the 4th Metaheuristics International Conference, Porto, Portugal, 2001, pp. 127–131.
  26. D. Munaf and B. Tester, “And/Or Parallel Programming in Practice,” Technical Report WP12:1203, British Telecom Research Laboratory, Project 1251, London, U.K., 1993.
  27. E. Tsang and C. Voudouris, “Fast Local Search and Guided Local Search and Their Application to British Telecom's Workforce Scheduling Problem,” Oper. Res. Lett. 20, No. 3, 119–127 (1997).
  28. F. Kokkoras and S. Gregory, “D-WMS: Distributed Workforce Management Using CLP,” Proceedings of the 4th International Conference on the Practical Application of Constraint Technology, London, U.K., 1998, pp. 129–146.
  29. A. Meisels and N. Lusternik, “Experiments on Networks of Employee Timetabling Problems,” Proceedings of the 2nd International Conference on the Practice and Theory of Automated Timetabling, selected papers, Toronto, Canada, 1997, pp. 130–141.
  30. P. Van Hentenryck, L. Michel, and Y. Deville, Numerica: A Modeling Language for Global Optimization, MIT Press, Cambridge, MA, 1997.
  31. P. Van Hentenryck, The OPL Optimization Programming Language, MIT Press, Cambridge, MA, 1999.
  32. A. Mackworth, “Consistency in Networks of Relations,” Artif. Intell. 8, No. 1, 99–118 (1977).
  33. H. H. Hoos and T. Stützle, Stochastic Local Search: Foundations and Applications, Morgan Kaufmann Publishing, San Francisco, CA, 2004.
  34. G. Verfaillie and N. Jussien, “Constraint Solving in Uncertain and Dynamic Environments: A Survey,” Constraints 10, No. 3, 253–281 (2005).
  35. P. Meseguer, N. Bouhmala, T. Bouzoubaa, M. Irgens, and M. Sanchez, “Current Approaches for Solving Over-Constrained Problems,” Constraints 8, No. 1, 9–39 (2003).
  36. A. Borning, B. Freeman-Benson, and M. Wilson, “Constraint Hierarchies,” Lisp Symbol. Computation 5, No. 1, 223–270 (1992).
  37. R. Barták, “Constraint Programming: In Pursuit of the Holy Grail,” Proceedings of the Week of Doctoral Students, Prague, Czech Republic, June 1999, pp. 555–564.
  38. M. Wallace, “Practical Applications of Constraint Programming,” Constraints 1, No. 1/2, 139–168 (1996).
  39. I. E. Sutherland, “Sketchpad: A Man–Machine Graphical Communication System,” Proceedings of the SHARE Design Automation Workshop, Annual ACM–IEEE Design Automation Conference, 1964, pp. 6.329–6.346.
  40. A. Borning, “The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory,” ACM Trans. Programming Lang. & Syst. 3, No. 4, 252–387 (1981).
  41. D. L. Waltz, “Understanding Line Drawings of Scenes with Shadows,” Psychol. Computer Vision, P. H. Winston, Editor, McGraw-Hill, New York, 1975.
  42. K. P. Chow and M. Perrett, “Airport Counter Allocation Using Constraint Logic Programming,” Proceedings of the 3rd International Conference on Practical Application of Constraint Technology, London, U.K., 1997.
  43. M. Perett, “Using Constraint Logic Programming Techniques in Container Port Planning,” ICL Tech. J. 7, No. 33, 537–545 (1991).
  44. G. Hasle, R. C. Haut, B. S. Johansen, and T. S. Ølberg, “Well Activity Scheduling—An Application of Constraint Reasoning”; see http://www.ilog.com/products/optimization/tech/custpapers/sintef.pdf.
  45. J. Adhikary, G. Hasle, and G. Misund, “Constraint Technology Applied to Forest Treatment Scheduling,” Proceedings of the 3rd International Conference on the Practical Application of Constraint Technology, London, U.K., 1997; see http://www.cs.sfu.ca/research/groups/ISL/papers/adhikary-etal-PACT.pdf.
  46. J. Bellone, A. Chamard, and C. Pradelles, “PLANE: An Evolutive Planning System for Aircraft Production,” Proceedings of the 1st International Conference on Practical Application of Prolog, London, U.K., 1992.
  47. T. Creemers, L. R. Giralt, J. Riera, C. Ferrarons, J. Rocca, and X. Corbella, “Constraint-Based Maintenance Scheduling on an Electric Power-Distribution Network,” Proceedings of the 3rd International Conference on Practical Applications of Prolog, Paris, France, 1995, pp. 135–144.
  48. T. Frühwirth and P. Brisset, “Optimal Placement of Base Stations in Wireless Indoor Telecommunication,” Proceedings of Principles and Practices of Constraint Programming, Pisa, Italy, 1998, pp. 476–480.
  49. A. Brodsky, J. Jaffar, and M. J. Maher, “Toward Practical Query Evaluation for Constraint Databases,” Constraints 2, No. 3/4, 279–304 (1997).
  50. P. C. Kanellakis and D. Q. Goldin, “Constraint Programming and Database Query Languages,” Theoretical Aspects of Computer Software, J. C. Mitchell and M. Hagiya, Editors, Springer-Verlag, Berlin, Germany, 1994, pp. 96–120.
  51. B. Beizer, Software Testing Techniques, Van Nostrand Reinhold Co., New York, 1990.
  52. C. Brzoska, “Temporal Logic Programming and Its Relation to Constraint Logic Programming,” Proceedings of the International Symposium on Logic Programming, San Diego, CA, 1991, pp. 661–677.
  53. A. P. Sistla, M. Y. Vardi, and P. Wolper, “The Complementation Problem for Buchi Automata with Applications to Temporal Logic,” Theoret. Computer Sci. 49, 217–237 (1987).
  54. Y. Naveh, M. Rimon, I. Jaeger, Y. Katz, M. Vinov, E. Marcus, and G. Shurek, “Constraint-Based Random Stimuli Generation for Hardware Verification,” AI Magazine, in press.
  55. E. Tsang and C. Voudouris, “Constraint Satisfaction in Discrete Optimisation,” presented at the UNICOM Seminar, 1998; see http://www.cs.essex.ac.uk/CSP/papers/TsaVou-GLSOpt-Unicom98.pdf.
  56. T. Walsh, “Reformulating Propositional Satisfiability as Constraint Satisfaction,” Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation, Horseshoe Bay, TX, 2000, pp. 233–246.
  57. W.-J. van Hoeve, “Operations Research Techniques in Constraint Programming,” Ph.D. dissertation, University of Amsterdam, Institute for Logic, Language, and Computation, Amsterdam, The Netherlands, 2005.
  58. N. Barnier and P. Brisset, “Graph Coloring for Air Traffic Flow Management,” Proceedings of the International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems,” LeCroisic, France, 2002, pp. 133–147.
  59. M. Gronkvist, “A Constraint Programming Model for Tail Assignment,” Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems,” Nice, France, 2004, pp. 142–156.
  60. E. Tsang, J. Ford, P. Mills, R. Williams, and P. Scott, “ZDC-Rostering: A Personnel Scheduling System Based on Constraint Programming,” Technical Report CSM-406, University of Essex, Department of Computer Science, Essex, U.K., 2004.
  61. Y. Richter, A. Freund, and Y. Naveh, “Generalizing AllDifferent: The SomeDifferent Constraint,” Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science 4204, 468–483 (2006).
  62. J.-C. Régin, “A Filtering Algorithm for Constraints of Difference in CSPs,” Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, 1994, pp. 362–367.


    About IBM    Privacy    Contact