NDLI: Workforce scheduling and routing problems: literature survey and computational study

Content Provider	Springer Nature Link
Author	Castillo Salazar, J. Arturo Landa Silva, Dario Qu, Rong
Copyright Year	2014
Abstract	In the context of workforce scheduling, there are many scenarios in which personnel must carry out tasks at different locations hence requiring some form of transportation. Examples of these type of scenarios include nurses visiting patients at home, technicians carrying out repairs at customers’ locations and security guards performing rounds at different premises, etc. We refer 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 at the locations where tasks need to be performed. The first part of this paper presents a survey which attempts to identify the common features of WSRP scenarios and the solution methods applied when tackling these problems. The second part of the paper presents a study on the computational difficulty of solving these type of problems. For this, five data sets are gathered from the literature and some adaptations are made in order to incorporate the key features that our survey identifies as commonly arising in WSRP scenarios. The computational study provides an insight into the structure of the adapted test instances, an insight into the effect that problem features have when solving the instances using mathematical programming, and some benchmark computation times using the Gurobi solver running on a standard personal computer.
Starting Page	39
Ending Page	67
Page Count	29
File Format	PDF
ISSN	02545330
Journal	Annals of Operations Research
Volume Number	239
Issue Number	1
e-ISSN	15729338
Language	English
Publisher	Springer US
Publisher Date	2014-08-14
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Workforce scheduling Employee rostering Routing problems Mobile workforce Mathematical programming Benchmark instances Operation Research/Decision Theory Combinatorics Theory of Computation
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Optimal duty rostering for toll enforcement inspectors

Nurse rostering at a Danish ward

Nurse preference rostering using agents and iterated local search

Near-optimal MIP solutions for preference based self-scheduling

A constructive heuristic for staff scheduling in the glass industry

Integer programming techniques for the nurse rostering problem

An Annotated Bibliography of Personnel Scheduling and Rostering

A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering

A comparison of two approaches to nurse rostering problems

Workforce scheduling and routing problems: literature survey and computational study

Similar Documents

Optimal duty rostering for toll enforcement inspectors

Nurse rostering at a Danish ward

Nurse preference rostering using agents and iterated local search

Near-optimal MIP solutions for preference based self-scheduling

A constructive heuristic for staff scheduling in the glass industry

Integer programming techniques for the nurse rostering problem

An Annotated Bibliography of Personnel Scheduling and Rostering

A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering

A comparison of two approaches to nurse rostering problems

Workforce scheduling and routing problems: literature survey and computational study