CHN and min-conflict heuristic to solve scheduling meeting problems

Abstract

Meetings are important for teem works, However, scheduling a meeting that involves persons with different preferences and engagements remains a difficult task. This paper proposes a new hybrid approach to solve meeting scheduling problem (MSP). The proposed network combines the characteristics of neural networks and minimizing conflicts approach. Her the MSP is considerate as Constraint Satisfaction Problem, then we apply Continuous Hopfield Neural Netwok (CHN) and Conflicts Minimization Heuristics to solve a quadratic reformulation of the CSP-MSP model in other words the Min-Conflict heuristic will improve the given CHN solution. So, the performance of the network is compared with the existing scheduling algorithms under various experimental conditions.