Abstract
This paper looks at work done on a case-based workforce scheduling application. Generalised patterns of workforce allocation are used to build up a schedule that is then adjusted to remove any problems. Because some constraint elements are incorporated in the case-base, the global problem search space is reduced. The case-base can be maintained either automatically, by generalisation of solutions or by theoretical analysis of case efficiency, or manually, by storage of generalised patterns of allocation preference. In line with the background cognitive theory behind case-based reasoning, the methods of arrival at solutions are very similar to the methods used by manual schedulers.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Cheng, B.M.W., Lee, J.H.M. & Wu, J.C.K. “A Constraint-Based Nurse Rostering System Using a Redundant Modelling Approach”, IEEE 8th International Conference on Tools with Artificial Intelligence (TAI96) Toulouse, 1996
Hentenryck, P.,V., “Constraint Satisfaction in Logic Programming”, MIT Press, 1989
Lazaro, J.M., Aristondo, P., “Using Solver for Nurse Scheduling”, In Proceedings of Ilog Solver & Ilog Schedule, First International Users' Conference — (http://www.ilog.fr/products/solver/conference.html), July 1995
Megeath, J.D., “Successful Hospital Personnel Scheduling”, Interfaces, Vol. 8, No 2, pp.55–59, 1978
Miller, H.E., Pierskalla, W.P., Rath, G.J., “Nurse Scheduling Using Mathematical Programming”, Operations Research, Vol 24, No5 pp857–870, 1976
Scott, S. “A Preliminary Investigation into ways of Achieving more Flexible and Adaptive, Artificial Intelligence Based, Nurse Rostering Systems”, University of Huddersfield Research Report, RR9709, 1997
Scott, S., Simpson, R., Ward, R., “Combining Case-Based Reasoning and Constraint Logic Programming Techniques for Packaged Nurse Rostering Systems”, Proceedings of the Third UK Case-Based Reasoning Workshop, 1997
Siferd, S.P., Benton, W.C., “Workforce Staffing and Scheduling: Hospital Nursing Specific Models”, European Journal of Operational Research, 60 pp 233–246, 1992
Weil, G., Heus, K., Francois, P., Poujade, M., “Constraint Programming for Nurse Scheduling”, IEEE Engineering in Medicine & Biology, pp. 417–422, July/August 1995
Squalli,M.H., Freuder, E.C., “Integration of CSP & CBR to compensate for Incompleteness & Incorrectness of Models”, Symposium on Multimodal Reasoning, http://www.cs.unh.edu/ccc/mm/sym.html, 1998.
Purvis, L., “Synergy and Commonality in Case-Based and Constraint-Based Reasoning”, Symposium on Multimodal Reasoning, http://www.cs.unh.edu/ccc/mm/sym.html, 1998.
Leake, D.B. “CBR in Context: The Present and the Future”, in Case-Based Reasoning: Experiences, Lessons and Future Directions, Menlo Park: AAAI Press 1996
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scott, S., Simpson, R. (1998). Case-bases incorporating scheduling constraint dimensions - Experiences in nurse rostering -. In: Smyth, B., Cunningham, P. (eds) Advances in Case-Based Reasoning. EWCBR 1998. Lecture Notes in Computer Science, vol 1488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056350
Download citation
DOI: https://doi.org/10.1007/BFb0056350
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64990-8
Online ISBN: 978-3-540-49797-4
eBook Packages: Springer Book Archive