Conference arrangement optimization method based on intelligent matching

Abstract

The invention discloses a conference arrangement optimization method based on intelligent matching. The method comprises the following steps: setting a time period for preparing to match a conference and a time point for automatic matching; collecting schedule information, conference room information and use conditions of participants; collecting conference information prepared in any time period, processing the conference information, and storing the conference information in a system information database; after the time point of automatic matching is reached, performing preliminary screening on alternative conference time periods of each conference, and according to the schedule time periods of all participants and the reserved time periods of the conference rooms, removing conflicted schedule time periods, conflicted reserved time periods of the conference rooms or alternative conference time periods which are less than the conference time length; and calculating the score of the appointment time of each conference, and appointment the conference according to the priority to realize the goal of successfully appointment the most conferences in the time period. Through the intelligent matching conference arrangement optimization method, intelligent matching and screening can be realized, the accuracy and efficiency of conference arrangement can be improved, and tedious communication and coordination processes can be reduced.

Description

Technical Field

[0001] The present application relates to the field of intelligent management technology, and specifically to a conference arrangement optimization method based on intelligent matchmaking. Background Art

[0002] Most existing smart conference systems require each meeting scheduler to enter the meeting time and attendees to make meeting reservations separately, or administrative staff to conduct simple statistics offline. They are unable to intelligently match the actual situation of the attendees, resulting in unreasonable meeting arrangements and frequent conflicts in meeting times, which prevents scheduled meetings from proceeding normally. Or the schedules of attendees may change temporarily, and multiple meetings need to be re-planned. Or after the meeting time is confirmed, it may be impossible to book a meeting room in that time period. This phenomenon may also cause the scheduler to make appointments for multiple time periods in advance, resulting in a waste of meeting room resources. Summary of the invention

[0003] This application provides a meeting arrangement optimization method based on intelligent matching to solve the problem of how to efficiently coordinate the meeting time, location and intelligent matching and matching of participants.

[0004] The present application embodiment provides a conference arrangement optimization method based on intelligent matchmaking, including:

[0005] Step 1: Set the time period for preparing the matchmaking meeting and the time point for automatic matchmaking;

[0006] Step 2: Collect the schedule information of participants, conference room information and usage;

[0007] Step 3: Collect meeting information to be held in any time period, and store the meeting information in the system information database after processing;

[0008] Step 4: After the automatic matching time point arrives, the candidate meeting time slots for each meeting are preliminarily screened, and conflicting schedule time slots, conflicting meeting room reserved time slots or candidate meeting time slots that are shorter than the meeting duration are removed according to the schedule time slots of all participants and the reserved time slots of the meeting room;

[0009] Step 5: Calculate the score of each meeting reservation time, and schedule meetings by priority to achieve the goal of successfully scheduling the most meetings within the time period.

[0010] Furthermore, the meeting information includes participants, meeting rooms, meeting duration, and alternative meeting times. The information is obtained by online entry by the meeting scheduler, and the collected meeting information is processed and stored in the system information database.

[0011] Furthermore, there are k meetings, represented by the set M = {m1,m2...m k}, for meeting m k , whose participants are represented by the set P k ={p1,p2...p n}, the conference room is represented by r k , the meeting duration is denoted as d k , the alternative meeting time is represented as a set Get the schedule time of the participants from the system information database according to the participants, expressed as a set According to the conference room, obtain the reserved time period of the conference room from the system information database and record it as a set Where t = [s, e), ts represents the start time, te represents the end time, and the conflicting schedule time periods are removed from the alternative meeting time periods. and Execute the function on the elements in

[0012] in Defined as

[0013] Further, the conflicting reserved time periods of the conference rooms are removed from the candidate meeting time periods, and the comparison is performed. and Execute the function on the elements in in Defined as

[0014] Further, the alternative meeting time periods that are less than the meeting time are removed from the alternative meeting time periods. Execute function in Defined as

[0015] Further, step five includes: for meeting m k , execute the function Where f(m i ) is defined as C k For each meeting m k The set of meetings that are expected to conflict; list all possible reservations for meeting m k By meeting duration k Split, the meeting appointment time is represented as a set The number of meeting reservation times is recorded as q k ; Calculate each appointment time Rating For each The conference it belongs to is m k , the set of meetings C that are expected to have conflicts k ={c1,c2...c m}, the set used to calculate the score is denoted as Q k , for C k Execute function in in Defined as Get Q k ={q1,q2...q m}, then Get ratings The smallest possible appointment, according to the meeting appointment time After the appointment is successful, other meetings are deleted and There are conflicting meeting appointments during this time.

[0016] Furthermore, if the meeting m k The meeting reservation time no longer exists, that is, k =0, then the meeting m k Mark as appointment failed, for the meeting m k Modify alternative meeting times or meeting rooms online and reschedule the meeting.

[0017] The technical solution of this application includes at least the following advantages: through the intelligent matching conference arrangement optimization method, it is possible to achieve intelligent matching and screening of meeting time, meeting location, and participants, to avoid participants having to attend multiple meetings in the same time period, and multiple meetings in the conference room having to be held in the same time period, to effectively arrange the most meetings within the time period, to improve the accuracy and efficiency of meeting arrangements, and to reduce cumbersome communication and coordination processes. After collecting meeting information, a meeting appointment plan is generated regularly without manual intervention. When the schedule of the participants changes, it can be re-matched immediately, saving the communication cost of re-planning. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the specific implementation methods of the present application or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0019] Figure 1 A schematic diagram of the steps of a conference arrangement optimization method based on intelligent matchmaking provided in an embodiment of the present invention;

[0020] Figure 2A schematic diagram of a conference matching cycle filling page provided in an embodiment of the present invention;

[0021] Figure 3 A schematic diagram of a meeting information filling page provided in an embodiment of the present invention;

[0022] Figure 4 A page for selecting alternative time provided in an embodiment of the present invention, showing a schematic diagram of the busy time periods of the participants;

[0023] Figure 5 A conference room selection page provided in an embodiment of the present invention, showing a schematic diagram of the current usage of the conference room;

[0024] Figure 6 A schematic diagram of modifying online conference information of a failed reservation provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0025] The following will be combined with the accompanying drawings to clearly and completely describe the technical solutions in this application. Obviously, the described embodiments are part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0026] The technical features involved in the different embodiments of the present application described below can be combined with each other as long as they do not conflict with each other.

[0027] Figure 1 A schematic diagram of the steps of a conference arrangement optimization method based on intelligent matching provided by an embodiment of the present invention. An embodiment of the present invention provides a conference arrangement optimization method based on intelligent matching, including:

[0028] S11, setting the time period for preparing the matchmaking meeting and the time point for automatic matchmaking;

[0029] S12. Collect the schedule information of participants, conference room information and usage;

[0030] S13, collecting meeting information to be held in any time period, and storing the meeting information in the system information database after processing;

[0031] S14, when the automatic matching time point arrives, preliminary screening is performed on the candidate meeting time slots for each meeting, and conflicting schedule time slots, conflicting meeting room reserved time slots or candidate meeting time slots that are shorter than the meeting duration are removed according to the schedule time slots of all participants and the reserved time slots of the meeting room;

[0032] S15. Calculate the score of each meeting reservation time, and reserve meetings according to priority to achieve the goal of successfully reserving the most meetings within the time period.

[0033] Figure 2 This is a schematic diagram of a conference matchmaking cycle filling page provided by an embodiment of the present invention. Figure 2 , set the time period for preparing the matchmaking meeting to be from November 11, 2024 to November 15, 2024, and the time point for automatic matching to be 15:00 on November 11, 2024. The above information is obtained through online entry by the meeting organizer, and the collected information is processed and stored in the system information database.

[0034] In S12, the schedule information of the participants, the conference room information and the usage are collected. The information is obtained by connecting to the existing enterprise management system, etc. The collected information is processed and stored in the system information database.

[0035] Figure 3 This is a schematic diagram of a meeting information filling page provided by an embodiment of the present invention. Figure 3 , collect meeting information to be held in any time period, including participants, meeting rooms, meeting duration, alternative meeting times, etc. Figure 3 It is shown that the host of the meeting at a certain time is Jiang Yuzhong. This information is obtained through online entry by the meeting scheduler. The collected information is processed and stored in the system information database. Figure 4 A page for selecting alternative time provided in an embodiment of the present invention, showing a schematic diagram of the busy time periods of the participants; Figure 5 This is a schematic diagram of the conference room selection page provided by the embodiment of the present invention, showing the current usage of the conference room. Figure 4 as well as Figure 5 When filling in the meeting information, the meeting scheduler can view the busy and idle status of the participants, the usage of the conference room and other information in real time, which can initially avoid conflicts in subsequent meeting reservations. Figure 4 Participants in the 09:00-10:30 meeting on November 12 will also attend the 13:00-14:30 and 16:00-17:30 meetings on November 13, and the 13:00-14:30 and 17:00-18:30 meetings on November 15. Figure 5 , select the conference room page to display the current usage of the conference room. On November 11, 2024, the time periods of 12:00-14:00 of 33F-Conference Room-001 and 16:00-18:00 of 33F-Conference Room-002 are occupied, and 33F-Conference Room-003 and 33F-Conference Room-005 are both idle.

[0036] In S14, the schedule time period of the participants and the reserved time period of the conference room are obtained. There are k meetings, which are represented by a set M = {m1, m2...m k}, for meeting m k , whose participants are represented by the set P k ={p1,p2...p n}, the conference room is represented by r k , the meeting duration is denoted as d k , the alternative meeting time is represented as a set Get the schedule time of the participants from the system information database according to the participants, expressed as a set According to the conference room, obtain the reserved time period of the conference room from the system information database and record it as a set Where t = [s, e), ts represents the start time, te represents the end time, and the conflicting schedule time periods are removed from the alternative meeting time periods. and Execute the function on the elements in in Defined as

[0037] Remove the conflicting meeting room reservation time slots from the alternative meeting time slots. and Execute the function on the elements in in Defined as

[0038] Remove the alternative meeting time periods that are less than the meeting duration from the alternative meeting time periods. Execute function in Defined as

[0039] If there are no alternative meeting times for the meeting, the appointment will be marked as failed.

[0040] S15 includes:

[0041] S151, for meeting m k , execute the function Where f(m i ) is defined as C k For each meeting m k A collection of meetings where conflicts are expected;

[0042] S152, list all possible appointments, for meeting m k By meeting duration k Split, such as d k =60min, the time granularity is 30min, then It can be split into [2024-11-11 10:00, 2024-11-11 11:00), [2024-11-11 10:30, 2024-11-11 11:30), [2024-11-11 11:00, 2024-11-11 12:00). After the split is completed, the meeting appointment time is expressed as a set The number of meeting reservation times is recorded as q k ;

[0043] S153, calculate each appointment time Rating For each The conference it belongs to is m k , the set of meetings C that are expected to have conflicts k ={c1,c2...c m}, the set used to calculate the score is denoted as Q k , for C k Execute function in in Defined as Get Q k = {q 1, q2...q m}, then

[0044] S154. Get ratings The smallest possible appointment, according to the meeting appointment time After the appointment is successful, other meetings are deleted and There are conflicting meeting appointments during this time.

[0045] S155, if the meeting m k The meeting reservation time no longer exists, that is, k =0, then the meeting m k Mark as failed appointment;

[0046] S156: Repeat steps S153-S155 for the unprocessed meetings until all meetings are processed. k Modify alternative meeting times or meeting rooms online and reschedule the meeting.

