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

Qu, Yi and Curtois, Timothy (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 2020. Scitepress, Portugal, pp. 227-232. ISBN 9789897583964

[img]
Preview
Text
ICORES_2020_42.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0.

Download (259kB) | Preview
Official URL: https://doi.org/10.5220/0009118102270232

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.

Item Type: Book Section
Uncontrolled Keywords: Variable Neighbourhood Search, Benchmarks, Multi-activity Shift Scheduling
Subjects: G200 Operational Research
N100 Business studies
N200 Management studies
N900 Others in Business and Administrative studies
Department: Faculties > Business and Law > Newcastle Business School
Depositing User: Rachel Branson
Date Deposited: 02 Jun 2020 13:29
Last Modified: 02 Jun 2020 13:30
URI: http://nrl.northumbria.ac.uk/id/eprint/43314

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics