The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Optimal Solution Stability in Dynamic, Distributed Constraint Optimization
IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
SBDO: A New Robust Approach to Dynamic Distributed Constraint Optimisation
PRIMA '09 Proceedings of the 12th International Conference on Principles of Practice in Multi-Agent Systems
SBDO: a new robust approach to dynamic distributed constraint optimisation
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Hi-index | 0.00 |
Ensuring optimum use of scarce resources is one of the largest challenges facing health providers today. However it is not easy to generate an optimised schedule, as the health system is unusually and highly dynamic. Scheduling systems must be extremely flexible while still producing an efficient, acceptable schedule. Furthermore the scheduling system should be able to cross health boundaries inside and outside hospitals to perform load sharing. To solve this problem we propose an encoding of the patient scheduling problem as a dynamic distributed constraint optimisation problem and show how it can be solved using Support Based Distributed Optimisation. The resulting system will be able to generate good schedules and update them in real time. It is also able to maintain privacy across hospital boundaries to enable load balancing.