Distributed and devolved work allocation planning

Applied Artificial Intelligence

Volumn 18, Issue 2, 2004, Pages 97-115

  Winstanley, Graham ^a  

^a UNIVERSITY OF BRIGHTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; INTELLIGENT AGENTS; NURSING; PERSONNEL; SCHEDULING; WORK-REST SCHEDULES;

GLOBAL CONSTRAINT SOLVING AGENT; NURSES; WARD SHIFTS; WORK ALLOCATION PLANNING;

AUTONOMOUS AGENTS;

EID: 1642316182     PISSN: 08839514     EISSN: None     Source Type: Journal    
DOI: 10.1080/08839510490425859     Document Type: Article

References (13)

1. Abdennadher, S., and H. Schlenker. 1999. INTERDIP: An interactive constraint based nurse scheduler. In Proceedings of the 1st Int. Conf. on The Practical Application of Constraint Technologies and Logic Programming (PACL99), pp. 1-16, London, U.K.
2. Cheng, B.M.W., J.H.M. Lee, and J.C.K. Wu. 1997. A nurse rostering system using constraint programming and redundant modeling. IEEE Transactions on Information Technology in Medicine 1:44-54.
3. Freuder, E.C. 1991. Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI-91), pages 227-233. Anaheim, CA.
4. Isken, M.W., and W.M. Hancock. 1991. A heuristic approach to nurse scheduling in hospital units with non-stationary, urgent demand and a fixed staff size. Journal of the Society for Health Systems 2(2).
5. Jaffar, J., and M. Maher. 1994. Constraint logic programming: A survey. Journal of Logic Programming 19(20):503-582.
6. Kumar, V. 1992. Algorithms for constraint satisfaction problems: A survey. AI Magazine 13(1):32-44.
7. Miller, H.E., W.P. Pierskalla, and G.J. Rath. 1976. Nurse scheduling using mathematical programming. Operations Research 24(8):857-870.
8. Minton, S., M.D. Johnston, A.B. Philips, and P. Laird. 1992. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58:161-205.
9. Nunez, J., G. Winstanley, and R.N. Griffiths. 1998. A reluctance-based cost distribution strategy for multi-agent planning. The International Journal of Applied Intelligence, Special Issue on Intelligent Adaptive Agents 9:39-55.
10. Scott, S., and R. Simpson. 1998. Case-bases incorporating scheduling constraint dimensions: Experiences in nurse scheduling. In Advances in Case-Based Reasoning eds. Smyth and Cunningham, pp. 392-401, Springer Verlag Lecture Notes in AI.
11. Wallace, M., S. Novello, and J. Schimpf. 1997. ECLiPSe: A Platform for Constraint Logic Programming, IC-Parc. http://www.icparc.ic.ac.uk/eclipse/reports/eclipse/eclipse.html.
12. Weigel, R., V.B. Faltings and B.Y. Choueiry. 1996. Context in discrete constraint satisfaction problems. In Proceedings of the 12th European Conference on AI (ECA196), pages 205-209, Budapest, Hungary.
13. Yokoo, M. 1994. Weak-commitment search for solving constraint satisfaction problems. In Proceedings of 12th Nat. Conf. On Artificial Intelligence, vol. 1, pages 313-318, WA, USA.