Resource constrained routing and scheduling: review and research prospects

Dimitris C. Paraskevopoulos; Gilbert Laporte; Panagiotis P. Repoussis; Christos D. Tarantilis

doi:10.1016/j.ejor.2017.05.035

Resource constrained routing and scheduling: review and research prospects

Dimitris C. Paraskevopoulos
, Gilbert Laporte
, Panagiotis P. Repoussis
, Christos D. Tarantilis

Management

HEC Montréal
Stevens Institute of Technology
Athens University of Economics and Business

Research output: Contribution to journal › Article › peer-review

101 Citations (SciVal)

Abstract

In the service industry, it is crucial to efficiently allocate scarce resources to perform tasks and meet particular service requirements. What considerably complicates matters is when these resources, for example skilled technicians, nurses, and home carers have to visit different customer locations. This paper provides a comprehensive survey on resource constrained routing and scheduling that unveils the problem characteristics with respect to resource qualifications, service requirements and problem objectives. It also identifies the most effective exact and heuristic algorithms for this class of problems. The paper closes with several research prospects.

Original language	English
Pages (from-to)	737-754
Journal	European Journal of Operational Research
Volume	263
Issue number	3
Early online date	25 May 2017
DOIs	https://doi.org/10.1016/j.ejor.2017.05.035
Publication status	Published - 16 Dec 2017

Access to Document

10.1016/j.ejor.2017.05.035

Cite this

@article{c845c1594cda44d88a865106694ac38e,

title = "Resource constrained routing and scheduling: review and research prospects",

abstract = "In the service industry, it is crucial to efficiently allocate scarce resources to perform tasks and meet particular service requirements. What considerably complicates matters is when these resources, for example skilled technicians, nurses, and home carers have to visit different customer locations. This paper provides a comprehensive survey on resource constrained routing and scheduling that unveils the problem characteristics with respect to resource qualifications, service requirements and problem objectives. It also identifies the most effective exact and heuristic algorithms for this class of problems. The paper closes with several research prospects.",

author = "Paraskevopoulos, \{Dimitris C.\} and Gilbert Laporte and Repoussis, \{Panagiotis P.\} and Tarantilis, \{Christos D.\}",

year = "2017",

month = dec,

day = "16",

doi = "10.1016/j.ejor.2017.05.035",

language = "English",

volume = "263",

pages = "737--754",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Resource constrained routing and scheduling

T2 - review and research prospects

AU - Paraskevopoulos, Dimitris C.

AU - Laporte, Gilbert

AU - Repoussis, Panagiotis P.

AU - Tarantilis, Christos D.

PY - 2017/12/16

Y1 - 2017/12/16

N2 - In the service industry, it is crucial to efficiently allocate scarce resources to perform tasks and meet particular service requirements. What considerably complicates matters is when these resources, for example skilled technicians, nurses, and home carers have to visit different customer locations. This paper provides a comprehensive survey on resource constrained routing and scheduling that unveils the problem characteristics with respect to resource qualifications, service requirements and problem objectives. It also identifies the most effective exact and heuristic algorithms for this class of problems. The paper closes with several research prospects.

AB - In the service industry, it is crucial to efficiently allocate scarce resources to perform tasks and meet particular service requirements. What considerably complicates matters is when these resources, for example skilled technicians, nurses, and home carers have to visit different customer locations. This paper provides a comprehensive survey on resource constrained routing and scheduling that unveils the problem characteristics with respect to resource qualifications, service requirements and problem objectives. It also identifies the most effective exact and heuristic algorithms for this class of problems. The paper closes with several research prospects.

UR - http://dx.doi.org/10.1016/j.ejor.2017.05.035

U2 - 10.1016/j.ejor.2017.05.035

DO - 10.1016/j.ejor.2017.05.035

M3 - Article

SN - 0377-2217

VL - 263

SP - 737

EP - 754

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Resource constrained routing and scheduling: review and research prospects

Abstract

Access to Document

Other files and links

Fingerprint

Cite this