JP7074743B2 - Automatic schedule adjustment system, automatic schedule adjustment method and program - Google Patents

Description

The present invention relates to an automatic schedule adjustment system, an automatic schedule adjustment method and a program.

In order to promote productive work in the information-oriented society, it is common sense to visualize and share the schedule of each person's work and meetings using a so-called scheduler. Commercially available schedulers provide a user interface that visualizes each person's schedule in various forms, for example, arranging multiple people's schedules on a daily, weekly, or monthly basis, and grouping related members. Ingenuity has been made to improve the efficiency of schedule adjustment for meetings consisting of multiple people, such as making it easier to search for schedules.
Further, a method for automating the schedule adjustment itself composed of a plurality of people has been devised (see Patent Documents 1 to 3). Patent Document 1 proposes a method of searching for free time of a conference participant by inputting a conference participant and place, a date candidate (duration), and a holding time, and outputting a plurality of conference scheduled time candidates. .. Patent Document 2 proposes a method of giving weights (important members, non-important members) to participants and outputting a scheduled meeting time that minimizes the number of people who cannot participate without removing important members.

On the other hand, when adjusting the schedule of a plurality of people including busy people, there may be no free time for all to participate within a specific period. Furthermore, the authority of the person who adjusts the schedule may not be able to change the schedule of others due to job title or psychological barriers, and extra work such as adjusting the schedule by other means such as e-mail is occurring. ..
Patent Document 3 proposes a method of defining one of the overlapping meetings as a "change target meeting" and moving the change target meeting to another date and time when the schedules are duplicated when adjusting the schedule. ing. In addition, if there is a date and time candidate for the destination, a mechanism is provided to automatically issue a date and time change request to the participants of the meeting to be changed.
However, Patent Document 3 only mentions that the destination of the "change target meeting" is searched from the free time of the participating members of the meeting, and does not describe a specific search method. For example, if only the free time of the participating members of the duplicate meeting is searched again, the problem that the free time does not exist at the time when the busy user is included cannot be solved.
Further, in Patent Document 3, it is a mechanism that all the participating members need to make a decision as to whether or not to move the meeting when the meeting overlaps. It is not an essential solution to the problem, such as "The schedule cannot be changed due to rules or psychological barriers."

Japanese Patent Application Laid-Open No. 2003-256622 Japanese Unexamined Patent Publication No. 06-004540 Japanese Patent Application Laid-Open No. 2015-170032

When adjusting the schedule of a meeting or the like using the scheduler, when adjusting the schedule of a plurality of people including busy people, there is no free time for all to participate within a specific period in the first place. Along with this, extra work such as adjusting the schedule by other means such as e-mail is occurring. On the other hand, although methods such as automatically adjusting the schedule within a certain range of free time, or searching for free time again and issuing an adjustment request when the meetings overlap, it is not an essential solution. Not.

In view of the above-mentioned problems, the present invention eliminates the need for human work such as searching for free time, requesting schedule adjustment to secure free time, and the person receiving the request changing the schedule in a chain reaction. It is intended to provide an automatic schedule adjustment system, an automatic schedule adjustment method and a program that can be used.

One aspect of the present invention is an automatic schedule adjustment system that adjusts the schedules of a plurality of users, and is an attribute indicating whether or not the schedule holding time may be changed for each of the schedules of the plurality of users. When adjusting a new schedule with the attribute assignment unit that grants It is an automatic schedule adjustment system including a schedule moving unit that secures the free time by moving the schedule assigned by the attribute assigning unit to another time zone.

One aspect of the present invention is an automatic schedule adjustment method for adjusting the schedules of a plurality of users, and is an attribute indicating whether or not the schedule holding time may be changed for each of the schedules of the plurality of users. When adjusting the attribute assignment step and the new schedule, the holding time may be changed if the free time that all of the plurality of users can participate in does not exist within the predetermined period. This is an automatic schedule adjustment method including a schedule movement step for securing the free time by moving the schedule assigned in the attribute assignment step to another time zone.

One aspect of the present invention is to perform an attribute assignment step of assigning an attribute indicating whether or not the schedule holding time may be changed to each of the schedules of a plurality of users to the computer, and adjusting a new schedule. At that time, if the free time that all the plurality of users can participate in does not exist within the period specified in advance, an attribute indicating that the holding time may be changed is assigned in the attribute assignment step. , It is a program for executing the scheduled movement step for securing the free time by moving to another time zone.

According to the present invention, an automatic schedule that can eliminate the need for human work such as searching for free time, requesting schedule adjustment to secure free time, and changing the schedule in a chain reaction by the person who receives the request. Coordination systems, automatic schedule adjustment methods and programs can be provided.

It is a figure which shows an example which compared the schedule before the adjustment is executed by the automatic schedule adjustment system of this invention, and the schedule after the adjustment is executed by the automatic schedule adjustment system of this invention. It is a figure which shows an example of the automatic schedule adjustment system of 1st Embodiment. It is a figure which shows an example of the automatic schedule adjustment system of 1st Embodiment. It is a figure which shows an example of the information which is stored in a schedule database. It is a sequence diagram which shows an example of the process executed in the system including the automatic schedule adjustment system shown in FIG. It is a figure which shows an example of the screen displayed on the user terminal during execution of the operation flow shown in FIG. It is a flowchart for demonstrating an example of the process executed in the automatic schedule adjustment part of the automatic schedule adjustment system of 1st Embodiment. It is a figure which shows an example of the elementary matrix created by the elementary matrix creation part. It is a flowchart for demonstrating a specific example of the process executed in step S13 of FIG. 7 by the automatic schedule adjustment part of the automatic schedule adjustment system of 1st Embodiment. It is a flowchart for demonstrating a specific example of the process executed in step S13 of FIG. 7 by the automatic schedule adjustment part of the automatic schedule adjustment system of 2nd Embodiment. It is a flowchart for demonstrating a specific example of the process executed in step S13 of FIG. 7 by the automatic schedule adjustment part of the automatic schedule adjustment system of 3rd Embodiment. It is a figure for demonstrating each example of the criteria for selecting the appointment of the "variation" attribute. It is a flowchart for demonstrating a specific example of the process executed in step S13 of FIG. 7 by the automatic schedule adjustment part of the automatic schedule adjustment system of 4th Embodiment.

Hereinafter, embodiments of the automatic schedule adjustment system, the automatic schedule adjustment method, and the program of the present invention will be described.
FIG. 1 is a diagram showing an example of comparing a schedule before the adjustment is executed by the automatic schedule adjustment system of the present invention and a schedule after the adjustment is executed by the automatic schedule adjustment system of the present invention. In detail, FIG. 1 (A) shows Mr. A's schedule 1, schedule 2, and Mr. B's schedule 3, schedule 4, schedule 5, and Mr. C before the adjustment is executed by the automatic schedule adjustment system of the present invention. It shows the schedule 6 of. FIG. 1B shows Mr. A's schedule 1, schedule 2, Mr. B's schedule 3, schedule 4, schedule 5, and Mr. C's schedule 6 after the adjustment is executed by the automatic schedule adjustment system of the present invention. , Mr. A, Mr. B and Mr. C have new plans.
In the example shown in FIG. 1, the time for setting a new schedule for one hour for Mr. A, Mr. B, and Mr. C at the stage shown in FIG. 1 (A) before the adjustment is executed by the automatic schedule adjustment system of the present invention. There is no band. Therefore, in the automatic schedule adjustment system of the present invention, Mr. B's schedule 3 is set from the time zone of 14:00 to 15:00 (see FIG. 1 (A)) to the time zone of 13:00 to 14:00 (FIG. 1). Move to 1 (B)) and move Mr. C's schedule 6 from 14:00 to 16:00 (see Fig. 1 (A)) to 15:00 to 17:00 (Fig. 1). 1 (Refer to (B))). As a result, free time from 14:00 to 15:00 (see FIG. 1B) is secured. Further, the automatic schedule adjustment system of the present invention sets new schedules of Mr. A, Mr. B, and Mr. C in the free time (time zone from 14:00 to 15:00). That is, the automatic schedule adjustment system of the present invention adjusts the schedules of a plurality of users. In detail, the automatic schedule adjustment system of the present invention searches for free time, requests schedule adjustment to secure free time, and the person who receives the request changes the schedule in a chain reaction, as described later. Coordinate multiple users' appointments without the need for human work.
Next, each embodiment which realizes the automatic schedule adjustment system of this invention will be described.

<First Embodiment>
2 and 3 are diagrams showing an example of the automatic schedule adjustment system 1 of the first embodiment. In detail, FIG. 2 shows an example of the relationship between the automatic schedule adjustment system 1 of the first embodiment, the user terminal UT1 of Mr. A, the user terminal UT2 of Mr. B, and the user terminal UT3 of Mr. C. FIG. 3A shows an example of the functional block of the automatic schedule adjustment system 1 of the first embodiment, and FIG. 3B shows the details of the automatic schedule adjustment unit 12 in FIG. 3A. ..
In the example shown in FIG. 2, the systems to which the automatic schedule adjustment system 1 of the first embodiment is applied are the automatic schedule adjustment system 1, Mr. A's user terminal UT1, Mr. B's user terminal UT2, and Mr. C's. It is configured by a user terminal UT3. The automatic schedule adjustment system 1 is built on a general PC (personal computer), a workstation, or a virtual machine equipped with a CPU (central processing unit), a memory, and a storage device. The user terminals UT1, UT2, and UT3 are composed of general PCs, smartphones, and tablet terminals. The automatic schedule adjustment system 1 and the user terminals UT1, UT2, and UT3 are connected via a network. The network is, for example, a LAN (local area network), a campus network, the Internet, or the like, and the network configuration may be a configuration other than the configuration shown in FIG.

In the example shown in FIG. 3, the automatic schedule adjustment system 1 includes a user interface unit 11, an automatic schedule adjustment unit 12, a scheduler basic function unit 13, a schedule database 14, a user database 15, and a location database 16. ing.
The user interface unit 11 accepts schedule inputs from a plurality of users. The user interface unit 11 provides a graphical user interface (UI) to the user via a Web browser or application. The user interface unit 11 has a UI function as a scheduler and a unique UI function for automatic schedule adjustment, which will be described later. The UI function of the user interface unit 11 as a scheduler may be the same as the function of a general scheduler.
In the unique UI function for automatic schedule adjustment, the user interface unit 11 decides whether each of the schedules of a plurality of users may change the holding time or cannot change the holding time. Accepts information indicating.

The logic portion of the automatic schedule adjustment provided by the automatic schedule adjustment system 1 of the present invention is provided by the automatic schedule adjustment unit 12. The automatic schedule adjustment unit 12 searches for a time zone in which the schedule can be adjusted according to the contents specified by the user. In the example shown in FIGS. 1 and 2, the automatic schedule adjustment unit 12 sets a time zone in which the "new schedule" (see FIG. 1 (B)) can be adjusted with the contents specified by Mr. A, Mr. B, and Mr. C. Explore.
If you cannot find the free time well, adjust the schedule while changing the holding time of the existing schedule. In the example shown in FIGS. 1 and 2, when the free time for setting the 1-hour "new schedule" is not found as shown in FIG. 1 (A), the automatic schedule adjustment unit 12 uses the existing "schedul 3". , "New Schedule" and "Schedule 1" to "Schedule 6" are adjusted as shown in FIG. 1 (B) while changing the holding time of "Schedule 6" (see FIG. 1 (A)).

The automatic schedule adjustment unit 12 includes an attribute assignment unit 12A, a basic matrix creation unit 12B, a search matrix creation unit 12C, a free time search unit 12D, and an output unit 12E.
The attribute assigning unit 12A assigns an attribute indicating whether or not the scheduled holding time may be changed to each of the schedules of the plurality of users. In the example shown in FIG. 1, the attribute assigning unit 12A changes the scheduled holding time for each of Mr. A's schedule 1, schedule 2, Mr. B's schedule 3 to schedule 5, and Mr. C's schedule 6. Add an attribute indicating whether it is good or not. Specifically, the attribute assigning unit 12A assigns a "variable" attribute to a schedule whose holding time may be changed, and assigns a "fixed" attribute to a schedule whose holding time cannot be changed.
The elementary matrix creation unit 12B creates an elementary matrix (see FIG. 8) composed of a plurality of rows corresponding to a plurality of time zones and a plurality of columns corresponding to a plurality of users.
The search matrix creation unit 12C creates a search matrix (see FIG. 8) representing a planned search range of a plurality of users. The search matrix creation unit 12C includes a correction unit 12C1. The correction unit 12C1 corrects the search matrix.
The free time search unit 12D searches for free time for setting a "new schedule" (see FIG. 1 (B)). The free time search unit 12D includes a scheduled movement unit 12D1. The schedule moving unit 12D1 moves any of a plurality of schedules to which the attribute of "variation" is given in order to secure free time. In the example shown in FIG. 1, the schedule moving unit 12D1 secures free time for setting a "new schedule" by moving the "scheduled 3" and the "scheduled 6" (see FIG. 1 (A)). .. Specifically, in the example shown in FIG. 1 (A), even if an attempt is made to set a "new schedule" for one hour, the free time that all Mr. A, Mr. B, and Mr. C can participate in is set in advance. Since it does not exist within (13:00 to 17:00), the scheduled movement unit 12D1 moves "Schedule 3" to which the attribute "variation" is given to another time zone (13:00 to 14:00). At the same time, the "scheduled 6" to which the attribute "variation" is assigned is moved to another time zone (15:00 to 17:00). As a result, free time (14:00 to 15:00) for setting a "new schedule" is secured.
The output unit 12E outputs the schedule adjustment result and the like by the automatic schedule adjustment unit 12.

In the example shown in FIG. 3, the scheduler basic function unit 13 provides basic functions such as user authentication, system log management, and schedule management (addition / deletion / editing) that a general scheduler has.
The schedule database 14 is a DB (database) in which a schedule is a unit of one record, and stores information about the schedule. In the example shown in FIG. 1, the schedule database 14 stores information about each of the "new schedule" and the "plan 1" to "plan 6".
The user database 15 stores information about a user who uses the automatic schedule adjustment system 1. In the example shown in FIGS. 1 and 2, the user database 15 has user information of a user (Mr. A) who uses the user terminal UT1, user information of a user (Mr. B) who uses the user terminal UT2, and user terminal UT3. Stores user information of the user (Mr. C) who uses.
The location database 16 stores location information which is information indicating a scheduled implementation location (meeting room or the like) adjusted by the automatic schedule adjustment system 1. In the example shown in FIG. 1, the location database 16 stores location information indicating a conference room or the like in which "new appointment" and "scheduled 1" to "scheduled 6" are executed.

FIG. 4 is a diagram showing an example of information and the like stored in the schedule database 14.
In the example shown in FIG. 4, the schedule "date and time", "scheduled name", "participant", "location (meeting room, etc.)", "memo" and "attribute (whether or not the holding time can be changed)" Information indicating the above is stored in the schedule database 14.
Information indicating the "date and time", "scheduled name", "memo" and "attribute" is input from the user terminals UT1, UT2 and UT3 and stored in the scheduled database 14.
Further, the user information existing in the user database 15 is selected and input from the user terminals UT1, UT2, and UT3, and is stored in the schedule database 14 as information indicating "participants".
Further, the place information existing in the place database 16 is selected and input from the user terminals UT1, UT2, and UT3, and is stored in the schedule database 14 as information indicating the "place" where the schedule is executed.
That is, in the example shown in FIG. 4, in addition to the general information element, an attribute value of either "fixed" or "variable" is given to each schedule. The automatic schedule adjustment unit 12 does not change the holding time of the schedule to which the attribute of "fixed" is given, but changes the schedule to which the attribute of "variable" is given to another time zone as needed. As a result, an appropriate holding time for the new schedule is searched for.
That is, in the example shown in FIG. 4, a plurality of users to which the schedule database 14 is given the attribute "variable" indicating that the holding time may be changed or the attribute "fixed" indicating that the holding time cannot be changed. Stores information about each of the appointments.

FIG. 5 is a sequence diagram showing an example of processing executed in the system including the automatic schedule adjustment system 1 shown in FIG. In detail, FIG. 5 shows the basic operation flow of the automatic schedule adjustment system 1. FIG. 6 is a diagram showing an example of a screen displayed on the user terminal during execution of the operation flow shown in FIG.
In the example shown in FIG. 5, in step S1, the user AA inputs the schedule adjustment content via the user terminal (for example, the user terminal UT1 (see FIG. 2)). In step S1, as illustrated in FIG. 6A, in addition to general information such as the title of the schedule, participants, and location, the period and time for which the schedule is to be adjusted, and the attributes of the meeting (“fixed” or “variable”). "Or) is entered.
Next, in step S2, the user interface unit 11 receives the schedule adjustment content input in step S1 and transmits the schedule adjustment content (automatic schedule adjustment request) to the automatic schedule adjustment unit 12.
Next, in step S3, the automatic schedule adjustment unit 12 executes the schedule adjustment by the logic described later.
Next, in step S4, the automatic schedule adjustment unit 12 notifies the user interface unit 11 of the result of the schedule adjustment executed in step S3.
Next, in step S5, the user interface unit 11 notifies the user AA of the result of the schedule adjustment notified from the automatic schedule adjustment unit 12 in step S4.

The result of the schedule adjustment notified to the user AA is found within the adjustment period (April 8, 2020 to April 10, 2020) specified by the user, as illustrated in FIG. 6 (B). The designated time zone (April 10, 2020, 15:00 to 16:00) is included as a candidate, and the time zone is output (displayed) on the screen shown in FIG. 6 (B).
Further, as illustrated in the lower part of FIG. 6B, when the overlapping schedule is changed to another time zone as a result of the schedule adjustment, the changed content is also shown in FIG. 6B. It is output on the screen shown.
In the example shown in FIG. 6B, "Meeting 3" will be held from "April 10, 2020 14:30 to 15:30" to "April 10, 2020 16:00 to 17:00". "Meeting 5" has been changed from "15:00 to 16:00 on April 10, 2020" to "14:00 to 15:00 on April 10, 2020", and "Meeting 1" has been changed. It will be set by holding "April 10, 2020 from 15:00 to 16:00".

In the example shown in FIG. 5, the user AA is notified in step S5 and grants the result of the schedule adjustment output on the screen shown in FIG. 6B, and in step S6, the user AA is the user terminal (for example, the user). Enter that the schedule adjustment result is permitted via the terminal UT1 (see FIG. 2).
Next, in step S7, the user interface unit 11 accepts that the schedule adjustment result input in step S6 is permitted, and transmits to the automatic schedule adjustment unit 12 that the user AA permits the schedule adjustment result.
Next, in step S8, the scheduler basic function unit 13 sets a schedule for which the schedule adjustment result is permitted. Further, the scheduler basic function unit 13 transmits the contents of the set schedule to the automatic schedule adjustment unit 12.
Next, in step S9, the automatic schedule adjustment unit 12 notifies the related users AA and BB of the contents of the schedule set in step S8. The related users are users included in the newly adjusted schedule and the schedule whose holding time has been changed, and are user AA and user BB in the example shown in FIG. 6 (B).
Although FIG. 6 shows an example of a screen for automatic schedule adjustment according to the present invention, the present system may have an interface for schedule adjustment as a general scheduler.

FIG. 7 is a flowchart for explaining an example of the processing executed by the automatic schedule adjustment unit 12 of the automatic schedule adjustment system 1 of the first embodiment.
In the example shown in FIG. 7, in a step (not shown), the attribute assigning unit 12A indicates whether or not the schedule holding time may be changed for each of the schedules of a plurality of users (“variation” or “variation””. "Fixed") is added, and the basic matrix creation unit 12B creates the basic matrix.

FIG. 8 is a diagram showing an example of a basic matrix created by the basic matrix creation unit 12B. In detail, FIG. 8A shows an example of a basic matrix created by the basic matrix creation unit 12B, and FIG. 8B shows an example of a search matrix created by the search matrix creation unit 12C. There is.
As shown in FIG. 8A, the elementary matrix corresponds to a plurality of time zones (time zones of "9:00 to 9:30", ..., Time zones of "17:00 to 17:30"). It is composed of a plurality of rows and a plurality of columns corresponding to a plurality of users (user A, user B, user C, and user D).
In the example shown in FIG. 8A, the attribute "variation" is given to the schedule of the time zone of "11:00 to 11:30" of the user A, and the time of "11:30 to 12:30" of the user A. The attribute "fixed" is given to the schedule of the band, the attribute "fixed" is given to the schedule of the time zone of "13:00 to 15:30" of user A, and "15:30 to 16:30" of user A. The attribute "variation" is given to the schedule of the time zone of.
In addition, the attribute "fixed" is given to the schedule of the time zone of "9:00 to 10:00" of the user B, and the attribute "variation" is given to the schedule of the time zone of "11:00 to 11:30" of the user B. Is given, the attribute "fixed" is given to the schedule of the time zone of "11:30 to 12:30" of the user B, and the attribute "fixed" is given to the schedule of the time zone of "16:30 to 17:30" of the user B. "Fixed" is given.
Further, the attribute "fixed" is given to the schedule of the time zone of "11:00 to 11:00" of the user C, and the attribute "variation" is given to the schedule of the time zone of "11:00 to 11:30" of the user C. Is given, the attribute "fixed" is given to the schedule of the time zone of "11:30 to 12:30" of the user C, and the attribute "fixed" is given to the schedule of the time zone of "13:30 to 14:30" of the user C. "Variation" is given, and the attribute "fixed" is given to the schedule of the time zone of "16:30 to 17:30" of the user C.
Further, the attribute "fixed" is given to the schedule of the time zone of "11:30 to 12:30" of the user D, and the attribute "variation" is given to the schedule of the time zone of "13:30 to 14:30" of the user D. Is given.

In the example shown in FIG. 7, in step S11, the search matrix creation unit 12C creates a search matrix (see FIG. 8B) representing a planned search range of a plurality of users.

In the example shown in FIG. 8B, the planned search range corresponds to the time zone of "9:00 to 18:00". Specifically, the search range is given the attribute "fixed" indicating that the holding time cannot be changed from the period specified in advance (the time zone of "9:00 to 18:00" in FIG. 8 (B)). It is the one excluding the scheduled time zone of the user A to the user E (that is, the range in which a "new schedule" of 1 hour can be set).
In the example shown in FIG. 8B, the search matrix is created by adding the schedule of the user E to the elementary matrix shown in FIG. 8A. The attribute "fixed" is given to the schedule of the time zone of "11:30 to 12:30" of the user E, and the attribute "fixed" is given to the schedule of the time zone of "12:30 to 13:30" of the user E. Then, the attribute "variation" is given to the schedule of the user E in the time zone of "15:30 to 16:30".

In FIGS. 8A and 8B, the matrix elements (frames) are referred to as time slots. Further, the time unit in the vertical direction (30 minutes in the figure) is a value set in advance, and any unit time such as every 30 minutes or every hour can be specified.
Determine the vertical search range from the start and end points of the search. In the figure, the daily work body for one day is the length in the vertical direction, but if the search range is multiple days, the length in the vertical direction may be increased by a multiple of the number of days.
Determine the horizontal search range from the conference participants.
Read the schedule information preset in each time slot and assign the attribute value to each time slot (the basic matrix in the figure is created).
Of the schedules of the participants (users A to D) of the basic matrix, other members (user E) who participate in the schedule whose attribute is "variable" (the schedule in the time zone of "15:30 to 16:30"). ) Is included in the search matrix. In the example shown in FIG. 8, since it is assumed that the schedule of the user A in the time zone of "15:30 to 16:30" is scheduled to participate with another member named user E, the user E is set. Included in the search matrix.

In the examples shown in FIGS. 8 (A) and 8 (B), the correction for the search matrix is performed by the correction unit 12C1. For example, when the time zone of "11:30 to 12:30" is set as a lunch break, the same time is regarded as a fixed attribute schedule and is excluded from the search range. Further, the search may be made more efficient by deleting the empty time slot less than the scheduled time newly set in advance. For example, for an empty time slot in the time zone of "12:30 to 13:00" shown in FIG. 8 (A), the requested 1-hour "new schedule" cannot be set, so that the meeting has a fixed attribute in advance. You may perform processing such as assuming that.

In the example shown in FIG. 7, in step S12, the free time search unit 12D searches for free time for setting a “new schedule”. Specifically, the free time search unit 12D vacates the schedule of the input members (user A, user B, user C, user D in the example shown in FIG. 7) with respect to the search matrix (see FIG. 8 (B)). Search from time. The free time is only for the specified time (1 hour in the example), and only the time zone in which the time of all the input members is free is searched, and for example, the method of Patent Document 1 or the like may be used.
If there is no free time, the process proceeds to step S13. On the other hand, if there is free time, the process skips to step S14.
In step S13, the free time search unit 12D searches for free time while the schedule moving unit 12D1 moves the schedule to which the attribute of "variation" is given. That is, the schedule is adjusted while moving the schedule to which the attribute of "variation" is given, and the process proceeds to step S14.
In step S14, the output unit 12E outputs a scheduled adjustment result or the like. If the schedule can be adjusted, the schedule adjustment result is output, and if the schedule cannot be adjusted, the fact that the schedule cannot be adjusted is output.

FIG. 9 is a flowchart for explaining a specific example of the process executed in step S13 of FIG. 7 by the automatic schedule adjustment unit 12 of the automatic schedule adjustment system 1 of the first embodiment.
In the example shown in FIG. 9, the schedule of the variable attribute that has already been set is changed to another date and time. The range of the date and time to be changed at this time may be the same as the period for newly adjusting the schedule, or may be independent. That is, the automatic schedule adjustment system 1 has information on the period for moving the schedule of the variable attribute independently of the period for performing the schedule adjustment.
In the example shown in FIG. 9, in step S21, for example, the free time search unit 12D searches from the upper side (upper side of FIG. 8B) of the search matrix (see FIG. 8B) and hits first. The schedule X of the "variation" attribute is selected. In the example shown in FIG. 8B, for example, the free time search unit 12D performs "variation" in the time zone of "11:00 to 11:30" of users A to C. Select the attribute appointment X.
Next, in step S22, for example, the free time search unit 12D creates a "temporary search matrix" in which the schedule X is moved to another time zone. In the example shown in FIG. 8B, for example, the free time search unit 12D sets the schedule X of the “variation” attribute of the time zone of “11:00 to 11:30” of users A to C to, for example, “12:30”. Create a "temporary search matrix" that has moved to the time zone of "~ 13:00".
Specifically, in step S22, the attribute "variation" indicating that the schedule moving unit 12D1 may change the holding time among the schedules of the plurality of users included in the search matrix is assigned by the attribute assigning unit 12A. Move one appointment to another time zone.
Next, in step S23, for example, the free time search unit 12D confirms whether or not the "new schedule" to be set can be adjusted on the "temporary search matrix". If the "new schedule" cannot be adjusted, the process proceeds to step S24, and if the "new schedule" can be adjusted, the process proceeds to step S25.
In the example shown in FIG. 8B, the schedule X of the "variation" attribute in the time zone of "11:00 to 11:30" of users A to C is changed to the time zone of "12:30 to 13:00". Even if the user moves, the one-hour "new schedule" cannot be set in the time zone of "10:30 to 11:30", so the process proceeds to step S24.

In step S24, for example, the free time search unit 12D selects the schedule X of the next “variation” attribute. If there is a schedule X with the next "variable" attribute, the process returns to step S22, and if there is no schedule X with the next "variable" attribute, the process proceeds to step S26.
In the example shown in FIG. 8B, for example, the free time search unit 12D sets the schedule X of the “variation” attribute in the time zone of “13:30 to 14:00” of users C to D to the next “variation”. "Select as the appointment X of the attribute.

In step S25, for example, the automatic schedule adjustment unit 12 determines the schedule X to be moved to secure the free time and the "new schedule" set in the free time, and ends the routine shown in FIG.
In step S26, for example, the output unit 12E outputs non-adjustable and ends the routine shown in FIG.
That is, in the example shown in FIG. 9, the free time is searched while adjusting the schedule of one "variation" attribute. The reason for allowing only one scheduled move is to reduce the calculation time.

<Second Embodiment>
Hereinafter, a second embodiment of the automatic schedule adjustment system, the automatic schedule adjustment method, and the program of the present invention will be described.
The automatic schedule adjustment system 1 of the second embodiment is configured in the same manner as the automatic schedule adjustment system 1 of the first embodiment described above, except for the points described later. Therefore, according to the automatic schedule adjustment system 1 of the second embodiment, the same effect as that of the automatic schedule adjustment system 1 of the first embodiment described above can be obtained except for the points described later.

FIG. 10 is a flowchart for explaining a specific example of the process executed in step S13 of FIG. 7 by the automatic schedule adjustment unit 12 of the automatic schedule adjustment system 1 of the second embodiment.
In the example shown in FIG. 10, in step S31, for example, the free time search unit 12D searches from the upper side (upper side of FIG. 8B) of the search matrix (see FIG. 8B) and hits first. In the example shown in FIG. 8B, for example, the free time search unit 12D selects the schedule X of the “variation” attribute. Select the attribute appointment X.
Next, in step S32, for example, the free time search unit 12D creates a "temporary search matrix" in which the schedule X is moved to another time zone. In the example shown in FIG. 8B, for example, the free time search unit 12D sets the schedule X of the “variation” attribute of the time zone of “11:00 to 11:30” of users A to C to, for example, “12:30”. Create a "temporary search matrix" that has moved to the time zone of "~ 13:00".
Next, in step S33, for example, the free time search unit 12D confirms whether or not the "new schedule" to be set can be adjusted on the "temporary search matrix". If the "new schedule" cannot be adjusted, the process proceeds to step S34, and if the "new schedule" can be adjusted, the process proceeds to step S36.
In the example shown in FIG. 8B, the schedule X of the "variation" attribute in the time zone of "11:00 to 11:30" of users A to C is changed to the time zone of "12:30 to 13:00". Even if the user moves, the one-hour "new schedule" cannot be set in the time zone of "10:30 to 11:30", so the process proceeds to step S34.

In step S34, for example, the free time search unit 12D stores the depth (“depth” is the number of scheduled Xs of the “variation” attribute to be moved by the scheduled moving unit 12D1), and the depth is within the threshold value. For example, the schedule X is temporarily placed as a fixed conference, and the process returns to step S31 to continue the process (that is, the number of schedule Xs of the "variable" attribute moved by the schedule movement unit 12D1 is increased by one). If the depth exceeds the threshold value, the process proceeds to step S35.

In step S35, for example, the free time search unit 12D selects the schedule X of the next “variation” attribute. If there is a schedule X with the next "variable" attribute, the process returns to step S32, and if there is no schedule X with the next "variable" attribute, the process proceeds to step S37.
In the example shown in FIG. 8B, for example, the free time search unit 12D sets the schedule X of the “variation” attribute in the time zone of “13:30 to 14:00” of users C to D to the next “variation”. "Select as the appointment X of the attribute.

In step S36, for example, the automatic schedule adjustment unit 12 determines the schedule X to be moved to secure the free time and the "new schedule" set in the free time, and ends the routine shown in FIG.
In step S37, for example, the output unit 12E outputs non-adjustable and ends the routine shown in FIG.

In the example shown in FIG. 1, when step S31 is executed for the first time, for example, the free time search unit 12D sets the schedule 3 of the "variation" attribute of Mr. B's "14:00 to 15:00" time zone. When the step S32 is executed for the first time, for example, the free time search unit 12D sets the schedule 3 of the "variation" attribute of Mr. B's "14:00 to 15:00" time zone to "13:00". Create a "temporary search matrix" that has moved to the time zone of "~ 14:00".
When step S34 is executed for the first time, the free time search unit 12D stores the depth "1", and since the depth is, for example, within the threshold value "2", Mr. B's schedule 3 is provisionally set as a fixed meeting. Place and continue processing by returning to step S31 (that is, increasing the number of schedules of the "variable" attribute to be moved by the schedule movement unit 12D1 by one).
When step S31 is executed for the second time, for example, the free time search unit 12D selects the schedule 6 of the "variation" attribute of Mr. C's "14:00 to 16:00" time zone, and steps for the second time. When S32 is executed, for example, the free time search unit 12D sets the schedule 6 of the "variation" attribute in the time zone of Mr. C's "14:00 to 16:00" to the time of "15:00 to 17:00". Create a "temporary search matrix" that has moved to the band.
In step S36, for example, the automatic schedule adjustment unit 12 is set to the schedule 3 and the schedule 6 to be moved to secure the free time, and the free time (time zone of "14:00 to 15:00"). "New schedule" is confirmed, and the routine shown in FIG. 10 is terminated.

That is, in the example shown in FIG. 10, the free time is searched while adjusting the schedules of a plurality of "variable" attributes. Step S34 is an addition to FIG. 9, first storing the current search depth. For example, the depth when step S34 is first performed is 1. Subsequently, the schedule of the "variable" attribute that was currently moved is temporarily regarded as the schedule of the fixed attribute, and step SS31 is called, that is, the depth-first search is performed by the recursive call, so that the multiple "variable" attributes are selected. Allows you to move appointments and explore free time. The depth is stored in order to stop the process by searching to a certain depth, and when the depth exceeds a preset threshold value, the recursive call is not performed and the process proceeds to step S37.
In the method shown in FIG. 10, it is possible to search for all variations of the schedule adjustment by sufficiently increasing the threshold value, but in that case, the calculation time becomes very long, so that a depth threshold value is realistically set. Is desired.

That is, in the example shown in FIG. 10, the schedule moving unit 12D1 has an attribute indicating that the holding time of the schedules of a plurality of users included in the search matrix may be changed in the first step S32. The first schedule (“Schedule 3 (14:00 to 15:00)” in FIG. 1) to which “variation” is assigned by the attribute assigning unit 12A is set to another time zone (13:00 to 14: in FIG. 1). Move to 00).
By moving the first schedule (“Schedule 3 (14:00 to 15:00)” in Fig. 1) to another time zone (13:00 to 14:00 in Fig. 1), the free time (free time (13:00 to 14:00)) Since it is determined in step S33 that (14:00 to 15:00) in FIG. 1 cannot be secured, the schedule moving unit 12D1 changes the holding time among the schedules of the plurality of users included in the search matrix. The attribute "variation" indicating goodness is scheduled to be assigned by the attribute assigning unit 12A, and is scheduled to be moved to another time zone (15:00 to 17:00 in FIG. 1) (“Schedule 6” in FIG. 1). (14:00 to 16:00) "etc.)" is increased.

Further, in the example shown in FIG. 10, when it is determined in step S33 that the free time (14:00 to 15:00 in FIG. 1) cannot be secured, the scheduled moving unit 12D1 is scheduled to be moved (for example, FIG. 1). Increase the number ("depth") of "Schedule 3 (14:00 to 15:00)", "Schedule 6 (14:00 to 16:00)", etc.) until the preset threshold is reached. Let me.
Further, in the example shown in FIG. 10, the number of schedules to be moved (for example, “Schedule 3 (14:00 to 15:00)”, “Schedule 6 (14:00 to 16:00)” in FIG. 1) ( Step S35 when the free time (14:00 to 15:00 in FIG. 1) cannot be secured even if the “depth”) reaches the threshold value, that is, when it is determined in step S34 that “the threshold value is reached”. In, the schedule moving unit 12D1 is a different schedule (“13:00 to 14:00, 15:00 to 17:00 in FIG. 1) as the first schedule to be moved to another time zone (“13:00 to 14:00, 15:00 to 17:00 in FIG. 1). Select a schedule that is different from Schedule 3).

<Third Embodiment>
Hereinafter, a third embodiment of the automatic schedule adjustment system, the automatic schedule adjustment method, and the program of the present invention will be described.
The automatic schedule adjustment system 1 of the third embodiment is configured in the same manner as the automatic schedule adjustment system 1 of the first embodiment described above, except for the points described later. Therefore, according to the automatic schedule adjustment system 1 of the third embodiment, the same effect as that of the automatic schedule adjustment system 1 of the first embodiment described above can be obtained except for the points described later.

FIG. 11 is a flowchart for explaining a specific example of the process executed in step S13 of FIG. 7 by the automatic schedule adjustment unit 12 of the automatic schedule adjustment system 1 of the third embodiment.
In the example shown in FIG. 11, in step S41, for example, the free / busy search unit 12D sorts the schedules of the “variable” attribute existing in the search matrix, and selects one sorted schedule of the “variable” attribute.
That is, in the example shown in FIG. 11, the schedule of the "variation" attribute is not selected in chronological order as in the examples shown in FIGS. 9 and 10, but is selected based on a certain criterion as shown in FIG. ..

FIG. 12 is a diagram for explaining each example of the criteria for selecting the schedule of the “variation” attribute. In detail, FIG. 12A shows an example in which the horizontal direction of the search matrix is considered as a reference, and FIG. 12B shows an example in which the vertical direction of the search matrix is considered as a reference.
In the example shown in FIG. 12 (A), the schedule of the member who wants to newly adjust the schedule has a lot of vacant spaces (time slots without schedules) ("vacant" in FIG. 12 (A). In step S31 of FIG. 11, the appointments are sorted so that the appointments of the "variation" attribute existing in the region ") are preferentially selected.
In the example shown in FIG. 12 (B), when the schedule is viewed in the vertical (time) direction, the members having the most free time (Mr. A” and “Mr. A” constituting the “free group” in FIG. 12 (B). In step S31 of FIG. 11, the schedules are sorted so that the schedules of the "variable" attribute in which "Mr. B") participates are preferentially selected.

In the example shown in FIG. 11, in step S42, for example, the free time search unit 12D creates a "temporary search matrix" in which the schedule X selected in step S41 is moved to another time zone.
Next, in step S43, for example, the free time search unit 12D confirms whether or not the "new schedule" to be set can be adjusted on the "temporary search matrix". If the "new schedule" cannot be adjusted, the process proceeds to step S44, and if the "new schedule" can be adjusted, the process proceeds to step S45.

In step S44, for example, the free time search unit 12D selects the schedule X of the next "variation" attribute. If there is a schedule X with the next "variable" attribute, the process returns to step S42, and if there is no schedule X with the next "variable" attribute, the process proceeds to step S46.
In step S45, for example, the automatic schedule adjustment unit 12 determines the schedule X to be moved to secure the free time and the "new schedule" set in the free time, and ends the routine shown in FIG.
In step S46, for example, the output unit 12E outputs non-adjustable and ends the routine shown in FIG.

In the example shown in FIGS. 11 and 12 (A) or 12 (B), the schedule of the selected "variable" attribute is a schedule that is easy to move, so by trying from the movement of these schedules, the schedule can be adjusted. It is expected to reduce the time required.
In the example shown in FIG. 11, either the sort shown in FIG. 12 (A) or the sort shown in FIG. 12 (B) is executed in step S41 of FIG. In another example, for example, the sort shown in FIG. 12 (A) is executed, and then the priority is set according to the criteria shown in FIG. 12 (B). The idea shown in FIG. 12 (A) and FIG. 12 ( It may be used in combination with the idea shown in B).
In the example shown in FIG. 11, improvements to improve the efficiency of the example shown in FIG. 9 are included, but in other examples, in order to improve the efficiency of the example shown in FIG. 10, the same improvements as those shown in FIG. 11 are included. May be included.

As described above, in the example shown in FIGS. 11 and 12 (A), in step S41 of FIG. 11, the scheduled moving unit 12D1 is moved to another time zone (13:00 to 14:00 in FIG. 1). As one schedule (“Schedule 3 (14:00 to 15:00)” in FIG. 1), a plurality of time zones (FIG. 12 (A)) constituting the search range of the search matrix shown in FIG. 12 (A). Of the 7 rows), the time zone with the least number of appointments included in one time zone (the first row from the top of FIG. 12 (A) or the fourth row from the top of FIG. 12 (A)). ) Select the schedule included in.
In the example shown in FIGS. 11 and 12 (A), in step S41 of FIG. 11, the schedule moving unit 12D1 is moved to another time zone (13:00 to 14:00 in FIG. 1). As “Schedule 3 (14:00 to 15:00)” in FIG. 1, among a plurality of users (Mr. A to Mr. E in FIG. 12 (B)) constituting the search matrix shown in FIG. 12 (B). Select the schedule held by the user having the smallest number of schedules included in one user (Mr. A in FIG. 12B or Mr. B in FIG. 12B).

