Multi-agent based decision mechanism for distributed meeting scheduling system

Ahrned Ashir, Kwang Hyoun Joo, Tetsuo Kinoshita, Norio Shiratori

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Citations (Scopus)

    Abstract

    In existing meeting scheduling systems, finding a common free time slot of all (prospective) participants is the goal. When such a free time slot is not found, the host has to ask the busy participants to change their schedules. Changing a schedule is a complex process requiring a lot of negotiations and, there is no guarantee that the goal will be achieved. In the worst case, the host has to ignore the time slot (which was probably the first choice) and try to schedule the meeting in another time slot (probably a lesser choice). The process will continue till the scheduling succeeds. We argue that it is not always necessary for all the participants to attend a meeting. There are some participants whose presence is mandatory for the meeting. The presence of other participants are non-mandatory. The meeting can proceed in the absence of some of the non-mandatory participants. This allows greater flexibility and more efficient scheduling. This paper introduces the concept of a Quorum in the meeting scheduling process and proposes a two-round negotiating protocol to find the time-slot which meets the quorum requirements. To establish the robustness of our scheduler, we simulated scheduling in our lab, and showed its flexibility in scheduling a meeting.

    Original languageEnglish
    Title of host publicationProceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS
    Editors Anon
    Place of PublicationLos Alamitos, CA, United States
    PublisherIEEE Comp Soc
    Pages275-280
    Number of pages6
    Publication statusPublished - 1997
    EventProceedings of the 1997 International Conference on Parallel and Distributed Systems - Seoul, South Korea
    Duration: 1997 Dec 101997 Dec 13

    Other

    OtherProceedings of the 1997 International Conference on Parallel and Distributed Systems
    CitySeoul, South Korea
    Period97/12/1097/12/13

    Fingerprint

    Scheduling

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Ashir, A., Joo, K. H., Kinoshita, T., & Shiratori, N. (1997). Multi-agent based decision mechanism for distributed meeting scheduling system. In Anon (Ed.), Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS (pp. 275-280). Los Alamitos, CA, United States: IEEE Comp Soc.

    Multi-agent based decision mechanism for distributed meeting scheduling system. / Ashir, Ahrned; Joo, Kwang Hyoun; Kinoshita, Tetsuo; Shiratori, Norio.

    Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. ed. / Anon. Los Alamitos, CA, United States : IEEE Comp Soc, 1997. p. 275-280.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Ashir, A, Joo, KH, Kinoshita, T & Shiratori, N 1997, Multi-agent based decision mechanism for distributed meeting scheduling system. in Anon (ed.), Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. IEEE Comp Soc, Los Alamitos, CA, United States, pp. 275-280, Proceedings of the 1997 International Conference on Parallel and Distributed Systems, Seoul, South Korea, 97/12/10.
    Ashir A, Joo KH, Kinoshita T, Shiratori N. Multi-agent based decision mechanism for distributed meeting scheduling system. In Anon, editor, Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. Los Alamitos, CA, United States: IEEE Comp Soc. 1997. p. 275-280
    Ashir, Ahrned ; Joo, Kwang Hyoun ; Kinoshita, Tetsuo ; Shiratori, Norio. / Multi-agent based decision mechanism for distributed meeting scheduling system. Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. editor / Anon. Los Alamitos, CA, United States : IEEE Comp Soc, 1997. pp. 275-280
    @inproceedings{6a8b8d0676df46b4984c9c7665519db8,
    title = "Multi-agent based decision mechanism for distributed meeting scheduling system",
    abstract = "In existing meeting scheduling systems, finding a common free time slot of all (prospective) participants is the goal. When such a free time slot is not found, the host has to ask the busy participants to change their schedules. Changing a schedule is a complex process requiring a lot of negotiations and, there is no guarantee that the goal will be achieved. In the worst case, the host has to ignore the time slot (which was probably the first choice) and try to schedule the meeting in another time slot (probably a lesser choice). The process will continue till the scheduling succeeds. We argue that it is not always necessary for all the participants to attend a meeting. There are some participants whose presence is mandatory for the meeting. The presence of other participants are non-mandatory. The meeting can proceed in the absence of some of the non-mandatory participants. This allows greater flexibility and more efficient scheduling. This paper introduces the concept of a Quorum in the meeting scheduling process and proposes a two-round negotiating protocol to find the time-slot which meets the quorum requirements. To establish the robustness of our scheduler, we simulated scheduling in our lab, and showed its flexibility in scheduling a meeting.",
    author = "Ahrned Ashir and Joo, {Kwang Hyoun} and Tetsuo Kinoshita and Norio Shiratori",
    year = "1997",
    language = "English",
    pages = "275--280",
    editor = "Anon",
    booktitle = "Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS",
    publisher = "IEEE Comp Soc",

    }

    TY - GEN

    T1 - Multi-agent based decision mechanism for distributed meeting scheduling system

    AU - Ashir, Ahrned

    AU - Joo, Kwang Hyoun

    AU - Kinoshita, Tetsuo

    AU - Shiratori, Norio

    PY - 1997

    Y1 - 1997

    N2 - In existing meeting scheduling systems, finding a common free time slot of all (prospective) participants is the goal. When such a free time slot is not found, the host has to ask the busy participants to change their schedules. Changing a schedule is a complex process requiring a lot of negotiations and, there is no guarantee that the goal will be achieved. In the worst case, the host has to ignore the time slot (which was probably the first choice) and try to schedule the meeting in another time slot (probably a lesser choice). The process will continue till the scheduling succeeds. We argue that it is not always necessary for all the participants to attend a meeting. There are some participants whose presence is mandatory for the meeting. The presence of other participants are non-mandatory. The meeting can proceed in the absence of some of the non-mandatory participants. This allows greater flexibility and more efficient scheduling. This paper introduces the concept of a Quorum in the meeting scheduling process and proposes a two-round negotiating protocol to find the time-slot which meets the quorum requirements. To establish the robustness of our scheduler, we simulated scheduling in our lab, and showed its flexibility in scheduling a meeting.

    AB - In existing meeting scheduling systems, finding a common free time slot of all (prospective) participants is the goal. When such a free time slot is not found, the host has to ask the busy participants to change their schedules. Changing a schedule is a complex process requiring a lot of negotiations and, there is no guarantee that the goal will be achieved. In the worst case, the host has to ignore the time slot (which was probably the first choice) and try to schedule the meeting in another time slot (probably a lesser choice). The process will continue till the scheduling succeeds. We argue that it is not always necessary for all the participants to attend a meeting. There are some participants whose presence is mandatory for the meeting. The presence of other participants are non-mandatory. The meeting can proceed in the absence of some of the non-mandatory participants. This allows greater flexibility and more efficient scheduling. This paper introduces the concept of a Quorum in the meeting scheduling process and proposes a two-round negotiating protocol to find the time-slot which meets the quorum requirements. To establish the robustness of our scheduler, we simulated scheduling in our lab, and showed its flexibility in scheduling a meeting.

    UR - http://www.scopus.com/inward/record.url?scp=0031381664&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0031381664&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:0031381664

    SP - 275

    EP - 280

    BT - Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS

    A2 - Anon, null

    PB - IEEE Comp Soc

    CY - Los Alamitos, CA, United States

    ER -