Meetings scheduling solver enhancement with local consistency reinforcement

摘要

Meeting scheduling (MS) represents an important real-world group decision application that denotes one of the actual combinatorial problems. Solving this problem consists of scheduling all the meetings while satisfying all the constraints related to both the users and the meetings. However, given human nature, the solution is usually delineated by the encountering of conflicting preferences. Most of existing research efforts allow the relaxation of the users' preferences in order to reach an agreement between all the participants, which is not always possible. In addition, they do not deal with the achievement of any level of local consistency to enhance the efficiency of the solving process, and finally, they do not address the real difficulty of distributed systems, which is the complexity of message passing operations.