<Fourth Embodiment>
Hereinafter, a fourth embodiment of the automatic schedule adjustment system, the automatic schedule adjustment method, and the program of the present invention will be described.
The automatic schedule adjustment system 1 of the fourth embodiment is configured in the same manner as the automatic schedule adjustment system 1 of the third embodiment described above, except for the points described later. Therefore, according to the automatic schedule adjustment system 1 of the fourth embodiment, the same effect as that of the automatic schedule adjustment system 1 of the third embodiment described above can be obtained except for the points described later.

FIG. 13 is a flowchart for explaining a specific example of the process executed in step S13 of FIG. 7 by the automatic schedule adjustment unit 12 of the automatic schedule adjustment system 1 of the fourth embodiment.
In the example shown in FIG. 13, in step S51, for example, the free / busy search unit 12D sorts the schedules of the “variable” attributes existing in the search matrix, and the sorted “variable” attributes are sorted, as in step S41 of FIG. Select one of the appointments.
Next, in step S52, for example, the free time search unit 12D creates a "temporary search matrix" in which the schedule X selected in step S51 is moved to another time zone.
Next, in step S53, for example, the free time search unit 12D confirms whether or not the "new schedule" to be set can be adjusted on the "temporary search matrix". If the "new schedule" cannot be adjusted, the process proceeds to step S54, and if the "new schedule" can be adjusted, the process proceeds to step S56.

In step S54, for example, the free time search unit 12D selects the schedule X of the next “variation” attribute. If there is a schedule X with the next "variable" attribute, the process returns to step S52, and if there is no schedule X with the next "variable" attribute, the process proceeds to step S55.

In step S55, for example, the free time search unit 12D selects N appointments of the already set "variation" attribute (N is a preset parameter) and randomly reassigns them to another time zone. If the number of trials of this random process is within the upper limit, the process returns to step S51. On the other hand, if the number of trials of this random processing exceeds the upper limit value, the process proceeds to step S57.
The process in step S55 is a process for realizing the neighborhood search in the combinatorial optimization theory, and it is not possible to calculate the exact optimum solution when the full search is performed as in the example shown in FIG. 10, but FIG. 9 It is used when it is desired to obtain a better approximate solution than the solution obtained by the deterministic algorithm performed in the example shown in FIG. 11 or the example shown in FIG. Random reassignment should be designed so that it is in the vicinity of the current allocation (with a slight change) in principle. Depending on the design of random reallocation, it is possible to incorporate the idea of simulated annealing and genetic algorithms.

In step S56, for example, the automatic schedule adjustment unit 12 determines the schedule X to be moved to secure the free time and the "new schedule" set in the free time, and ends the routine shown in FIG.
In step S57, for example, the output unit 12E outputs non-adjustable and ends the routine shown in FIG.

That is, in the example shown in FIG. 13, a higher schedule adjustment is performed. Specifically, which schedule is to be moved to another time zone (13:00 to 14:00 in FIG. 1) (for example, "Schedule 3 (14:00 to 15:00)" in FIG. 1). When the free time (14:00 to 15:00 in FIG. 1) cannot be secured even if is selected (that is, when it is determined in step S54 that "the next variable attribute is not scheduled"), the scheduled moving unit 12D1 In step S55, N (N is a preset number) schedules to which the attribute "variation" indicating that the holding time may be changed is given by the attribute giving unit 12A is randomly selected and different. Move to the time zone.
For example, the schedule moving unit 12D1 moves "Schedule 2" in FIG. 1 to "14:00 to 16:00", moves "Schedule 3" to "13:00 to 14:00", and "Schedule 4". Is moved to "14:00 to 15:00" and "Schedule 5" is moved to "15:00 to 16:00" to secure the free time "16:00 to 17:00".

As described above, in the automatic schedule adjustment system 1 of the first to fourth embodiments, when the schedule to be performed by a plurality of people is adjusted by using the scheduler, the free time is automatically searched or the existing schedule is automatically rewritten. It is possible to automate the schedule adjustment (setting) of the schedule in order to schedule and secure free time.
Further, in the automatic schedule adjustment system 1 of the first to fourth embodiments, new attributes such as "fixed" and "variable" are given to each schedule, and the schedule of the "variable" attribute is assigned by the automatic schedule adjustment system 1. Rescheduled and notified to interested parties. That is, it is not necessary for people to adjust the schedule by using different means.
Further, the automatic schedule adjustment system 1 of the first to fourth embodiments provides a specific logic (algorithm) for appropriately reschedule an existing schedule and discover free time, and is particularly novel in that respect. There is sex.

As described above, in the automatic schedule adjustment system 1 of the first to fourth embodiments, schedule adjustment (setting) of a schedule such as work / meeting by a plurality of people is automated.
In the past, when the participating members included busy people, there was no free time for everyone to participate, and wasteful work was generated by adjusting the schedule by other means such as e-mail. rice field.
On the other hand, according to the automatic schedule adjustment system 1 of the first to fourth embodiments, it is possible to automatically reschedule an existing schedule, so that the work associated with the schedule adjustment becomes unnecessary and the productivity is improved. Expected to improve.

