AIME 2001: Artificial Intelligence in Medicine pp 395-404 | Cite as
TAME Time Resourcing in Academic Medical Environments
Conference paper
First Online:
Abstract
Personnel planning in academic medical departments has to be extremely sophisticated to mobilize all reserves and arrange them in a fashion that permits sufficient and cohesive times for academic activities. We use Constraint Satisfaction in order to cope with problem structure on the one hand and problem complexity on the other. TAME, the current prototype for doing assistant planning, generates optimal plans within seconds of computing time.
Keywords
Constraint Satisfaction Constraint Satisfaction Problem Soft Constraint Global Constraint Constraint Solver
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.S. Abdennadher and H. Schlenker. Nurse scheduling using constraint logic programming. In Proc. of the Eleventh Annual Conference on Innovative Applica tions of Artificial Intelligence (IAAI-99). AAAI Press, 1999.Google Scholar
- 2.M. Dincbas, P. van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The constraint logic programming language CHIP. In Int. Conf. Fifth Generation Computer Systems (FGCS’88), pages 693–702, Tokyo, 1988.Google Scholar
- 3.C. Gervat, ed. Proc. PACLP 2000. The Practical Application Company Ltd, 2000.Google Scholar
- 4.H.-J. Goltz and D. Matzke. University timetabling using constraint logic programming. In G. Gupta, editor, Practical Aspects of Declarative Languages, volume 1551 of Lecture Notes in Computer Science, pages 320–334, Berlin, Heidelberg, New York, 1999. Springer-Verlag.CrossRefGoogle Scholar
- 5.Markus Hannebauer and Ulrich Geske. Coordinating distributed CLP-solvers in medical appointment scheduling. In Proc. of the Twelfth International Conference on Applications of Prolog (INAP-99), pages 117–125, Tokyo, Japan, 1999.Google Scholar
- 6.P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (Mass.), London, 1989.Google Scholar
- 7.P. Van Hentenryck, H. Simonis, and M. Dincbas. Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58:113–159, 1992.MATHCrossRefMathSciNetGoogle Scholar
- 8.J. Little, ed. Proc. PACLP 99. The Practical Application Company Ltd, 1999.Google Scholar
- 9.K. Marriott and P. J. Stucky. Programming with Constraints: An Introduction. The MIT Press, Cambridge (MA), London, 1998.MATHGoogle Scholar
- 10.H. Simonis and E. Beldiceanu. The CHIP System. COSYTEC, 1997.Google Scholar
- 11.E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.Google Scholar
- 12.M. Wallace. Practical applications of contraint programming. Constraints, An International Journal, 1:139–168, 1996.CrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2001