A new approach for meeting scheduler using A*-algorithm

The basic problem in meeting scheduling is to find a common free time for all participants for a particular meeting. Meeting scheduling is an important activity in many organizations, as most of the office workers spend much of their time in scheduling meetings. It is a time-consuming, iterative, and tedious task. There exist several solutions in the literature for centralized calendar management and meeting scheduling, but they are of limited success. We propose a new approach based on the A*-algorithm for meeting scheduling, which is expected to perform well, even in the case of large problem instances, compared to the existing algorithm.