Case-bases incorporating scheduling constraint dimensions - Experiences in nurse rostering

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.