myjournal manuscript No. (will be inserted by the editor) A Survey on Workforce Scheduling and Routing Problems J. Arturo Castillo-Salazar 1 Dario Landa-Silva Rong Qu Received: date / Accepted: date Abstract In the context of workforce scheduling, there are many scenarios in which personnel must carry out tasks at different locations hence requir- ing some form of transportation. Examples of these type of scenarios include nurses visiting patients at home, technicians carrying out repairs at customers’ locations, security guards performing rounds at different premises, etc. We re- fer to these scenarios as Workforce Scheduling and Routing Problems (WSRP) as they usually involve the scheduling of personnel combined with some form of routing in order to ensure that employees arrive on time to the locations where tasks need to be performed. This kind of problems have been tackled in the literature for a number of years. This paper presents a survey which attempts to identify the common attributes of WSRP scenarios and the so- lution methods applied when tackling these problems. Our longer term aim is to achieve an in-depth understanding of how to model and solve workforce scheduling and routing problems and this survey represents the first step in this quest. Keywords workforce scheduling, employee rostering, routing problems, mobile workforce 1 Introduction In recent times, employees often need to be more flexible regarding the type of job performed and similarly, employers need to make compromises in order to retain their best employees (Eaton, 2003; Mart´ ınez-S´ anchez et al, 2007). Moreover, in some cases workforce should perform tasks at different locations, 1 The author acknowledges CONACyT for its financial support J. Arturo Castillo-Salazar · Dario Landa-Silva · Rong Qu E-mail: jac@cs.nott.ac.uk · dariolandasilva@nottingham.ac.uk · rong.qu@nottingham.ac.uk ASAP Research Group, School of Computer Science University of Nottingham Jubilee Campus Wollanton Road, Nottingham, United Kingdom, NG8 1BB