[0047] Figure 6 A schematic diagram of online modification of conference information of failed reservation provided by an embodiment of the present invention. Figure 6 If the matchmaking fails, a pop-up window will pop up to remind the person who made the reservation to rematch the meeting. Figure 6 On December 13th from 11:00 to 12:30 in 28F-Conference Room-001, the meeting hosted by Jiang Yuzhong failed to be matched, and a failure page would pop up to prompt to change the meeting time or rematch the meeting room.

[0048] Obviously, the above embodiments are merely examples for the purpose of clear explanation, and are not intended to limit the implementation methods. For those skilled in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to list all the implementation methods here. The obvious changes or modifications derived therefrom are still within the scope of protection created by this application.

Claims

1. A conference arrangement optimization method based on intelligent matchmaking, characterized in that: include: Step 1: Set the time period for preparing the matchmaking meeting and the time point for automatic matchmaking; Step 2: Collect the schedule information of participants, conference room information and usage; Step 3: Collect meeting information to be held in any time period, and store the meeting information in the system information database after processing; Step 4: After the automatic matching time point arrives, the candidate meeting time slots for each meeting are preliminarily screened, and conflicting schedule time slots, conflicting meeting room reserved time slots or candidate meeting time slots that are shorter than the meeting duration are removed according to the schedule time slots of all participants and the reserved time slots of the meeting room; Step 5: Calculate the score of each meeting reservation time, and schedule meetings by priority to achieve the goal of successfully scheduling the most meetings within the time period.

2. The conference arrangement optimization method based on intelligent matchmaking according to claim 1 is characterized in that: The meeting information includes participants, meeting rooms, meeting duration, and alternative meeting times. The information is obtained by online entry by the meeting scheduler. The collected meeting information is processed and stored in the system information database.

3. The conference arrangement optimization method based on intelligent matchmaking according to claim 1 is characterized in that: Suppose there are k meetings, represented by the set M = {m1,m2...m k }, for meeting m k , whose participants are represented by the set P k ={p1,p2...p n }, the conference room is represented by r k , the meeting duration is denoted as d k , the alternative meeting time is represented as a set Get the schedule time of the participants from the system information database according to the participants, expressed as a set According to the conference room, obtain the reserved time period of the conference room from the system information database and record it as a set Where t = [s, e), ts represents the start time, te represents the end time, and the conflicting schedule time periods are removed from the alternative meeting time periods. and Execute the function on the elements in in Defined as 4. The method for optimizing conference arrangement based on intelligent matchmaking according to claim 3 is characterized in that: Remove the conflicting meeting room reservation time slots from the alternative meeting time slots. and Execute the function on the elements in in Defined as 5. The method for optimizing conference arrangement based on intelligent matchmaking according to claim 3 is characterized in that: Remove the alternative meeting time periods that are less than the meeting duration from the alternative meeting time periods. Execute function in Defined as 6. The method for optimizing conference arrangement based on intelligent matchmaking according to claim 3 is characterized in that: Step five includes: For meeting m k , execute the function Where f(m i ) is defined as C k For each meeting m k A collection of meetings where conflicts are expected; List all possible appointments for the meeting k By meeting duration k Split, the meeting appointment time is represented as a set The number of meeting reservation times is recorded as q k ; Calculate each appointment time Rating For each The conference it belongs to is m k , the set of meetings C that are expected to have conflicts k ={c1,c2...c m }, the set used to calculate the score is denoted as Q k , for C k Execute function in in Defined as Get Q k = {q 1, q2...q m }, then Get ratings The smallest possible appointment, according to the meeting appointment time After the appointment is successful, other meetings are deleted and There are conflicting meeting appointments during this time.

7. The method for optimizing conference arrangement based on intelligent matchmaking according to claim 6 is characterized in that: If the meeting k The meeting reservation time no longer exists, that is, k =0, then the meeting m k Mark as appointment failed, for the meeting m k Modify alternative meeting times or meeting rooms online and reschedule the meeting.

Images