Premium
Personnel shift assignment: Existence conditions and network models
Author(s) -
van den Berg Yeroon,
Panton David M.
Publication year - 1994
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230240704
Subject(s) - heuristic , schedule , mathematical optimization , computer science , scheduling (production processes) , process (computing) , algorithm , mathematics , operating system
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. © 1994 by John Wiley & Sons, Inc.