Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search

Yi Qu, Timothy Curtois

Abstract

This paper presents a set of benchmarks instances for the multi-activity shift scheduling problem and the results produced using a variable neighbourhood search method. The data set is intended as a resource to generate and verify novel research on an important and practical but challenging problem. The variable neighbourhood search uses four different neighbourhood operators and can produce feasible solutions within short computation times.

Download


Paper Citation


in Harvard Style

Qu Y. and Curtois T. (2020). Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search.In Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-396-4, pages 227-232. DOI: 10.5220/0009118102270232


in Bibtex Style

@conference{icores20,
author={Yi Qu and Timothy Curtois},
title={Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search},
booktitle={Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2020},
pages={227-232},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009118102270232},
isbn={978-989-758-396-4},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search
SN - 978-989-758-396-4
AU - Qu Y.
AU - Curtois T.
PY - 2020
SP - 227
EP - 232
DO - 10.5220/0009118102270232