Although the embodiments for carrying out the present invention have been described above using the embodiments, the present invention is not limited to these embodiments, and various modifications and substitutions are made without departing from the gist of the present invention. Can be added. The configurations described in each of the above-described embodiments and examples may be combined.

In addition, all or a part of the functions of each part of the automatic schedule adjustment system 1 in the above-described embodiment are recorded on a computer-readable recording medium and recorded on the recording medium. It may be realized by loading the program into a computer system and executing it. The term "computer system" as used herein includes hardware such as an OS and peripheral devices.
Further, the "computer-readable recording medium" refers to a portable medium such as a flexible disk, a magneto-optical disk, a ROM, or a CD-ROM, or a storage unit such as a hard disk built in a computer system. Further, a "computer-readable recording medium" is a communication line for transmitting a program via a network such as the Internet or a communication line such as a telephone line, and dynamically holds the program for a short period of time. It may also include a program that holds a program for a certain period of time, such as a volatile memory inside a computer system that is a server or a client in that case. Further, the above-mentioned program may be for realizing a part of the above-mentioned functions, and may be further realized for realizing the above-mentioned functions in combination with a program already recorded in the computer system.

1 ... Automatic schedule adjustment system, 11 ... User interface unit, 12 ... Automatic schedule adjustment unit, 12A ... Attribute assignment unit, 12B ... Basic matrix creation unit, 12C ... Search matrix creation unit, 12C1 ... Correction unit, 12D ... Free time search Unit, 12D1 ... Scheduled movement unit, 12E ... Output unit, 13 ... Scheduler basic function unit, 14 ... Scheduled database, 15 ... User database, 16 ... Location database, UT1, UT2, UT3 ... User terminal

Claims (13)

An automatic schedule adjustment system that adjusts the schedules of multiple users.
An attribute assigning unit that assigns an attribute indicating whether or not the scheduled holding time may be changed to each of the schedules of the plurality of users.
When adjusting a new schedule, the attribute assigning unit indicates that the holding time may be changed when the free time that all the plurality of users can participate in does not exist within the predetermined period. By moving the schedule given by the above to another time zone, the scheduled movement unit that secures the free time and
It is provided with a search matrix creation unit that creates a search matrix representing the planned search range of the plurality of users.
The search range excludes the scheduled time zone of the plurality of users to which the attribute indicating that the holding time cannot be changed is given from the predetermined period .
The scheduled moving unit secures the free time by using the search matrix created by the search matrix creating unit.
Automatic schedule adjustment system. The attribute indicating that the holding time may be changed or the attribute indicating that the holding time cannot be changed includes a schedule database that stores information about each of the schedules of the plurality of users given by the attribute assigning unit. ,
The automatic schedule adjustment system according to claim 1. It is provided with a user interface unit that accepts the input of schedules of the plurality of users.
The user interface unit is
Each of the schedules of the plurality of users accepts information indicating whether the holding time may be changed or the holding time cannot be changed.
The automatic schedule adjustment system according to claim 1. A correction unit for correcting the search matrix created by the search matrix creation unit is provided.
The correction unit excludes at least the lunch break time zone of the plurality of users from the search range.
The automatic schedule adjustment system according to claim 1. Among the schedules of the plurality of users included in the search matrix, the schedule moving unit assigns one schedule having an attribute indicating that the holding time may be changed by the attribute assigning unit to the other time. Move to the belt,
The automatic schedule adjustment system according to claim 1. The schedule moving unit is different from the first schedule in which the attribute indicating that the holding time may be changed among the schedules of the plurality of users included in the search matrix is given by the attribute assigning unit. Move to the time zone of
When the free time cannot be secured by moving the first schedule to the other time zone,
The schedule moving unit is a schedule to which an attribute indicating that the holding time may be changed among the schedules of the plurality of users included in the search matrix is assigned by the attribute assigning unit, and is another of the schedules. Increase the number of appointments that will be moved during the time period,
The automatic schedule adjustment system according to claim 1. If the free time cannot be secured,
The planned moving part is
Increase the number of appointments to be moved until a preset threshold is reached,
The automatic schedule adjustment system according to claim 6. When the free time cannot be secured even if the number to be moved reaches the threshold value.
The planned moving part is
Select a different appointment as the first appointment to be moved to the different time zone.
The automatic schedule adjustment system according to claim 7. The planned moving part is
As the one appointment to be moved to the other time zone,
Of the plurality of time zones constituting the search range of the search matrix, the schedule included in the time zone having the smallest number of schedules included in one time zone is selected.
The automatic schedule adjustment system according to claim 5. The planned moving part is
As the one appointment to be moved to the other time zone,
Among the plurality of users constituting the search matrix, the schedule held by the user having the smallest number of schedules included in one user is selected.
The automatic schedule adjustment system according to claim 5. When the free time cannot be secured no matter which schedule is selected as the one schedule to be moved to the different time zone.
The planned moving part is
N (N is a preset number) schedules with attributes indicating that the holding time may be changed are randomly selected and moved to different time zones.
The automatic schedule adjustment system according to claim 5. The automatic schedule adjustment system is an automatic schedule adjustment method that adjusts the schedules of multiple users.
An attribute assignment step in which the automatic schedule adjustment system assigns an attribute indicating whether or not the schedule holding time may be changed to each of the schedules of the plurality of users.
When the automatic schedule adjustment system adjusts a new schedule, the holding time may be changed if the free time that all the plurality of users can participate in does not exist within the predetermined period. A scheduled movement step that secures the free time by moving the schedule to which the indicated attribute is assigned in the attribute assignment step to another time zone, and
The automatic schedule adjustment system includes a search matrix creation step for creating a search matrix representing the search range of the schedules of the plurality of users.
The search range excludes the scheduled time zone of the plurality of users to which the attribute indicating that the holding time cannot be changed is given from the predetermined period .
In the scheduled movement step, the free time is secured by using the search matrix created in the search matrix creation step.
Automatic schedule adjustment method. On the computer that configures the automatic schedule adjustment system ,
For each of the schedules of multiple users, an attribute assignment step that assigns an attribute indicating whether or not the schedule holding time can be changed, and an attribute assignment step.
When adjusting a new schedule, if the free time that all of the plurality of users can participate in does not exist within the predetermined period, the attribute indicating that the holding time may be changed is the attribute assignment step. By moving the schedule given in the above to another time zone, the schedule movement step for securing the free time and the schedule movement step
It is a program for executing the search matrix creation step for creating a search matrix representing the planned search range of a plurality of users.
The search range excludes the scheduled time zone of the plurality of users to which the attribute indicating that the holding time cannot be changed is given from the predetermined period .
In the scheduled movement step, the free time is secured by using the search matrix created in the search matrix creation step.
program.

Images