Personnel shift assignment: Existence conditions and network models

Jeroen P. van den Berg, David M. Panton

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)
171 Downloads (Pure)

Abstract

The personnel scheduling problem is known to be a five-stage process in which the final stage involves the assignment of shifts to the days worked in the schedule. This paper discusses the existence conditions for both continuous and forward rotating shift assignments and heuristic network algorithms for the determination of such assignments. Results generated for a number of test problems demonstrate, first, that the network devised to search for continuous solutions produces these solutions in a high proportion of cases where such solutions are known to exist. Second, for more general problems, the algorithm is shown to be efficient in its ability to generate either continuous or rotating solutions.
Original languageEnglish
Pages (from-to)385-394
JournalNetworks
Volume24
Issue number7
DOIs
Publication statusPublished - 1994

Fingerprint

Personnel
Scheduling

Cite this

van den Berg, Jeroen P. ; Panton, David M. / Personnel shift assignment: Existence conditions and network models. In: Networks. 1994 ; Vol. 24, No. 7. pp. 385-394.
@article{d9ed53200c3244539b8ceb7522a353e5,
title = "Personnel shift assignment: Existence conditions and network models",
abstract = "The personnel scheduling problem is known to be a five-stage process in which the final stage involves the assignment of shifts to the days worked in the schedule. This paper discusses the existence conditions for both continuous and forward rotating shift assignments and heuristic network algorithms for the determination of such assignments. Results generated for a number of test problems demonstrate, first, that the network devised to search for continuous solutions produces these solutions in a high proportion of cases where such solutions are known to exist. Second, for more general problems, the algorithm is shown to be efficient in its ability to generate either continuous or rotating solutions.",
author = "{van den Berg}, {Jeroen P.} and Panton, {David M.}",
year = "1994",
doi = "10.1002/net.3230240704",
language = "English",
volume = "24",
pages = "385--394",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "7",

}

Personnel shift assignment: Existence conditions and network models. / van den Berg, Jeroen P.; Panton, David M.

In: Networks, Vol. 24, No. 7, 1994, p. 385-394.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Personnel shift assignment: Existence conditions and network models

AU - van den Berg, Jeroen P.

AU - Panton, David M.

PY - 1994

Y1 - 1994

N2 - The personnel scheduling problem is known to be a five-stage process in which the final stage involves the assignment of shifts to the days worked in the schedule. This paper discusses the existence conditions for both continuous and forward rotating shift assignments and heuristic network algorithms for the determination of such assignments. Results generated for a number of test problems demonstrate, first, that the network devised to search for continuous solutions produces these solutions in a high proportion of cases where such solutions are known to exist. Second, for more general problems, the algorithm is shown to be efficient in its ability to generate either continuous or rotating solutions.

AB - The personnel scheduling problem is known to be a five-stage process in which the final stage involves the assignment of shifts to the days worked in the schedule. This paper discusses the existence conditions for both continuous and forward rotating shift assignments and heuristic network algorithms for the determination of such assignments. Results generated for a number of test problems demonstrate, first, that the network devised to search for continuous solutions produces these solutions in a high proportion of cases where such solutions are known to exist. Second, for more general problems, the algorithm is shown to be efficient in its ability to generate either continuous or rotating solutions.

U2 - 10.1002/net.3230240704

DO - 10.1002/net.3230240704

M3 - Article

VL - 24

SP - 385

EP - 394

JO - Networks

JF - Networks

SN - 0028-3045

IS - 7

ER -