LP-based working subsets for personnel scheduling: Evaluation and augmentation

Michael J. Brusco, Tony R. Johns, Ray R. Venkataraman

Research output: Contribution to journalArticle

Abstract

This paper evaluates the efficacy of LP-based working subsets for generalised set-covering formulations of personnel scheduling problems and presents a nearest-neighbour augmentation procedure for improving performance. Three experimental studies were completed in the evaluation process. In the first study, the LP-based working subset was sufficient to yield an optimal shift scheduling solution for 85% of the 24,300 test problems and the nearest-neighbour augmentation improved the percentage of optimal solutions to over 98%. The second study focused on more complex cyclic shift scheduling environments that permitted shift length, meal break and relief break flexibility. The adequacy of LP-based working subsets was supported by the provision of optimal shift scheduling solutions for 185 of 189 (98%) of the test problems. The third study examined a challenging tour scheduling environment for which globally-optimal benchmarks are not available. The superiority of the augmented LP-based working subset procedure was nevertheless evident, as it yielded better results than the (non-augmented) LP-based working subset for 92% of the test problems despite being constrained to only 40% of the allowed computation time for the non-augmented subsets.

Original languageEnglish (US)
Pages (from-to)175-198
Number of pages24
JournalEuropean Journal of Industrial Engineering
Volume12
Issue number2
DOIs
StatePublished - Jan 1 2018

Fingerprint

Scheduling
Personnel
Set theory

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

@article{0baf6267fd5c4fd3b704675068ee07e1,
title = "LP-based working subsets for personnel scheduling: Evaluation and augmentation",
abstract = "This paper evaluates the efficacy of LP-based working subsets for generalised set-covering formulations of personnel scheduling problems and presents a nearest-neighbour augmentation procedure for improving performance. Three experimental studies were completed in the evaluation process. In the first study, the LP-based working subset was sufficient to yield an optimal shift scheduling solution for 85{\%} of the 24,300 test problems and the nearest-neighbour augmentation improved the percentage of optimal solutions to over 98{\%}. The second study focused on more complex cyclic shift scheduling environments that permitted shift length, meal break and relief break flexibility. The adequacy of LP-based working subsets was supported by the provision of optimal shift scheduling solutions for 185 of 189 (98{\%}) of the test problems. The third study examined a challenging tour scheduling environment for which globally-optimal benchmarks are not available. The superiority of the augmented LP-based working subset procedure was nevertheless evident, as it yielded better results than the (non-augmented) LP-based working subset for 92{\%} of the test problems despite being constrained to only 40{\%} of the allowed computation time for the non-augmented subsets.",
author = "Brusco, {Michael J.} and Johns, {Tony R.} and Venkataraman, {Ray R.}",
year = "2018",
month = "1",
day = "1",
doi = "10.1504/EJIE.2018.090614",
language = "English (US)",
volume = "12",
pages = "175--198",
journal = "European Journal of Industrial Engineering",
issn = "1751-5254",
publisher = "Inderscience Enterprises Ltd",
number = "2",

}

LP-based working subsets for personnel scheduling : Evaluation and augmentation. / Brusco, Michael J.; Johns, Tony R.; Venkataraman, Ray R.

In: European Journal of Industrial Engineering, Vol. 12, No. 2, 01.01.2018, p. 175-198.

Research output: Contribution to journalArticle

TY - JOUR

T1 - LP-based working subsets for personnel scheduling

T2 - Evaluation and augmentation

AU - Brusco, Michael J.

AU - Johns, Tony R.

AU - Venkataraman, Ray R.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - This paper evaluates the efficacy of LP-based working subsets for generalised set-covering formulations of personnel scheduling problems and presents a nearest-neighbour augmentation procedure for improving performance. Three experimental studies were completed in the evaluation process. In the first study, the LP-based working subset was sufficient to yield an optimal shift scheduling solution for 85% of the 24,300 test problems and the nearest-neighbour augmentation improved the percentage of optimal solutions to over 98%. The second study focused on more complex cyclic shift scheduling environments that permitted shift length, meal break and relief break flexibility. The adequacy of LP-based working subsets was supported by the provision of optimal shift scheduling solutions for 185 of 189 (98%) of the test problems. The third study examined a challenging tour scheduling environment for which globally-optimal benchmarks are not available. The superiority of the augmented LP-based working subset procedure was nevertheless evident, as it yielded better results than the (non-augmented) LP-based working subset for 92% of the test problems despite being constrained to only 40% of the allowed computation time for the non-augmented subsets.

AB - This paper evaluates the efficacy of LP-based working subsets for generalised set-covering formulations of personnel scheduling problems and presents a nearest-neighbour augmentation procedure for improving performance. Three experimental studies were completed in the evaluation process. In the first study, the LP-based working subset was sufficient to yield an optimal shift scheduling solution for 85% of the 24,300 test problems and the nearest-neighbour augmentation improved the percentage of optimal solutions to over 98%. The second study focused on more complex cyclic shift scheduling environments that permitted shift length, meal break and relief break flexibility. The adequacy of LP-based working subsets was supported by the provision of optimal shift scheduling solutions for 185 of 189 (98%) of the test problems. The third study examined a challenging tour scheduling environment for which globally-optimal benchmarks are not available. The superiority of the augmented LP-based working subset procedure was nevertheless evident, as it yielded better results than the (non-augmented) LP-based working subset for 92% of the test problems despite being constrained to only 40% of the allowed computation time for the non-augmented subsets.

UR - http://www.scopus.com/inward/record.url?scp=85044772615&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85044772615&partnerID=8YFLogxK

U2 - 10.1504/EJIE.2018.090614

DO - 10.1504/EJIE.2018.090614

M3 - Article

AN - SCOPUS:85044772615

VL - 12

SP - 175

EP - 198

JO - European Journal of Industrial Engineering

JF - European Journal of Industrial Engineering

SN - 1751-5254

IS - 2

ER -