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

Yi Qu, Timothy Curtois

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Citation (Scopus)
7 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationProceedings of the 9th International Conference on Operations Research and Enterprise Systems 2020
EditorsGreg H. Parlier, Federico Liberatore, Marc Demange
Place of PublicationPortugal
PublisherScitepress
Pages227-232
Number of pages6
Volume1
ISBN (Electronic)9789897583964
DOIs
Publication statusPublished - Feb 2020
EventInternational Conference on Operations Research and Enterprise Systems - Valetta, Malta
Duration: 22 Feb 202024 Feb 2020
http://www.icores.org/?y=2020

Conference

ConferenceInternational Conference on Operations Research and Enterprise Systems
Abbreviated titleICORES
CountryMalta
CityValetta
Period22/02/2024/02/20
Internet address

Fingerprint

Dive into the research topics of 'Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search'. Together they form a unique fingerprint.

Cite this