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

Yi Qu; Timothy Curtois

doi:10.5220/0009118102270232

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

Yi Qu, Timothy Curtois

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

3 Citations (Scopus)

98 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 language	English
Title of host publication	Proceedings of the 9th International Conference on Operations Research and Enterprise Systems 2020
Editors	Greg H. Parlier, Federico Liberatore, Marc Demange
Place of Publication	Portugal
Publisher	Scitepress
Pages	227-232
Number of pages	6
Volume	1
ISBN (Electronic)	9789897583964
DOIs	https://doi.org/10.5220/0009118102270232
Publication status	Published - Feb 2020
Event	International Conference on Operations Research and Enterprise Systems - Valetta, Malta Duration: 22 Feb 2020 → 24 Feb 2020 http://www.icores.org/?y=2020

Conference

Conference	International Conference on Operations Research and Enterprise Systems
Abbreviated title	ICORES
Country/Territory	Malta
City	Valetta
Period	22/02/20 → 24/02/20
Internet address	http://www.icores.org/?y=2020

Keywords

Variable Neighbourhood Search
Benchmarks
Multi-activity Shift Scheduling

Access to Document

10.5220/0009118102270232Licence: CC BY-NC-ND

ICORES_2020_42Final published version, 254 KBLicence: CC BY-NC-ND

Cite this

@inbook{5bf22d7fa1f04866a9bcb0993c81ee24,

title = "Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search",

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.",

keywords = "Variable Neighbourhood Search, Benchmarks, Multi-activity Shift Scheduling",

author = "Yi Qu and Timothy Curtois",

year = "2020",

month = feb,

doi = "10.5220/0009118102270232",

language = "English",

volume = "1",

pages = "227--232",

editor = "Parlier, \{Greg H. \} and Liberatore, \{Federico \} and Demange, \{Marc \}",

booktitle = "Proceedings of the 9th International Conference on Operations Research and Enterprise Systems 2020",

publisher = "Scitepress",

note = "International Conference on Operations Research and Enterprise Systems, ICORES ; Conference date: 22-02-2020 Through 24-02-2020",

url = "http://www.icores.org/?y=2020",

}

Qu, Y & Curtois, T 2020, Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search. in GH Parlier, F Liberatore & M Demange (eds), Proceedings of the 9th International Conference on Operations Research and Enterprise Systems 2020. vol. 1, Scitepress, Portugal, pp. 227-232, International Conference on Operations Research and Enterprise Systems, Valetta, Malta, 22/02/20. https://doi.org/10.5220/0009118102270232

Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search. / Qu, Yi; Curtois, Timothy.
Proceedings of the 9th International Conference on Operations Research and Enterprise Systems 2020. ed. / Greg H. Parlier; Federico Liberatore; Marc Demange. Vol. 1 Portugal: Scitepress, 2020. p. 227-232.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

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

AU - Qu, Yi

AU - Curtois, Timothy

PY - 2020/2

Y1 - 2020/2

N2 - 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.

AB - 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.

KW - Variable Neighbourhood Search

KW - Benchmarks

KW - Multi-activity Shift Scheduling

UR - https://www.scopus.com/pages/publications/85082984201

U2 - 10.5220/0009118102270232

DO - 10.5220/0009118102270232

M3 - Chapter

VL - 1

SP - 227

EP - 232

BT - Proceedings of the 9th International Conference on Operations Research and Enterprise Systems 2020

A2 - Parlier, Greg H.

A2 - Liberatore, Federico

A2 - Demange, Marc

PB - Scitepress

CY - Portugal

T2 - International Conference on Operations Research and Enterprise Systems

Y2 - 22 February 2020 through 24 February 2020

ER -

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

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this