A survey on workforce scheduling and routing problems

PATAT 2012 - Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling

Volumn , Issue , 2012, Pages 283-302

  Castillo Salazar, J Arturo ^a   Landa Silva, Dario ^a   Qu, Rong ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Employee rostering; Mobile workforce; Routing problems; Workforce scheduling

Indexed keywords

LOCATION; SURVEYS; TRANSPORTATION PERSONNEL;

IN-DEPTH UNDERSTANDING; SECURITY GUARDS; SOLUTION METHODS; WORKFORCE SCHEDULING;

SCHEDULING;

EID: 85057036578     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (54)

1. Akjiratikarl C, Yenradee P, Drake PR (2006) An improved particle swarm optimization algorithm for care worker scheduling. In: Proceedings of the 7th Asia Pacific Industrial Engineering and Management Systems Conference 2006, pp 457–466
2. Akjiratikarl C, Yenradee P, Drake PR (2007) Pso-based algorithm for home care worker scheduling in the uk. Computers & Industrial Engineering 53(4):559–583, DOI 10.1016/j.cie.2007.06.002
3. Alfares HK (2004) Survey, categorization and comparison of recent tour scheduling literature. Annals of Operations Research 127(1–4):145–175, DOI 10.1023/B:ANOR.0000019088.98647.e2
4. Baker KR (1976) Workforce allocation in cyclical scheduling problems: A survey. Journal of the Operational Research Society 27(1):155–167, DOI 10.1057/jors.1976.30
5. Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MW, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Operations Research 46(3):316–329, URL http://www.jstor.org/stable/222825
6. Begur SV, Miller DM, Weaver JR (1997) An integrated spatial dss for scheduling and routing home-health-care nurses. Interfaces 27(4):35–48, DOI 10.1287/inte.27.4.35
7. Bertels S, Fahle T (2006) A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Computers & Operations Research 33(10):2866–2890, DOI 10.1016/j.cor.2005.01.015
8. Blais M, Lapierre SD, Laporte G (2003) Solving a home-care districting problem in a urban setting. Journal of the Operational Research Society 54(11):1141–1147, DOI 10.1057/palgrave.jors.2601625
9. Borsani V, Matta A, Sommaruga F, Beschi G (2006) A home care scheduling model for human resources. In: Service Systems and Service Management, 2006 International Conference on, vol 1, pp 449–454, DOI 10.1109/ICSSSM.2006.320504
10. Bozkaya B, Erkut E, Laporte G (2003) A tabu search heuristic and adaptive memory procedure for political districting. European Journal of Operational Research 144(1):12–26, DOI 10.1016/S0377-2217(01)00380-0
11. Brandão J, Mercer A (1997) A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. European Journal of Operational Research 100(1):180–191, DOI 10.1016/S0377-2217(97)00010-6
12. Brandão J, Mercer A (1998) The multi-trip vehicule routing problem. Journal of the Operational Research Society 49(8):799–805, URL http://www.jstor.org/stable/3009960
13. Bredström D, Rönnqvist M (2007) A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. DOI 10.2139/ssrn.971726
14. Bredström D, Rönnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. European Journal of Operational Research 191(1):19–31, DOI 10.1016/j.ejor.2007.07.033
15. Cheang B, Li H, Lim A, Rodrigues B (2003) Nurse rostering problems–a bibliographic survey. European Journal of Operational Research 151(3):447–460, DOI 10.1016/S0377-2217(03)00021-3
16. Cheng E, Rich JL (1998) A home health care routing and scheduling problem. URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1268
17. Cordeau JF, Laporte G, Pasin F, Ropke S (2010) Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling 13(4):393–409, DOI 10.1007/s10951-010-0188-7
18. De Angelis V (1998) Planning home assistance for aids patients in the city of rome, italy. Interfaces 28(3):75–83, URL http://www.jstor.org/stable/25062377
19. Desaulniers G, Lavigne J, Soumis F (1998) Multi-depot vehicle scheduling problems with time windows and waiting costs. European Journal of Operational Research 111(3):479–494, DOI 10.1016/S0377-2217(97)00363-9
20. Desaulniers G, Desrosiers J, Solomon MM (eds) (2005) Column Generation. Springer
21. Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Operations research 40(2):342–354, DOI 10.1287/opre.40.2.342
22. Desrosiers J, Lübbecke ME (2005) A primer in column generation. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column Generation, Springer, chap 1, pp 1–32, DOI 10.1007/0-387-25486-2 1
23. Dohn A, Rasmussen MS, Justesen T, Larsen J (2008) The home care crew scheduling problem. In: Sheibani K (ed) Proceedings of the 1st International Conference on Applied Operational Research, Institute for Operational Research, System Design and Financial Services, Tadbir, Lecture Notes in Management Science, vol 1, pp 1–8
24. Dohn A, Kolind E, Clausen J (2009) The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. Computers & Operations Research 36(4):1145–1157, DOI 10.1016/j.cor.2007.12.011
25. Eaton SC (2003) if you can use them: Flexibility policies, organizational commitment, and perceived performance. Industrial Relations: A Journal of Economy and Society 42(2):145–167, DOI 10.1111/1468-232X.00285
26. Ernst A, Jiang H, Krishnamoorthy M, Sier D (2004) Staff scheduling and rostering: A review of applications, methods and models. European journal of operational research 153(1):3–27
27. Eveborn P, Flisberg P, Rönnqvist M (2006) Laps care – an operational system for staff planning of home care. European Journal of Operational Research 171(3):962–976, DOI 10.1016/j.ejor.2005.01.011
28. Eveborn P, Rönnqvist M, Einarsdóttir H, Eklund M, Lidén K, Almroth M (2009) Operations research improves quality and efficiency in home care. Interfaces 39(1):18–34, DOI 10.1287/inte.1080.0411
29. Feillet D (2010) A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR: A Quarterly Journal of Operations Research 8(4):407–424, DOI 10.1007/s10288-010-0130-z
30. Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Applications to some vehicle routing problems. Networks 44(3):216–229, DOI 10.1002/net.20033
31. Fischetti M, Polo C, Scantamburlo M (2004) A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. Networks 44(2):61–72, DOI 10.1002/net.20017
32. Fosgerau M, Engelson L (2011) The value of travel time variance. Transportation Research Part B: Methodological 45(1):1–8, DOI 10.1016/j.trb.2010.06.001
33. Golembiewski R, Proehl Jr C (1978) A survey of the empirical literature on flexible workhours: Character and consequences of a major innovation. Academy of Management Review 3(4):837–853, DOI http://www.jstor.org/stable/257938
34. Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column Generation, Springer, chap 2, pp 33–65, DOI 10.1007/0-387-25486-2 2
35. Itabashi G, Chiba M, Takahashi K, Kato Y (2006) A support system for home care service based on multi-agent system. In: Information, Communications and Signal Processing 2005 Fifth International Conference on, pp 1052–1056, DOI 10.1109/ICICS.2005.1689213
36. Jara-Díaz S (2000) Allocation and valuation of travel time savings. In: Hensher DA, Button KJ (eds) Handbook of transport modelling, vol 1, Emerald Group Publishing, chap 18, pp 303–318
37. Joslin DE, Clements DP (1999) Squeaky wheel optimization. Journal of Artificial Intelligence Research 10:353–373
38. Kallehauge B, Larsen J, Madsen OBG, Solomon MM (2005) Vehicle routing problem with time windows. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column Generation, Springer, chap 3, pp 67–98, DOI 10.1007/0-387-25486-2 3
39. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Neural Networks, 1995. Proceedings., IEEE International Conference on, IEEE, vol 4, pp 1942–1948, DOI 10.1109/ICNN.1995.488968
40. Kergosien Y, Lente C, Billaut JC (2009) Home health care problem, an extended multiple travelling salesman problem. In: Blazewicz J, Drozdowski M, Kendall G, McCollum B (eds) Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), pp 85–92, URL http://www.mistaconference.org/2009/papers/085092-110-P.pdf
41. Laarhoven PJM, Aarts EH (1987) Simulated Annealing: Theory and applications. Springer
42. Landa-Silva D, Wang Y, Donovan P, Kendall G (2011) Hybrid heuristic for multi-carrier transportation plans. In: Proceedins of the 9th Metaheuristics International Conference (MIC2011), pp 221–229
43. Li Y, Lim A, Rodrigues B (2005) Manpower allocation with time windows and job-teaming constraints. Naval Research Logistics 52(4):302–311, DOI 10.1002/nav.20075
44. Lim A, Rodrigues B, Song L (2004) Manpower allocation with time windows. Journal of the Operational Research Society 55:1178–1186, DOI 10.1057/palgrave.jors.2601782
45. Martínez-Sánchez A, Pérez-Pérez M, De-Luis-Carnicer P, Vela-Jiménez MJ (2007) Telework, human resource flexibility and firm performance. New Technology, Work and Employment 22(3):208–223, DOI 10.1111/j.1468-005X.2007.00195.x
46. Miller H (1976) Personnel scheduling in public systems: a survey. Socioeconomic planning sciences 10(6):241–249
47. Misir M, Verbeeck K, De Causmaecker P, Vanden Bergue G (2010) Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem. In: Evolutionary Computation (CEC), 2010 IEEE Congress on, pp 18–23, DOI 10.1109/CEC.2010.5586348
48. Misir M, Smet P, Verbeeck K, Vanden Bergue G (2011) Security personnel routing and rostering: a comparisonof hyper-heuristic approaches. In: The 3rd International Conference on Applied Operational Research, ICAOR11, Istanbul, Turkey, 2011, pp 193–206
49. Raff S (1983) Routing and scheduling of vehicles and crews: The state of the art. Computers & Operations Research 10(2):63–211, DOI 10.1016/0305-0548(83)90030-8
50. Rasmussen MS, Justesen T, Dohn A, Larsen J (2012) The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research 219(3):598–610, DOI 10.1016/j.ejor.2011.10.048
51. Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40(4):455–472, DOI 10.1287/trsc.1050.0135
52. Rosenkrantz DJ, Stearns RE, Lewis II PM (1977) An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing 6(3):563–581, DOI 10.1137/0206041
53. Ross P (2005) Hyper-heuristics. In: Burke EK, Kendall G (eds) Search Methodologies, Springer US, pp 529–556
54. Salani M, Vaca I (2011) Branch and price for the vehicle routing problem with discrete split deliverables and time windows. European Journal of Operational Research 213(3):470–477, DOI 10.1016/j.ejor.2011.03.023