dbai-tr-2000-35.bbl
\begin{thebibliography}{10}

\bibitem{Balakrishnan90}
Nagraj Balakrishnan and Richard~T. Wong.
\newblock A network model for the rotating workforce scheduling problem.
\newblock {\em Networks}, 20:25--42, 1990.

\bibitem{BEST91}
{BEST}.
\newblock Guidelines for shiftworkers.
\newblock Bulletin of European Time Studies No.\ 3, European Foundation for the
  Improvement of Living and Working Conditions, 1991.

\bibitem{Butler78}
B.~Butler.
\newblock Computerized manpower scheduling.
\newblock Master's thesis, University of Alberta, Canada, 1978.

\bibitem{Glover86}
Fred Glover and Claude McMillan.
\newblock The general employee scheduling problem: An integration of {MS} and
  {AI}.
\newblock {\em Comput. Ops. Res.}, 13(5):563--573, 1986.

\bibitem{Heller73}
N.~Heller, J.~McEwen, and W.~Stenzel.
\newblock Computerized scheduling of police manpower.
\newblock {\em St. Louis Police Department, St. Louis, MO}, 1973.

\bibitem{Kragelund98}
L.~Kragelund and T.~Kabel.
\newblock Employee timetabling.
\newblock Master's thesis, Department of Computer Science, University of
  Aarhus, Ny Munkegade, Building 540, DK-8000 Aarhus C, Denmark, 1998.

\bibitem{Laporte80}
G.~Laporte, Y.~Nobert, and J.~Biron.
\newblock Rotating schedules.
\newblock {\em Eur. J. Ops. Res.}, 4:24--30, 1980.

\bibitem{Lau96}
Hoong~Chuin Lau.
\newblock On the complexity of manpower scheduling.
\newblock {\em Computers. Ops. Res.}, 23(1):93--102, 1996.

\bibitem{Shaerf99}
Andrea Schaerf and Amnon Meisels.
\newblock Solving employee timetabling problems by generalized local search.
\newblock In {\em Paper presented at {AI*IA'99}}, 1999.

\bibitem{Smith92}
Barbara~M. Smith and Sean Bennett.
\newblock Combining constraint satisfaction and local improvement algorithms to
  construct anaesthetist's rotas.
\newblock In {\em Practical Approaches to Scheduling and Planning: Papers from
  the 1992 Spring Symposium}, pages 136--140, Menlo Park, California, 1992.
  AAAI Press.

\bibitem{Tien82}
James~M. Tien and Angelica Kamiyama.
\newblock On manpower scheduling algorithms.
\newblock {\em SIAM Review}, 24(3):275--287, 1982.

\bibitem{Weil95}
Georges Weil and Kamel Heus.
\newblock Eliminating interchangeable values in the nurse scheduling problem
  formulated as a constraint satisfaction problem.
\newblock In {\em Paper presented at the workshop CONSTRAINT'95}, 1995.

\end{thebibliography}
