Meeting Scheduling Application using Availability and Priority Attendance Heuristics
Aswin Wibisurya1, Ikhtiar Faahakhododo2
1Aswin Wibisurya*, Faculty Member, Mobile Application and Technology Program, Computer Science Department, School of Computer Science, Bina Nusantara University, Jakarta, Indonesia.
2Ikhtiar Faahakhododo, Faculty Member, Mobile Application and Technology Program, Computer Science Department, School of Computer Science, Bina Nusantara University, Jakarta, Indonesia.
Manuscript received on November 22, 2019. | Revised Manuscript received on December 15, 2019. | Manuscript published on December 30, 2019. | PP: 4302-4306 | Volume-9 Issue-2, December, 2019. | Retrieval Number: B4243129219/2019©BEIESP | DOI: 10.35940/ijeat.B4243.129219
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Meeting scheduling is a repetitive and time consuming task for many organizations. Emails and electronic calendars has been used to help a meeting host in this process. However, it does not automate the process of searching the optimal time slot. Manual scheduling may result in suboptimal schedule. Therefore, automation is needed for meeting scheduling problem. The purpose of this research is to propose an applied model consisting of both acquiring participants’ existing schedule, and searching for an optimal time slot. Previous studies groups the solution of meeting scheduling into either constraint satisfaction or heuristics approach. Heuristics is more appropriate for a dynamic environment. The heuristics-based model is designed to consider participant availability and participant prioritization. The more participants are available, the better the time is as a candidate for optimum schedule. In the proposed model, the availability of certain key person, experts, or host may carry more weight than normal participant. An Android based application is developed as a prove of concept of the proposed model. Google Calendar API is used in this model to acquire the existing schedule, then each time slot is assigned a score based on availability weighting. The time slot with the highest score is considered the optimal solution. Evaluation is done by simulating the scheduling part for various numbers of meetings and time slots. The result shows that the model is capable of searching the optimal meeting schedule in less than one second for each of the experiment.
Keywords: Meeting scheduling problem, agent-based, heuristics, mobile application.