Design and implementation of conference scheduling and voting facilities for a multi-media conferencing system

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

1 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Journal / PublicationProceedings - IEEE Computer Society's International Computer Software & Applications Conference
Publication statusPublished - 1994

Conference

TitleProceedings of the 18th Annual International Computer Software & Applications Conference (COMPSAC 94)
CityTaipei, Taiwan
Period9 - 11 November 1994

Abstract

The design and implementation of a meeting scheduler for a multi-media conferencing system is described in this paper. The scheduling algorithm is the TSP algorithm which is a modified version of Sgihara's Timetable Rearrangement heuristic. The first step in timetable processing is to collect and split the conferee record into public and private timetables. The main objective of the TSP algorithm is to minimized the amount of rescheduling required. The result of this phase of scheduling is that a list of possible timetables are ranked and presented to the conference chairman, who can choose any of these alternatives. The chosen public timetable is then reconciled with the private timetables of the conferees to form a composite timetable. The result is once again presented to the conference chairman for final decision. If acceptable, the resulting timetable is used to update the individual conferee record.

Citation Format(s)