Distributed Constraint Optimization for scheduling in CSCWD

This paper introduces a new agent-based algorithm for scheduling in CSCWD. Distributed artificial intelligence provides a lot of research areas, including CSCWD, with efficient decentralized optimization and problem solving techniques. In this paper we focus on how DCOP (distributed constraint optimization problem) can be used for scheduling in CSCWD, discussing a new algorithm. Our algorithm is almost-complete, providing the best solution most the times. However, it saves a lot of computational resources, being useful in situations where other state of the art algorithms are not feasible. The results are quite encouraging, showing that our algorithm outperforms easily two well-known DCOP algorithms in terms of runtime, number of messages, size of messages and throughput.