Personnel shift assignment: Existence conditions and network models

Share/Save/Bookmark

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

[img]
Preview
PDF
850Kb
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:
Management and Governance (SMG)
Research Chair:
Research Group:
Link to this item:http://purl.utwente.nl/publications/71082
Official URL:http://dx.doi.org/10.1002/net.3230240704
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 144531