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, an...

Full description

Saved in:
Bibliographic Details
Published inTENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region Vol. 1; pp. 419 - 423 Vol.1
Main Authors Sugumaran, M., Easwarakumar, K.S., Narayanasamy, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Artificial intelligence
Calendars
Computer science
Data communication
Face
Humans
Information management
Office automation
Processor scheduling
Scheduling algorithm
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:0780381629
9780780381629
DOI:10.1109/TENCON.2003.1273357