loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: J. Arturo Castillo-Salazar ; Dario Landa-Silva and Rong Qu

Affiliation: University of Nottingham, United Kingdom

ISBN: 978-989-758-075-8

Keyword(s): Employee Scheduling, Workforce Optimization, Personnel Routing, Greedy Heuristic, Benchmark Data, Connected Activities Constraints.

Related Ontology Subjects/Areas/Topics: Applications ; Methodologies and Technologies ; Operational Research ; Pattern Recognition ; Resource Allocation ; Routing ; Scheduling ; Software Engineering

Abstract: We present a greedy heuristic (GHI) designed to tackle five time-dependent activities constraints (synchronisation, overlap, minimum difference, maximum difference and minimum-maximum difference) on workforce scheduling and routing problems. These types of constraints are important because they allow the modelling of situations in which activities relate to each other time-wise, e.g. synchronising two technicians to complete a job. These constraints often make the scheduling and routing of employees more difficult. GHI is tested on set of benchmark instances from different workforce scheduling and routing problems (WSRPs). We compare the results obtained by GHI against the results from a mathematical programming solver. The comparison seeks to determine which solution method achieves more best solutions across all instances. Two parameters of GHI are discussed, the sorting of employees and the sorting of visits. We conclude that using the solver is adequate for instances with less tha n 100 visits but for larger instances GHI obtains better results in less time. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.239.160.113

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Arturo Castillo-Salazar, J.; Landa-Silva, D. and Qu, R. (2015). A Greedy Heuristic for Workforce Scheduling and Routing With Time-dependent Activities Constraints.In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 367-375. DOI: 10.5220/0005223203670375

@conference{icores15,
author={J. Arturo Castillo{-}Salazar. and Dario Landa{-}Silva. and Rong Qu.},
title={A Greedy Heuristic for Workforce Scheduling and Routing With Time-dependent Activities Constraints},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={367-375},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005223203670375},
isbn={978-989-758-075-8},
}

TY - CONF

JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Greedy Heuristic for Workforce Scheduling and Routing With Time-dependent Activities Constraints
SN - 978-989-758-075-8
AU - Arturo Castillo-Salazar, J.
AU - Landa-Silva, D.
AU - Qu, R.
PY - 2015
SP - 367
EP - 375
DO - 10.5220/0005223203670375

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.