Personnel shift assignment: Existence conditions and network models


Berg, Jeroen P. van den and Panton, David M. (1994) Personnel shift assignment: Existence conditions and network models. Networks, 24 (7). pp. 385-394. ISSN 0028-3045

open access
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.
Item Type:Article
Copyright:© 1994 by John Wiley & Sons
Faculty of Behavioural, Management and Social sciences (BMS)
Research Chair:
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 144531