A Meeting Scheduling Problem Respecting Time and Space

Author(s):  
Florian Berger ◽  
Rolf Klein ◽  
Doron Nussbaum ◽  
Jörg-Rüdiger Sack ◽  
Jiehua Yi
2008 ◽  
Vol 13 (4) ◽  
pp. 453-481 ◽  
Author(s):  
Florian Berger ◽  
Rolf Klein ◽  
Doron Nussbaum ◽  
Jörg-Rüdiger Sack ◽  
Jiehua Yi

Author(s):  
Mohammad Amin Rigi ◽  
Farid Khoshalhan

Meeting Scheduling Problem (MSP) arranges meetings between a number of participants. Reaching consensus in arranging a meeting is very diffuclt and time-consuming when the number of participants is large. One efficient approach for overcoming this problem is the use of multi-agent systems. In a multi-agent system, agents are deciding on behalf of their users. They must be able to elicite their users’ preferences in an effective way. This paper focuses on the elicitation of users’ preferences. Analytical hierarchy process (AHP) - which is known for its ability to determine preferences - is used in this research. Specifically, an adaptive preference modeling technique based on AHP is developed and implemented in a system and the initial validation results are encouraging.


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.


2011 ◽  
Vol 7 (2) ◽  
pp. 45-62 ◽  
Author(s):  
Mohammad Amin Rigi ◽  
Farid Khoshalhan

Meeting Scheduling Problem (MSP) arranges meetings between a number of participants. Reaching consensus in arranging a meeting is very diffuclt and time-consuming when the number of participants is large. One efficient approach for overcoming this problem is the use of multi-agent systems. In a multi-agent system, agents are deciding on behalf of their users. They must be able to elicite their users’ preferences in an effective way. This paper focuses on the elicitation of users’ preferences. Analytical hierarchy process (AHP) - which is known for its ability to determine preferences - is used in this research. Specifically, an adaptive preference modeling technique based on AHP is developed and implemented in a system and the initial validation results are encouraging.


2015 ◽  
Vol 66 (10) ◽  
pp. 1730-1741
Author(s):  
Agnès Le Roux ◽  
Odile Bellenguez-Morineau ◽  
Christelle Guéret ◽  
Damien Prot

Sign in / Sign up

Export Citation Format

Share Document