IEEE Computer Society - Combining constraint satisfaction and local improvement algorithms to construct anaesthetists' rotas

Proceedings Eighth Conference on Artificial Intelligence for Applications

Author(s): B.M. Smith ; S. Bennett
Sponsor(s): IEEE
Publisher: IEEE Computer Society
Publication Date: 1 January 1992
Conference Location: Monterey, CA, USA, USA
Conference Date: 2 March 1992
Page Count: 7
Page(s): 106 - 112
ISBN (Paper): 0-8186-2690-9
DOI: 10.1109/CAIA.1992.200017

A system for compiling weekly rotas for anaesthetists in a large hospital is described. The rota compilation problem is an optimization problem where the number of tasks which cannot be assigned... View More