Reservation management apparatus, method, and system, computer program product, and computer readable storage medium

Abstract

Provided are a reservation management device, a reservation management method, a reservation management system, a computer program product, and a computer-readable storage medium, with which it is possible to reduce the number of times of rebooking a schedule and to efficiently adjust the schedule without consuming time. A reservation management device is provided with: a reservation frame setting unit (11) in which a plurality of reservation frames prepared by a host are preset; a visitor characteristic information storage unit (12) in which characteristic information of a plurality of visitors who reserve the plurality of reservation frames is stored; a desired reservation frame reception unit (13) that receives desired reservation frames for a plurality of visitors; and an allocation unit (14) that allocates a reservation for each visitor to each of the plurality of reservation frames on the basis of the desired reservation frame for each visitor and the characteristic information for each visitor.

Description

Technical Field

[0001] The present invention relates to a reservation management device, method, program and system for allocating visitor reservations to reservation boxes prepared by a host. Background Art

[0002] In the past, when school teachers wanted to conduct interviews with guardians, they had to coordinate interview dates with all guardians. Typically, they would ask all guardians for their preferred dates and schedules, and the school would then schedule the interviews accordingly.

[0003] In this case, some guardians should have an interview earlier in the school's schedule, while others must spend more time in the final block. Therefore, the schedule must be adjusted to account for this. Furthermore, guardians who cannot have an interview on the desired date must be asked to reschedule, but this request and the subsequent schedule adjustments are very troublesome.

[0004] Patent Document 1 proposes an interview schedule adjustment device that can more easily adjust the interview schedules between a recruitment manager and a job applicant. Specifically, Patent Document 1 proposes an interview schedule adjustment device that determines multiple available interview dates and times based on the recruitment manager's schedule information.

[0005] Prior art literature

[0006] Patent Literature

[0007] Patent Document 1: Japanese Patent Application Laid-Open No. 2021-170151 Summary of the Invention

[0008] Problems to be solved by the invention

[0009] However, Patent Document 1 refers to the schedule of the recruitment manager (interviewer) but not the schedule of the job seeker (interviewee). Therefore, the interview day may not be a convenient day for the job seeker, and there is a problem of increasing the number of rescheduling times.

[0010] In view of the above circumstances, an object of the present invention is to provide a reservation management device, method, program, and system that can reduce the number of times a schedule is rescheduled and efficiently adjust a schedule without wasting time.

[0011] Solutions for solving problems

[0012] The reservation management device of the present invention comprises: a reservation frame setting unit in which a plurality of reservation frames prepared by a host are pre-set; a visitor characteristic information storage unit in which characteristic information of a plurality of visitors who make reservations for the plurality of reservation frames is stored; a desired reservation frame receiving unit in which the desired reservation frames of the plurality of visitors are received; and an allocation unit in which the reservation of each visitor is allocated to each of the plurality of reservation frames based on the desired reservation frame of each visitor and the characteristic information of each visitor.

[0013] Effects of the Invention

[0014] According to the reservation management device of the present invention, reservations for each visitor are allocated to a plurality of reservation blocks based on the desired reservation block and characteristic information of each visitor, thereby reducing the number of times schedules need to be rescheduled and enabling efficient schedule adjustments without wasting time. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 This is a block diagram showing a schematic configuration of a reservation management system using one embodiment of the reservation management device of the present invention.

[0016] Figure 2 This is a diagram showing an example of a preset reservation frame.

[0017] Figure 3 This is a diagram showing an example of a characteristic information table indicating characteristic information of each guardian.

[0018] Figure 4 This is a diagram showing an example of a reservation request frame for each guardian.

[0019] Figure 5 This is a diagram showing an example of a schedule in which reservations of respective guardians are allocated to a plurality of reservation blocks.

[0020] Figure 6 Is used to illustrate Figure 1 The following is a sequence diagram of the processing flow of the reservation management system.

[0021] Figure 7 This is a flowchart for explaining a method of allocating reservations so as to give priority to a guardian's desired reservation box.

[0022] Figure 8 This is a flowchart for explaining a method of uniformly allocating reservations of guardians who have designated arbitrary dates and times to all reservation frames.

[0023] Figure 9 This is a diagram showing an example of an interview adjustment screen.

[0024] Figure 10 Is used to illustrate Figure 8 The flowchart shown is a flowchart of subroutine A.

[0025] Figure 11 This is a diagram showing an example of a reservation frame and a guardian's second wish.

[0026] Figure 12 This is a diagram showing a state where the reservation request frames of the guardians with attendance numbers 22 to 25 are provisionally allocated.

[0027] Figure 13 This is a diagram showing the status of the reservation of the guardian to whom attendance number 21 is assigned.

[0028] Figure 14 This is a diagram showing a state where the reservation request frames of the guardians with attendance numbers 23 to 25 are provisionally allocated.

[0029] Figure 15 This is a diagram showing the status of the reservation of the guardian to whom the attendance number 22 is assigned.

[0030] Figure 16 This is a diagram showing a state of reservation request frames to which guardians with attendance numbers 24 and 25 are provisionally allocated.

[0031] Figure 17 This is a diagram showing the status of the reservation of the guardian to whom attendance number 23 is assigned.

[0032] Figure 18 This is a diagram showing a state of a reservation request frame to which a guardian with attendance number 25 is provisionally allocated.

[0033] Figure 19 This is a diagram showing the status of the reservation of the guardian to whom attendance number 24 is assigned.

[0034] Figure 20 This is a diagram showing a reservation request frame for the guardian with attendance number 25.

[0035] Figure 21 This is a diagram showing the status of the reservation of the guardian to whom attendance number 25 is assigned.

[0036] Figure 22 It shows Figure 10 FIG. 1 is a diagram of a modified example of subroutine A shown.

[0037] Figure 23 This is a flowchart for explaining a method of allocating reservations in such a way that a reservation wish box takes precedence over a guardian's priority.

[0038] Figure 24 1 is a diagram showing a flowchart in the case of executing subroutine A in the method of allocating reservations so as to give priority to the reservation wish box over the priority of the guardian. DETAILED DESCRIPTION

[0039] Hereinafter, a reservation management system using an embodiment of the reservation management device of the present invention will be described in detail with reference to the accompanying drawings. Figure 1 This is a block diagram showing a schematic configuration of the reservation management system 1 according to the present embodiment.

[0040] The reservation management system 1 of this embodiment is a system for reserving a schedule for a conversation between a teacher of a school and a guardian of a student attending the school, and comprises a reservation management device 10 and a terminal device 20 of the guardian. Figure 1 In FIG, only two guardian terminal devices 20 are shown, but in reality, a plurality of guardian terminal devices 20 are connected to one reservation management device 10 .

[0041] The reservation management device 10 and the terminal device 20 of the guardian are connected via a communication line such as an Internet line and are configured to be communicable.

[0042] The reservation management system 1 of this embodiment is a system that pre-stores guardian's characteristic information held by the school and, based on the guardian's characteristic information and the guardian's desired reservation frame, allocates each guardian's reservation to a plurality of pre-set reservation frames. Furthermore, in this embodiment, the school (teacher) is equivalent to the host of this invention, and the guardian is equivalent to the visitor of this invention.

[0043] Next, details of each device constituting the reservation management system 1 of this embodiment will be described.

[0044] The reservation management device 10 includes a reservation frame setting unit 11 , a visitor characteristic information storage unit 12 , a reservation request frame receiving unit 13 , and an allocating unit 14 .

[0045] A plurality of reservation boxes prepared by the school (teachers) are pre-set in the reservation box setting unit 11. For example, a reservation box is set and inputted in a terminal device (not shown) owned by the teacher, and the reservation box is set in the reservation box setting unit 11. Figure 2 : is a diagram showing an example of a reservation frame. Figure 2 In the example, three reservation blocks I to III are set on Monday, three reservation blocks IV to VI are set on Tuesday, and one reservation block VII is set on Thursday.

[0046] The visitor characteristic information storage unit 12 is used to store characteristic information of a plurality of guardians who have reserved a plurality of reservation blocks. Figure 3 1 is a diagram showing an example of a characteristic information table that associates a guardian ID with the characteristic information of the guardian. The guardian ID is identification information assigned to each guardian.

[0047] like Figure 3As shown, in this embodiment, as the characteristic information of the guardian, evaluation information of the guardian and the student, and reservation frame setting conditions set based on the evaluation information are stored.

[0048] The guardian's evaluation information includes, for example, information on the guardian's evaluation from the school (teachers), information on the guardian's interpersonal relationships, and information on the guardian's work status.

[0049] Examples of information on the guardian's evaluation from the school (teacher) include "interview takes time" and "slackness in time (high likelihood of being late for the interview)." Information on the guardian's interpersonal relationships includes information on guardians who prefer not to have adjacent reservation boxes.

[0050] The student evaluation information includes evaluation information such as the student's academic ability, information on whether the student has brothers in the same school, etc. If the student's academic ability is low, the "interview is time-consuming", and if there are brothers in the same school, it is preferred to schedule the brothers on the same day or have the reservation boxes next to each other.

[0051] The information on the guardian's work status includes information on the guardian's occupation, information on whether the guardian is a working parent, and the like.

[0052] In addition, Figure 3 In the evaluation information of the guardian and the student, information such as "interview time consumption" and information of guardians who are not adjacent to each other are set as the evaluation information of the guardian or the student, but other evaluation information may also be included.

[0053] The reservation frame setting condition is a reservation frame setting condition set based on the evaluation information of the guardian or the student as described above. In this embodiment, the required number of frames and the guardian IDs of non-adjacent guardians are stored as the reservation frame setting condition.

[0054] The number of required frames indicates the number of appointment frames required for a single interview. The number is normally "1" and increases based on the guardian's and student's evaluations. For example, if the guardian's evaluation indicates that the interview is time-consuming, or the student's evaluation indicates that there are academic issues, the interview will take time, so a multiple number of appointment frames will be set as the number of required frames.

[0055] Non-adjacent guardian IDs indicate guardian IDs of guardians who do not make reservation frames adjacent. Figure 3In the example of the characteristic information table shown, as the evaluation information of the guardian with guardian ID3, information such as "not adjacent to the guardian with guardian ID4" is stored, as the non-adjacent guardian ID of guardian ID3, guardian ID "4" is stored, and as the non-adjacent guardian ID of guardian ID4, guardian ID "3" is stored.

[0056] The reservation frame receiving unit 13 receives each guardian's reservation frame output from each guardian's terminal device 20. The guardian checks the reservation frames set in the reservation frame setting unit 11 on the terminal device 20, selects a desired reservation frame from the reservation frames, and outputs it to the reservation management device 10.

[0057] Figure 4 : is a diagram showing an example of a reservation request frame for guardians ID1 to ID5. Figure 4 In the example shown, the "ALL" option for guardian ID 1 means that any date and time in the reservation block is acceptable. Guardian ID 2 requests reservation blocks I, IV, and VII, indicating that they want the first reservation block of each schedule. Guardian ID 3 requests reservation blocks III and VI, indicating that they want the last reservation block of each schedule. Guardian ID 4 requests reservation blocks IV, V, and VI, indicating that they want a reservation block for Wednesday. Guardian ID 5 requests reservation blocks other than reservation block VII, indicating that they want a day of the week other than Thursday.

[0058] The allocating unit 14 allocates the reservations of each guardian to a plurality of reservation blocks based on the characteristic information of each guardian and the reservation blocks desired by each guardian, thereby completing the final reservation schedule.

[0059] Here, the reference Figure 3 The characteristic information table shown and Figure 4 The guardian's desired reservation box is shown to target Figure 2 The method of determining the reservation box of each guardian is explained in the reservation box shown. Figure 5 This is a diagram showing an example of a completed reservation schedule.

[0060] The allocation unit 14 first determines the reservation block for the guardian whose "interview takes time". Figure 3 In the example of the characteristic information table shown, the characteristic information of the guardian with guardian ID 5 is "interview time", and the number of required frames is "2". Figure 4The guardian ID5's desired reservation frame is a reservation frame other than reservation frame VII. Therefore, the allocation unit 14 determines the "last" reservation frame that has no time constraints for the interview based on the guardian ID5's characteristic information, and further determines the last reservation frames III and VI for Monday and Wednesday based on the desired reservation frame. Then, the allocation unit 14 determines reservation frame III or reservation frame VI as the reservation frame for the guardian ID5, but Figure 5 In the example shown, the reservation frame VI is determined.

[0061] Next, the allocation unit 14 determines the reservation frame of the guardian who wishes to start the reservation frame. Figure 4 In the desired reservation frame shown, the guardian of guardian ID 2 wishes to start with the reservation frame, so the allocation unit 14 determines reservation frames I, IV, and VII as the reservation frame for the guardian of guardian ID 2. Then, the allocation unit 14 determines any one of reservation frames I, IV, and VII as the reservation frame for the guardian of guardian ID 2, but Figure 5 In the example shown, reservation frame I is determined.

[0062] Next, the allocation unit 14 determines the reservation blocks for non-adjacent guardians. Figure 3 In the example of the characteristic information table shown, "non-adjacent guardians" are set for the guardian with guardian ID 3 and the guardian with guardian ID 4. Figure 4 The guardian of guardian ID3 shown here wants to reserve the last reservation blocks III and VI, but reservation block VI has already been determined as the reservation block for guardian ID5.

[0063] Therefore, the allocation unit 14 first determines reservation frame III as the reservation frame for guardian ID 3. Then, the allocation unit 14 determines the reservation frame that is not adjacent to reservation frame III as the reservation frame for guardian ID 4. Guardian ID 4's desired reservation frame is reservation frame IV, V, or VI for Wednesday. Since reservation frame VI has already been determined as the reservation frame for guardian ID 5, the allocation unit 14 determines reservation frame IV or reservation frame V as the reservation frame for guardian ID 4. Figure 5 In the example shown, the reservation frame V is determined.

[0064] Then, the allocation unit 14 finally determines the reservation block for the guardian who can be used in any schedule. Based on the guardian's characteristic information and the desired reservation block, it is known that the guardian with guardian ID 1 can be used in any schedule. Therefore, the allocation unit 14 determines reservation block II, reservation block IV, or reservation block VII as the reservation block for the guardian with guardian ID 1. Figure 5 In the example shown, reservation frame II is determined.

[0065] After completing the allocation of reservation blocks to all guardians, the allocation unit 14 transmits the finalized reservation blocks for each guardian to each guardian's terminal device 20. Furthermore, if the student's evaluation information indicates that there are brothers in the same school, the allocation unit 14 allocates the brothers to the same reservation blocks for the same week or to adjacent reservation blocks.

[0066] Here, if the allocation unit 14 allocates a guardian to a desired reservation block as described above based on the guardian's characteristic information and the guardian's desired reservation block, and a guardian is found to be unable to be allocated to the guardian's desired reservation block, the allocation unit 14 notifies the guardian's terminal device 20 of a request to change the desired reservation block. When notifying the guardian's terminal device 20 of the change request, the allocation unit 14 also transmits information about available reservation blocks.

[0067] Then, the guardian selects the desired reservation box again from the available reservation boxes and sends the desired reservation box to the reservation management device 10 .

[0068] The allocating unit 14 reallocates the reservation blocks to available ones based on the changed desired reservation blocks. The allocating unit 14 repeats the notification of the change request and the reallocation until allocating the reservation blocks to all guardians is completed.

[0069] Furthermore, the allocation unit 14 may set priority reservation information for the guardian ID of the guardian who has changed the reservation block as described above, so that the guardian will be given priority when allocating reservation blocks next time and thereafter. Then, the allocation unit 14 may assign the desired reservation block to the guardian whose guardian ID has been set with priority reservation information, giving the guardian the highest priority when allocating reservation blocks next time and thereafter.

[0070] The reservation management device 10 includes a CPU (Central Processing Unit), semiconductor memories such as ROM (Read Only Memory) and RAM (Random Access Memory), storage devices such as a hard disk, and a communication interface.

[0071] A reservation management program as a web application is installed in the storage device of the reservation management device 10. When the CPU starts the reservation management program, the functions of the various components of the reservation management device 10 are executed.

[0072] Furthermore, part or all of the functions executed by the reservation management program may be implemented by hardware such as an ASIC (Application Specific Integrated Circuit), an FPGA (Field-Programmable Gate Array), or other circuits.

[0073] The guardian's terminal device 20 includes a control unit 21. The control unit 21 controls the entire terminal device 20. In particular, the control unit 21 displays a reservation frame sent from the reservation management device 10 on the display unit 22, or sends a desired reservation frame set and inputted on the input unit 23 to the reservation management device 10.

[0074] The display unit 22 is composed of a display device such as a liquid crystal display, and the input unit 23 is composed of an input device such as a mouse and a keyboard.

[0075] When a tablet terminal or a smartphone is used as the terminal device 20 , a touch panel included in the tablet terminal or the smartphone functions as both the display unit 22 and the input unit 23 .

[0076] The terminal device 20 includes a CPU, semiconductor memories such as ROM and RAM, a storage device such as a hard disk, a communication I / F, and the like.

[0077] A guardian application is installed in the storage device of the terminal device 20. By having the CPU start the guardian application, a reservation box can be displayed on the terminal device 20, and the desired reservation box settings can be input. Alternatively, instead of using the guardian application installed in the storage device as in this embodiment, a guardian application provided via a web browser can be used.

[0078] In addition, part or all of the functions executed by the guardian application can also be composed of hardware such as ASIC, FPGA, and other circuits.

[0079] Next, refer to Figure 6 The processing flow of the reservation management system 1 according to the present embodiment will be described with reference to the sequence diagram shown.

[0080] First, the reservation management device 10 stores the following Figure 3 The characteristic information of each guardian is as shown (S10).

[0081] Next, each guardian confirms the reservation frame output from the reservation management device 10 on the terminal device 20, selects a desired reservation frame from the reservation frame (S12), and outputs the selected desired reservation frame to the reservation management device 10 (S14).

[0082] The reservation management device 10 receives a reservation request frame output from each guardian's terminal device 20 ( S16 ), and allocates each guardian's reservation to the reservation frame based on the reservation request frame output from each guardian's terminal device 20 and each guardian's characteristic information ( S18 ).

[0083] Then, the reservation management device 10 outputs the reservation frame assigned to each guardian to the terminal device 20 of each guardian ( S20 ).

[0084] Furthermore, when a guardian to whom the guardian's desired reservation frame cannot be allocated as a result of allocation based on the guardian's characteristic information and the guardian's desired reservation frame as described above appears, the reservation management device 10 notifies the guardian's terminal device 20 of a request to change the desired reservation frame (S22).

[0085] Then, the guardian selects the desired reservation box again from the available reservation boxes (S24), and transmits the desired reservation box to the reservation management device 10 (S26).

[0086] Then, the reservation management device 10 repeats the notification of the change request and the reallocation until allocating reservation frames to all guardians is completed ( S28 ).

[0087] When allocating reservation frames to all guardians is completed, the reservation management device 10 outputs the reservation frame of each guardian to the terminal device 20 of each guardian ( S30 ).

[0088] According to the reservation management system 1 of the embodiment described above, reservations for each visitor are allocated to multiple reservation blocks based on each guardian's desired reservation block and each guardian's characteristic information. This reduces the number of rescheduling operations and allows for efficient schedule adjustments without wasting time.

[0089] In addition, in the reservation management system 1 of the above-mentioned embodiment, the terminal device 20 of the guardian who cannot be assigned to the desired reservation box is notified of the change request of the desired reservation box, and the reservation box is reallocated based on the desired reservation box that has been changed in accordance with the change request, and the notification of the change request and the reallocation are repeated until the reservation boxes are allocated to all visitors. Therefore, the reservation box can be reliably allocated to each guardian, and the reservation box desired by each guardian can be efficiently allocated.

[0090] In addition, in the reservation management system 1 of the above-mentioned embodiment, when priority reservation information is added to the visitor who has made a change to the reservation box, which gives priority to the allocation to the reservation box next time and thereafter, the guardian who has made a change to the reservation box can be given an advantage, so that the guardian's change of the reservation box can be performed more smoothly.

[0091] Furthermore, in the reservation management system 1 of the embodiment described above, the characteristic information of the guardian is set based on the evaluation of the guardian or the student. Therefore, the evaluation of the guardian by the school can be reflected in the allocation of reservation blocks, enabling more appropriate scheduling.

[0092] In addition, in the reservation management system 1 of the above embodiment, the required number of frames, non-adjacent guardian IDs, etc. are set as the guardian's characteristic information as described above, but the present invention is not limited to this. The guardian's priority can also be set as the guardian's characteristic information and the reservation can be allocated using the priority.

[0093] For example, a teacher who is to conduct an interview sets the input priority using a terminal device (not shown), and the priority is stored in advance in the visitor characteristic information storage unit 12 .

[0094] For example, the priority can be set based on information about the guardian's evaluation from the school (teacher), the guardian's interpersonal relationships, the guardian's work status, and whether or not the guardian has siblings. For example, the priority can be set based on the level of priority (high, medium, low, etc.) using numerical values ​​of 1, 2, 3, or letters of A, B, C, etc.

[0095] Methods of allocating reservations using priority include a method of allocating with priority given more importance than a guardian's reservation request box and a method of allocating with priority given to a guardian's reservation request box.

[0096] First, refer to Figure 7 The flowchart shown here will be used to explain a method of allocating reservations in a manner that prioritizes the priorities set for each guardian.

[0097] First, the school (teacher) sets up a reservation frame (S40). A questionnaire is administered to the guardian, for example, and the guardian selects a desired reservation frame within the reservation frame (S42). For example, the questionnaire is administered by sending a questionnaire to the guardian's terminal device 20. The guardian selects a first desired date and time and a second desired date and time as the desired reservation frame. In addition to selecting the desired reservation frame (desired date and time), the questionnaire also displays a note field, for example, where contact information with the teacher can be entered.

[0098] As contact matters, for example, the guardian's wishes can be set and input, such as "I hope after 15:00 on 0 month △△ day", "Only the date and time I want the reservation box to be free", "I hope my brother will make a reservation box on the same day", "I hope the earliest time possible" and "I hope the latest time possible".

[0099] The teacher then uses a terminal device (not shown) to display the questionnaire results for each guardian and prioritizes each guardian based on the contents of the reservation request box and the remarks column (S44). The priority levels set by the teacher are pre-stored in the visitor characteristics information storage unit 12. Furthermore, each guardian's reservation request box reception unit 13 receives and stores the information.

[0100] Next, the allocation unit 14 allocates reservations to each guardian based on the priority level of each guardian stored in the visitor characteristics information storage unit 12. Specifically, the allocation unit 14 first extracts the guardian with the highest priority level (S46). The allocation unit 14 then determines the first desired date and time for the extracted guardian with the highest priority level and allocates a reservation to the first desired date and time (S48).

[0101] Then, the allocation unit 14 determines whether the first desired date and time of the guardian with the highest priority is repeated among the guardians (S50). If it is repeated among multiple guardians (S50, "Yes"), the second desired date and time of the repeated guardian is determined, and the second desired date and time is used for adjustment (S52). Specifically, when the second desired date and time of the repeated guardian is free, the allocation unit 14 uses the second desired date and time to allocate an appointment to the guardian. At this time, when the second desired date and time of all the repeated guardians are free, one guardian is allocated to the first desired date and time, and other guardians are allocated to the second desired date and time. As a method of determining the guardian to be allocated to the first desired date and time, for example, a guardian with an earlier attendance number of the student can be allocated to the first desired date and time. In addition, in S50, when multiple guardians do not overlap (S50, "No"), the process proceeds to S58 described later.

[0102] Then, when the allocation unit 14 allocates an appointment using the second desired date and time in S52, it determines whether there is a duplication between guardians (S54). If there is a duplication between multiple guardians (S54, "Yes"), the allocation unit 14 allocates an appointment to the duplicate guardian using the first desired date and time again as a temporary appointment (S56). That is, at this point in time, there is a state where multiple guardians are duplicating the first desired date and time. In addition, the so-called duplication of multiple guardians in S54 includes the case where an appointment for the guardian of the first desired date and time has already been allocated for the second desired date and time, and the case where the second desired date and time is duplicated between guardians. In the case where the second desired date and time is duplicated between guardians, an appointment for one guardian is allocated for the second desired date and time, and the first desired date and time is again allocated to the other guardians. In addition, if there is no duplication between multiple guardians in S54 (S54, "No"), the process directly proceeds to the next S58.

[0103] The allocation unit 14 then determines whether all guardians have been assigned appointments (S58). If not (S58: No), it extracts the guardian with the next highest priority (S60). The allocation unit 14 then replaces the guardian with the highest priority with the guardian with the next highest priority, repeating the processes of S48 to S56.

[0104] The allocation unit 14 then determines whether all guardians have been assigned appointments (S58). If not (S58: No), it extracts the guardian with the third highest priority (S60). The allocation unit 14 then replaces the guardian with the highest priority with the guardian with the third highest priority, repeating the processes of S48 to S56.

[0105] The allocating unit 14 repeats the processes of S48 to S58 until it is determined in S58 that the allocation of reservations to all guardians has been completed.

[0106] If all guardians' appointments have been assigned in S58 (including the temporary appointments assigned as described above) (S58, "Yes"), the assigning unit 14 identifies duplicate appointment frames for multiple guardians and displays these frames on the teacher's terminal device to urge the teacher to manually adjust them. The teacher then manually adjusts the duplicate appointment frames using the terminal device (S62).

[0107] Then, the allocating unit 14 transmits the reservation frame to which the reservation is allocated to each terminal device 20 of each guardian ( S64 ).

[0108] By allocating reservations so as to prioritize the guardian's priority as described above, it is possible to schedule reservations that prioritize the wishes of the school (teacher).

[0109] In addition, in the production of Figure 7 If the schedule of the flowchart shown is not assigned to the guardian of the predetermined reservation block, the teacher will manually adjust it using the terminal device.

[0110] Next, the above description describes scheduling in which a guardian specifies a first desired date and time and a second desired date and time as desired reservation boxes. However, depending on the guardian, there are cases where a guardian may not specify a specific date and time, but instead select "ALL" as described above, and any date and time may be specified in the reservation box. Thus, one method for allocating reservations to guardians who have not specified a specific date and time is to allocate reservations starting with the earliest date and time. However, this method fills the reservation boxes at the beginning of the schedule relatively completely, creating an imbalance, which leads to the problem of not allocating reservations to all. Furthermore, if an imbalance occurs, there is the problem of not satisfying the wishes of guardians who have requested the dates and times that caused the imbalance.

[0111] Therefore, below, refer to Figure 8 The flowchart shown here is used to explain a method of allocating reservations for guardians who have not specified a specific date and time to all reservation blocks as completely as possible.

[0112] First, the process from setting the reservation box to allocating the reservation to the first desired date and time of the guardian with the highest priority (S90 to S98) is the same as Figure 7 However, during the questionnaire survey at S92, the guardian must specify a specific date and time for the first request, but can select "no date designation" or "no time designation" for the second request. Figure 9 This is a diagram showing an example of an interview adjustment screen that is displayed on the terminal device 20 of the guardian and allows selection of “no date designation” or “no time designation”.

[0113] exist Figure 9 In the interview adjustment screen shown, the first wish is displayed in a manner that allows for specific dates and times. The date and time of the appointment box are pre-set as a drop-down menu, and the guardian selects a certain date and time. In addition, the second wish can select the date and time of the appointment box in the same way as the first wish, and can also select the above-mentioned "no date specification" and "no time specification". If the guardian's wish is any date, select "no date specification", and if the guardian's wish is any time, select "no time specification". In addition, the guardian can select "no date specification" for only the date, and can select "no time specification" for only the time.

[0114] After extracting the highest-priority guardian in S96, the allocation unit 14 determines the highest-priority guardian's first desired date and time and allocates a reservation for that first desired date and time (S98). After allocating a reservation for the highest-priority guardian's first desired date and time, the allocation unit 14 determines whether there is overlap between guardians (S100). Overlap between guardians refers to situations where, for example, one guardian is allocated to one reservation block, there are two or more people wishing to schedule a reservation, or where, for example, four guardians are allocated to one block, there are more than four people wishing to schedule a reservation.

[0115] Then, if there is no overlap between guardians when allocating reservations to the first desired date and time (S100, No), the allocating unit 14 allocates a reservation to the guardian with the highest priority using the first desired date and time, and then proceeds to S114 described below.

[0116] On the other hand, if a reservation is assigned to the first desired date and time and there is a duplication between guardians (S100, "Yes"), the assignment unit 14 identifies the second desired date and time of the duplicate guardians, calculates the remaining number of frames (number of people) in the reservation frames for the second desired date and time specified by each guardian, identifies the guardian with the smallest total number of remaining frames (number of people), and assigns a reservation to the identified guardian using the first desired date and time. Furthermore, if "No date specification" or "No time specification" is selected as the second desired date or time when calculating the remaining number of frames in the reservation frames for the second desired date and time, all corresponding reservation frames are added together in the remaining number of frames (number of people).

[0117] Then, the allocation unit 14 extracts a guardian who was not assigned a reservation at the first desired date and time in the process of S98 to S100 and who has both specified a specific date and time in the second desired date and time (S102). Then, the allocation unit 14 makes adjustments using the extracted second desired date and time of the guardian (S104).

[0118] Specifically, when allocating a reservation to the second desired date and time of the guardian extracted in S102, the allocating unit 14 determines whether there is overlap between guardians (S106).

[0119] Then, if there is no overlap between guardians when allocating reservations to the second desired date and time (S106, No), the allocating unit 14 allocates reservations to the guardians extracted in S102 using the second desired date and time, and then proceeds to S110 described later.

[0120] On the other hand, when the allocation unit 14 allocates an appointment to the second desired date and time, if there is a duplication between the guardians extracted in S102 (S106, "Yes"), the allocation unit 14 will reuse the appointment allocated to the first desired date and time for the duplicate guardian as a temporary appointment (S108). That is, at this point in time, it is a state where multiple guardians overlap at the first desired date and time. In addition, the so-called duplication of multiple guardians in S106 may include a situation where an appointment for the guardian of the first desired date and time has already been allocated to the second desired date and time, or a situation where the second desired date and time overlaps between guardians. In the case where the second desired date and time overlaps between guardians, an appointment for a certain guardian is allocated to the second desired date and time, and the first desired date and time is reused to allocate appointments to other guardians.

[0121] That is, at the stage of processing up to S108, the allocating unit 14 allocates reservations (including temporary reservations made using the first desired date and time) to the guardian who has designated specific dates and times up to the second desired date and time using the first desired date and time or the second desired date and time.

[0122] Next, the allocation unit 14 extracts guardians who have not been assigned the first desired date and time and who have not specified a specific date or time in the second desired date based on the results of the guardian's questionnaire (S110). That is, the allocation unit 14 extracts guardians who have selected "no date designation" or "no time designation" in the second desired date on the interview adjustment screen. At this time, guardians who have selected both "no date designation" and "no time designation" are not extracted. Guardians who have selected both "no date designation" and "no time designation" have their appointment priority lowered, and after the appointment of the guardian who selected "no date designation" or "no time designation" is determined, the appointment is allocated.

[0123] Then, the allocating unit 14 allocates a reservation to the guardian who selected “no date designation” or “no time designation” extracted in S110 by executing the subroutine A ( S112 ).

[0124] Reference Figure 10 The flowchart shown in FIG. 1 illustrates the processing of the subroutine A. In addition, here, as the date of the reservation frame, Figure 11 As shown in A, set 4 / 22, 4 / 23, and 4 / 24 as the reservation block times, set 13:00, 14:00, 15:00, and 16:00, so that four guardians can be assigned to one reservation block. Also, suppose that the reservations are assigned to guardians with attendance numbers 1 to 25. Figure 11 A shows a state in which the processes up to the process of S108 described above are completed. Figure 11The number in Table A is the attendance number of the guardian (student).

[0125] Here, it is assumed that guardians with attendance numbers 1 to 20 designated a specific date and time as the second wish, and guardians with attendance numbers 21 to 25 selected "no date designation" or "no time designation" as the second wish. Figure 11 B is a diagram showing an example of the second wishes of the guardians with attendance numbers 21 to 25. In the subroutine A, reservations of the guardians with attendance numbers 21 to 25 are allocated.

[0126] First, the allocation unit 14 selects predetermined guardians from the guardians extracted in S110 (S200). Here, the guardians are selected in the order of attendance numbers. The allocation unit 14 first selects the guardian with attendance number 21.

[0127] Next, the allocation unit 14 obtains all desired dates and times for all guardians, excluding the selected guardian, whose appointments have not yet been confirmed (S202). Unconfirmed guardians include not only the highest-priority guardians, but also guardians of all priorities who have not yet been assigned an appointment. In this embodiment, the allocation unit 14 obtains the second-desired dates and times for guardians with attendance numbers 22 to 25, excluding the guardian with attendance number 21.

[0128] Then, the allocation unit 14 temporarily allocates all the desired dates and times of the undetermined guardian obtained in S202 to the reservation blocks (S204). At this time, if the second desired date is "no date specified," the allocation unit 14 temporarily allocates the reservation blocks for all dates, and if the second desired time is "no time specified," the allocation unit 14 temporarily allocates the reservation blocks for all times.

[0129] Specifically, for example, since the second desired date of attendance number 22 is 4 / 23 and the time is "no time designation", Figure 12 As shown, the reservation box for all the times of 4 / 23 is temporarily assigned to the guardian with attendance number 22. Figure 12 In the example, an attendance number is assigned to a confirmed reservation (determined), and an attendance number is assigned to a temporarily allocated reservation (temporary).

[0130] Similarly, since the second preferred date of attendance number 23 is "no date designation" and the time is 15:00, Figure 12 As shown, the reservation for the guardian with attendance number 23 is temporarily allocated to the reservation blocks at 15:00 on all dates. Similarly, the reservations for the second wishes of the remaining guardians with attendance numbers 24 and 25 are temporarily allocated. Figure 12The reservation status of all the second desired dates and times of the guardians with attendance numbers 22 to 25 is temporarily allocated.

[0131] Next, the allocating unit 14 calculates the estimated number of assigned persons by adding the number of guardians to whom reservations have been finalized and the number of guardians to whom reservations have been provisionally assigned for each reservation block ( S206 ).

[0132] Then, the allocating unit 14 identifies a reservation block to which the smallest number of people are predicted to be allocated at the second desired date and time of the guardian selected in S200, and allocates the reservation of the selected guardian to the reservation block (S208).

[0133] Specifically, since the second preferred date and time of the guardian of attendance number 21 is 4 / 24 and the time is "no time designation", Figure 12 The predicted number of people assigned to the reservation boxes for all time periods of 4 / 24 is confirmed, and the reservation for the guardian with attendance number 21 is assigned to the reservation box at 13:00, which has the smallest predicted number of people assigned. Figure 13 Show the Figure 11 The table shown in A assigns the reservation status of the guardian with attendance number 21.

[0134] Then, when the allocation unit 14 cannot confirm the appointment of the selected guardian in S210 (S210, "No"), specifically, when the appointments of four guardians have been confirmed in the appointment box with the least predicted number of people to be assigned, it is confirmed whether the appointments can be allocated in the order of the number of people assigned in all the desired appointment boxes from the smallest to the largest number of people. When the appointments of four guardians have been confirmed in all the desired appointment boxes, an appointment is temporarily allocated to the appointment box of the first desired date and time of the selected guardian (S212).

[0135] On the other hand, if the appointment of the selected guardian can be confirmed (S210, "Yes"), that is, if the appointment can be confirmed in any of the appointment boxes desired by the selected guardian, the allocation unit 14 checks whether there is an undetermined guardian extracted in S110 and not selected in S200 (S214). If there is an undetermined guardian (S214, "No"), the allocation unit 14 returns to S200 and selects the next guardian in the order. Specifically, the guardian with attendance number 22 is selected.

[0136] Specifically, the allocating unit 14 acquires the second desired date and time of all guardians with attendance numbers 23 to 25 except the selected guardian with attendance number 22, and provisionally allocates reservations for the acquired date and time. Figure 14The state of reservations to which the second desired date and time of all guardians with attendance numbers 23 to 25 are provisionally allocated is shown.

[0137] Then, the allocating unit 14 determines the reservation block with the least number of people expected to be assigned in the second preferred date and time of the guardian with attendance number 22 selected in S200, and allocates the reservation of the selected guardian with attendance number 22 to the reservation block. Specifically, regarding the second preferred date and time of the guardian with attendance number 22, the date is 4 / 23 and the time is "no time designation", so Figure 14 The predicted number of people assigned to all appointment slots for the time periods shown on April 23rd is confirmed, and the appointment for the guardian with attendance number 22 is assigned to the 13:00 appointment slot, which has the lowest predicted number of people. Furthermore, among the predicted number of people assigned to all appointment slots for the time periods on April 23rd, the 13:00 and 14:00 appointment slots have the lowest number of people. However, if there are multiple appointment slots with the lowest predicted number of people, for example, the earlier appointment slot is selected. Figure 15 Show the Figure 13 The table shown assigns the status of the appointment of the guardian with attendance number 22.

[0138] Next, the allocating unit 14 selects the next guardian with attendance number 23, acquires the second desired date and time of all guardians with attendance numbers 24 and 25 except the guardian with attendance number 23, and provisionally allocates the reservation for the acquired date and time. Figure 16 This shows the status of the provisional allocation of reservations for the second desired date and time for all guardians with attendance numbers 23 to 25. The allocation unit 14 then identifies the reservation block with the smallest number of people predicted to be allocated for the second desired date and time for the guardian with attendance number 23 selected in S200, and allocates the reservation for the selected guardian with attendance number 23 to that reservation block.

[0139] Specifically, regarding the second preferred date and time of the guardian with attendance number 23, the date is "No date specified" and the time is 15:00, so Figure 16 The estimated number of people assigned to the 15:00 appointment blocks for all the dates shown is confirmed, and the appointment for the guardian with attendance number 23 is assigned to the 15:00 appointment block on 4 / 24, which has the smallest estimated number of people assigned. Figure 17 Show the Figure 15 The table shown assigns the status of the appointment of the guardian with attendance number 23.

[0140] Next, the allocating unit 14 selects the next guardian with attendance number 24, acquires the second desired date and time of the guardian with attendance number 25 other than the guardian with attendance number 24, and provisionally allocates a reservation for the acquired date and time. Figure 18The status of the appointment for the second desired date and time of the guardian with attendance number 25 being provisionally allocated is shown. Then, the allocating unit 14 identifies the appointment block with the least number of people predicted to be allocated at the second desired date and time of the guardian with attendance number 24 selected in S200, and allocates the appointment of the selected guardian with attendance number 24 to that appointment block.

[0141] Specifically, regarding the second preferred date and time of the guardian with attendance number 24, the date is "No date specified" and the time is 16:00, so Figure 18 The estimated number of people assigned to the 16:00 appointment blocks for all the dates shown is confirmed, and the appointment for the guardian with attendance number 24 is assigned to the 16:00 appointment block on 4 / 24, which has the smallest estimated number of people assigned. Figure 19 Show the Figure 17 The table shown assigns the status of the appointment of the guardian with attendance number 24.

[0142] Next, the allocation unit 14 selects the last guardian with attendance number 25. Since there is no guardian other than the guardian with attendance number 25, the processing of S202 to S208 is not performed. The reservation box with the least number of guardians with confirmed reservations is determined at the second desired date and time of the guardian with attendance number 25, and the reservation of the guardian with attendance number 25 is allocated to the reservation box.

[0143] Specifically, regarding the second preferred date and time of the guardian with attendance number 25, the date is "No date specified" and the time is 16:00, so Figure 20 The number of guardians with confirmed reservations in the 16:00 reservation blocks for all the dates shown is confirmed, and a reservation for the guardian with attendance number 25 is assigned to the 16:00 reservation block for April 24, which has the fewest number of confirmed guardians. At this point, if four guardians have confirmed reservations in all the reservation blocks for the guardian with attendance number 25's second desired date and time, a reservation is provisionally assigned to the guardian with attendance number 25 for his first desired date and time. Figure 21 Show the Figure 19 The table shown assigns the status of the appointment of the guardian with attendance number 25.

[0144] Then, when the allocation unit 14 confirms in S214 that there is no undetermined guardian extracted in S110 and not selected in S200 (S214, "Yes"), it returns to Figure 8 As shown in the flowchart, the process of steps S98 to S114 is checked for all guardians of all priorities (S114). If not completed (S114, "No"), the guardian with the next highest priority is extracted (S116). The allocation unit 14 then replaces the guardian with the next highest priority and repeats the process of steps S98 to S116.

[0145] Then, when the allocation unit 14 confirms that the processing from S98 to S114 has been completed for all guardians of the priority level in S114, it extracts guardians whose reservations have not yet been confirmed (S118). The guardians extracted in S118 are those who have selected both "No date specification" and "No time specification." The allocation unit 14 then repeats the processing of subroutine A again (S120), targeting only those guardians who have selected both "No date specification" and "No time specification."

[0146] Then, when allocating units 14 have completed allocating reservations for all guardians in S214 of subroutine A (including the provisional reservations for the first preferred date described above) (S214, "Yes"), they identify a reservation frame for those exceeding the four-person limit and display it on the teacher's terminal device, prompting them to manually adjust the reservation. The teacher then manually adjusts the reservation frame using the terminal device to remove the reservation frame for those exceeding the four-person limit (S122).

[0147] Then, the allocating unit 14 transmits the reservation frame to which the reservation is allocated to each of the terminal devices 20 of the guardians ( S124 ).

[0148] By allocating the reservations of the guardians who have designated arbitrary dates and times as described above, all reservation frames can be allocated without omission.

[0149] The above describes how to allocate reservations when the guardian selects "No date specified" and / or "No time specified" as the reservation box. However, there may be a time period that the teacher wants to avoid if there is no guardian who wants to specify a date and time. In such a case, refer to Figure 22 The flowchart shown explains the scheduling that takes the teacher's wishes into consideration as described above. Figure 22 The flowchart shown is Figure 10 The illustrated example is a modification of the subroutine A, and therefore the description will focus on the points that differ from the description of the subroutine A described above.

[0150] In the modified example of subroutine A, after obtaining the estimated number of assigned persons in S206 , the assigning unit 14 excludes the date and time that the teacher wants to avoid from the second preferred date and time of the guardian selected in S200 ( S207 ).

[0151] Next, the allocating unit 14 identifies a reservation block with the smallest number of people expected to be assigned after excluding the date and time that the teacher wants to avoid from the second preference of the guardian selected in S200, and allocates the selected guardian's reservation to the reservation block (S208).

[0152] Then, when the appointment of the selected guardian cannot be determined in S210 (S210, "No"), specifically, when the appointment of four guardians has been determined in the appointment box with the least predicted number of people to be assigned, the allocation unit 14 confirms whether the appointment can be allocated in the order of the number of people assigned from the smallest to the largest in all the desired appointment boxes, and when the appointment of four guardians has been determined in all the desired appointment boxes, confirms whether the appointment can be determined if it is at the date and time excluded in S207 (S216).

[0153] Then, if the appointment can be confirmed at the date and time excluded in S207 (S216, "Yes"), the allocation unit 14 determines the date and time with the least number of people predicted to be assigned among the excluded date and time that can be assigned, and allocates the appointment of the selected guardian to the determined date and time (S218).

[0154] On the other hand, when the appointment for the selected guardian cannot be determined in S216 (S216, "No"), specifically, when the appointment cannot be determined even at the date and time after the teacher is excluded, the allocation unit 14 temporarily allocates the appointment to the appointment box of the first desired date and time of the selected guardian (S220).

[0155] In addition, when the allocation unit 14 can confirm the reservation of the selected guardian in S210 (S210, "YES"), that is, can confirm the reservation in any reservation box desired by the selected guardian, the processing is the same as the processing of the above-mentioned subroutine A.

[0156] By allocating reservations after excluding dates and times that the teacher wants to avoid as described above, scheduling can be performed that also takes the teacher's schedule into consideration.

[0157] Next, in the above description, the method of allocating reservations in such a manner as to give priority to the reservation box desired by the guardian is described. Next, referring to Figure 23 The flowchart shown explains a method of allocating reservations in such a manner that the reservation-desired box takes precedence over the priority of the guardian.

[0158] First, the process of setting the reservation frame and setting the priority of each guardian (S70 to S74) is as follows: Figure 7 S40 to S44 of the flowchart shown are the same.

[0159] Next, the allocating unit 14 first allocates the reservation of each guardian to the reservation block of the first desired date and time of all guardians ( S76 ).

[0160] Then, the allocation unit 14 determines whether the first desired date and time overlaps between guardians (S78). If it overlaps for multiple guardians (S78, "Yes"), the second desired date and time for the duplicate guardians is determined. If there is a guardian who can move to the second desired date and time (no appointment for the guardian with the first desired date and time is assigned to the moving destination), the appointment is allocated in such a way that the guardian's appointment is moved to the second desired date and time (S80). At this time, if all duplicate guardians can move to the second desired date and time, the guardian with the highest priority among the guardians is assigned an appointment for the first desired date and time, and the other guardians are moved to the second desired date and time. In addition, if multiple guardians do not overlap in S78 (S78, "No"), the process proceeds to S88, which will be described later, and a reservation box is sent to each guardian.

[0161] Then, when the allocation unit 14 has made adjustments using the second desired date and time in S80, it determines whether the second desired date and time overlaps between guardians (S82). If it overlaps for multiple guardians (S82, "Yes"), it again allocates an appointment to the duplicate guardian using the first desired date and time as a temporary appointment (S84). That is, at this point in time, multiple guardians are in a state of overlapping for the first desired date and time. In addition, the so-called situation of multiple guardians overlapping in S82 includes situations where an appointment for the guardian of the first desired date and time has already been allocated for the second desired date and time, or situations where the second desired date and time overlaps between guardians. In the case where the second desired date and time overlaps between guardians, the appointment of the guardian with the highest priority is allocated to the second desired date and time, and the first desired date and time is again allocated to the other guardians. In addition, if multiple guardians do not overlap in S82 (S82, "No"), the process proceeds to S88, which will be described later, and a reservation box is sent to each guardian.

[0162] After allocating appointments to all guardians using the first desired date and time or the second desired date and time as described above (including the allocation of temporary appointments described above), the allocating unit 14 identifies duplicate appointment frames for multiple guardians and displays these appointment frames on the teacher's terminal device to urge the teacher to manually adjust them. The teacher then manually adjusts the appointment frames using the terminal device to eliminate the duplicate appointment frames (S86).

[0163] Then, the allocating unit 14 transmits the reservation frame to which the reservation is allocated to each of the terminal devices 20 of the guardians ( S88 ).

[0164] By assigning reservations with priority given to the reservation frame desired by the guardian as described above, it is possible to schedule reservations with priority given to the guardian's wishes.

[0165] In addition, in the case of Figure 8 When the schedule of the flowchart shown is assigned to the guardian of the specified reservation box, it is manually adjusted by the teacher using the terminal device.

[0166] Next, in the above-described method of allocating reservations by giving priority to the reservation request box over the guardian's priority, similarly to the scheduling method that prioritizes priority, there is a case where the guardian selects "No date specification" and / or "No time specification." In such a case, subroutine A can be executed to allocate reservations, similarly to the scheduling method that prioritizes priority. Figure 24 This is a flowchart for the case where subroutine A is executed in a method of allocating reservations in such a manner that the reservation wish box takes precedence over the priority level of the guardian.

[0167] First, the process of setting the reservation frame and allocating the reservation to the first desired date and time of the guardian with the highest priority (S300 to S308) is as follows: Figure 23 However, during the questionnaire survey in S302, the guardian must specify a specific date and time for the first request, but can select "no date designation" or "no time designation" for the second request.

[0168] Then, in S306, the allocating unit 14 allocates reservations to all guardians using the first desired date and time. Furthermore, after allocating reservations to all guardians using the first desired date and time, the allocating unit 14 determines whether there are any overlaps between guardians (S308). If there are no overlaps between guardians when allocating reservations to the first desired date and time (S308, "No"), the allocating unit 14 allocates reservations using the first desired date and time and proceeds to S322, described below.

[0169] On the other hand, if a reservation is assigned to the first desired date and time and there is a duplication between guardians (S308, "Yes"), the allocation unit 14 identifies the second desired date and time of the duplicate guardians, calculates the remaining number of frames (number of people) in the reservation frames for the second desired date and time specified by each guardian, identifies the guardian with the smallest total number of remaining frames (number of people), and allocates a reservation to that guardian using the first desired date and time. Furthermore, if "No date specification" or "No time specification" is selected as the second desired date or time when calculating the remaining number of frames in the reservation frames for the second desired date and time, all corresponding reservation frames are added together in the remaining number of frames (number of people).

[0170] Then, the allocation unit 14 extracts a guardian who was not assigned a reservation at the first desired date and time in the process of S306 to S308 and who has both specified a specific date and time in the second desired date and time (S310). Then, the allocation unit 14 makes adjustments using the extracted second desired date and time of the guardian (S312).

[0171] Specifically, when allocating a reservation to the second desired date and time of the guardian extracted in S310 , the allocating unit 14 determines whether there is overlap between guardians ( S314 ).

[0172] Furthermore, if there is no overlap between guardians when allocating reservations to the second desired date and time (S314, No), the allocating unit 14 allocates reservations to the guardians extracted in S310 using the second desired date and time, and then proceeds to S318 described later.

[0173] On the other hand, when the allocation unit 14 allocates an appointment for the second desired date and time and there is a duplication between the guardians extracted in S310 (S314, "Yes"), the allocation unit 14 allocates an appointment for the duplicate guardian using the first desired date and time again as a temporary appointment (S316). That is, at this point in time, there is a state where multiple guardians are duplicated at the first desired date and time. In addition, the so-called duplication of multiple guardians in S314 may include a situation where an appointment for the guardian of the first desired date and time has already been allocated for the second desired date and time, or a situation where the second desired date and time overlaps between guardians. In the case where the second desired date and time overlap between guardians, an appointment for a certain guardian is allocated for the second desired date and time, and the first desired date and time is allocated again for the other guardians.

[0174] That is, the allocating unit 14 allocates a reservation (including a provisional reservation using the first desired date and time) to the guardian who has designated a specific date and time up to the second desired date and time at the stage of processing S316 using the first desired date and time or the second desired date and time.

[0175] Next, the assigning unit 14 extracts guardians who have not been assigned the first desired date and time and who have not specified a specific date or time in their second desired date, based on the results of the guardian questionnaire ( S318 ).

[0176] Then, the allocation unit 14 allocates the reservation to the guardian who selected "no date designation" or "no time designation" extracted in S318 by executing the subroutine A (S320). Figure 10 The description of the flowchart shown is the same.

[0177] Then, in S214 of the subroutine A, if the assigning unit 14 confirms that there is no undetermined guardian extracted in S318 and not selected in S200 (S214, "Yes"), it returns to Figure 24 The flowchart shown in FIG3 is used to extract guardians whose reservations have not yet been confirmed (S322). The guardians extracted in S322 are guardians who have selected both "No date specification" and "No time specification." Then, the allocation unit 14 repeats the processing of subroutine A again (S324) for guardians who have selected both "No date specification" and "No time specification."

[0178] Furthermore, if the allocation unit 14 has completed the allocation of reservations for all guardians (including the provisional reservation for the first preferred date) in S214 of subroutine A (S214, "Yes"), it identifies the reservation frame that exceeds the four-person limit and displays it on the teacher's terminal device to urge the teacher to manually adjust the reservation. The teacher then manually adjusts the reservation frame using the terminal device to remove the reservation frame that exceeds the four-person limit (S326).

[0179] Then, the allocating unit 14 transmits the reservation frame to which the reservation is allocated to each of the terminal devices 20 of the guardians ( S328 ).

[0180] By allocating the reservations of the guardians who have designated arbitrary dates and times as described above, all reservation frames can be allocated without omission.

[0181] In addition, for Figure 23 The subroutine A shown can also be applied Figure 22 The modified example of subroutine A shown here performs scheduling that takes into account dates that the teacher wants to avoid.

[0182] Furthermore, the reservation management system 1 of the above embodiment is an example of applying the present invention to reservations for interviews between teachers and guardians, but the present invention is not limited thereto and can also be used to determine other reservations, such as reservations for hospitals, restaurants, and tickets.

[0183] For example, in the case of restaurant reservations, the reservation box is set to the restaurant's business hours on a specified date. Moreover, as characteristic information of the visitor, for example, information on first-time or returning customers can be used. If the visitor is a returning customer, the number of repeat visits or the amount of money spent so far can be used. If the visitor is a first-time visitor, the budget presented by the visitor can be used. The reservation box is allocated based on such characteristic information. Specifically, for example, reservations can be allocated to returning customers over first-time visitors, or if the visitor is a returning customer, reservations can be allocated to guests who have visited the store frequently or spent a large amount of money as important guests, or if the visitor is a first-time visitor, reservations can be allocated to guests with a higher priority if the visitor presents a higher budget. Alternatively, the restaurant can set priorities based on the information described above and allocate reservations based on the priorities.

[0184] In addition, for example, in the case of hospital reservations, the reservation box is set with the treatment time of each medical department. Moreover, as the characteristic information of the visitor, for example, information such as whether it is a first visit or a follow-up visit, the urgency of the treatment, and whether the examination takes time can be used. The reservation box is allocated based on such characteristic information. Specifically, for example, it is possible to give priority to patients with first visits over those with follow-up visits by allocating more treatment time, or it is possible to give the highest priority to allocating appointments and treatment time to patients with a high degree of urgency for treatment. In addition, it is also possible to allocate more appointments for the treatment time of patients who need time for explanation.

[0185] For example, in a ticket reservation system, the reservation box is set to the performance date and time. Furthermore, visitor characteristics can include, for example, first-time or returning customers. For returning customers, this information can include the number of repeat visits, the amount of money spent to date, and, in the case of a ticket lottery, the winning rate. Reservation boxes are allocated based on this characteristic information. Specifically, for example, first-time or returning customers can be prioritized for ticket reservations. Returning customers with a lower winning rate can be prioritized for ticket reservations. For first-time customers, those with a higher budget can be prioritized for ticket reservations.

[0186] In addition, the present invention is not limited to the above-mentioned embodiments. During the implementation stage, the constituent elements can be deformed and concretized within the scope of the main purpose. In addition, various inventions can be formed by appropriately combining the multiple constituent elements disclosed in the above-mentioned embodiments. For example, all the constituent elements shown in the embodiments can also be appropriately combined. It is obvious that various modifications and applications can be made within the scope of the main purpose of the invention.

[0187] The following additional remarks are further disclosed regarding the present invention.

[0188] (Note 1)

[0189] The reservation management device of the present invention comprises: a reservation frame setting unit in which a plurality of reservation frames prepared by a host are pre-set; a visitor characteristic information storage unit in which characteristic information of a plurality of visitors who make reservations for the plurality of reservation frames is stored; a desired reservation frame receiving unit in which the desired reservation frames of the plurality of visitors are received; and an allocation unit in which the reservation of each visitor is allocated to each of the plurality of reservation frames based on the desired reservation frame of each visitor and the characteristic information of each visitor.

[0190] (Note 2)

[0191] In the reservation management device described in Supplement 1, the allocation unit is capable of notifying a terminal device of a visitor whose desired reservation frame cannot be allocated to a desired reservation frame of a change request, reallocating the desired reservation frame to a reservation frame based on the desired reservation frame changed in accordance with the change request, and repeating the notification of the change request and the reallocation until the allocation of reservation frames to all visitors is completed.

[0192] (Note 3)

[0193] In the reservation management device according to Supplementary Note 1 or 2, the allocating unit can add priority reservation information for allocating the visitor who wishes to change the reservation frame to the visitor with priority in allocating the visitor to the reservation frame next time and thereafter.

[0194] (Note 4)

[0195] In the reservation management device according to any one of Supplementary Notes 1 to 3, the characteristic information of the visitor can be set based on an evaluation of the visitor.

[0196] (Note 5)

[0197] In the reservation management device described in any one of Supplementary Notes 1 to 4, the host can be a school, the visitor can be a guardian of a student attending the school, and the reservation box can be a reservation box for a conversation between a school teacher and the guardian.

[0198] (Note 6)

[0199] In the reservation management device described in Supplementary Note 5, the characteristic information of the visitor can be set based on the evaluation of the student or the guardian.

[0200] (Note 7)

[0201] In the reservation management device according to Supplementary Note 1, the characteristic information of the visitor may be a priority set in advance for the visitor by the host, and the allocation unit may allocate the reservation to each visitor so as to give priority to the visitor's desired reservation frame.

[0202] (Note 8)

[0203] In the reservation management device described in Supplement 7, it can be configured that, when allocating reservations to each visitor based on the desired reservation boxes of visitors of the same priority level, the allocation unit extracts visitors whose desired reservation boxes specify arbitrary dates and times, selects visitors from the extracted visitors as targets for reservation box allocation, performs temporary allocation to reservation boxes based on the desired reservation boxes of visitors to whom reservations have not yet been allocated among all visitors other than the visitor as the target for reservation box allocation, and allocates reservations to the visitors as targets for reservation box allocation based on the number of the temporary allocations.

[0204] (Note 9)

[0205] In the reservation management device according to Supplementary Note 1, the characteristic information of the visitor may be a priority level preset by the host for the visitor, and the allocation unit may allocate the reservations of each visitor so that the visitor's reservation request frame takes precedence over the visitor's priority level.

[0206] (Note 10)

[0207] In the reservation management device described in Note 9, it can be configured such that the allocation unit extracts visitors whose desired reservation boxes specify an arbitrary date and time, selects visitors from the extracted visitors as targets for reservation box allocation, performs temporary allocation to reservation boxes based on the desired reservation boxes of visitors to whom reservations have not yet been allocated among all visitors other than the visitors to whom reservation boxes are allocated, and allocates reservations for the visitors to whom reservation boxes are allocated based on the number of the temporary allocations.

[0208] (Note 11)

[0209] In the reservation management device according to Supplementary Note 8 or 10, the allocating unit can allocate the reservation of the visitor to whom the reservation frame is allocated after excluding the exclusion frame preset by the host from the reservation frame.

[0210] (Note 12)

[0211] The reservation management system of the present invention includes the reservation management device according to any one of Supplementary Notes 1 to 10 and a visitor's terminal device.

[0212] (Note 13)

[0213] The reservation management method of the present invention includes: presetting a plurality of reservation boxes prepared by a host; pre-storing characteristic information of a plurality of visitors who make reservations in the plurality of reservation boxes; accepting the reservation boxes desired by the plurality of visitors; and allocating the reservations of each visitor to the plurality of reservation boxes based on the reservation boxes desired by each visitor and the characteristic information of each visitor.

[0214] (Note 14)

[0215] The reservation management program of the present invention is configured to cause a computer to execute the following steps: presetting a plurality of reservation boxes prepared by a host; pre-storing characteristic information of a plurality of visitors who wish to make reservations in the plurality of reservation boxes; accepting desired reservation boxes from a plurality of visitors; and allocating reservations for each visitor to the plurality of reservation boxes based on the desired reservation box and the characteristic information of each visitor.

[0216] Description of Reference Numerals

[0217] 1: Reservation management system; 10: Reservation management device; 11: Reservation frame setting unit; 12: Visitor characteristic information storage unit; 13: Reservation request frame receiving unit; 14: Allocation unit; 20: Terminal device; 21: Control unit; 22: Display unit; 23: Input unit.

Claims

1. A reservation management device comprising: a reservation frame setting unit in which a plurality of reservation frames prepared by the host are pre-set; a visitor characteristic information storage unit storing characteristic information of a plurality of visitors who have made reservations for the plurality of reservation boxes; a reservation request frame accepting unit that accepts reservation request frames from the plurality of visitors; as well as The allocating unit allocates reservations for each visitor to each of the plurality of reservation blocks based on the reservation request block for each visitor and characteristic information of each visitor.

2. The reservation management device according to claim 1, wherein: The allocation unit notifies a terminal device of a visitor whose desired reservation frame cannot be allocated to a desired reservation frame of a change request, and reallocates the desired reservation frame to the reservation frame based on the desired reservation frame changed in accordance with the change request, and repeats the notification of the change request and the reallocation until the reservation frames are allocated to all visitors.

3. The reservation management device according to claim 2, wherein: The allocating unit adds priority reservation information to the visitor who has changed the reservation block so that the visitor is allocated to the reservation block with priority next time and thereafter.

4. The reservation management device according to claim 1, wherein: The characteristic information of the visitor is set based on the evaluation of the visitor.

5. The reservation management device according to claim 1, wherein: The principal party is the school, The visitor is a guardian of a student attending the school. The appointment box is an appointment box for a conversation between the teacher of the school and the guardian.

6. The reservation management device according to claim 5, wherein: The characteristic information of the visitor is set based on the evaluation of the student or the guardian.

7. The reservation management device according to claim 1, wherein: The characteristic information of the visitor is the priority pre-set by the host for the visitor, The allocation unit allocates reservations to each visitor so that the priority level takes precedence over the visitor's reservation request frame.

8. The reservation management device according to claim 7, wherein: When allocating reservations to the visitors based on the desired reservation boxes of the visitors of the same priority level, the allocation unit extracts visitors whose desired reservation boxes specify an arbitrary date and time, selects visitors from the extracted visitors as targets for reservation box allocation, performs temporary allocation to reservation boxes based on the desired reservation boxes of visitors to whom reservations have not yet been allocated among all visitors other than the visitors to whom reservation boxes are allocated, and allocates reservations to the visitors to whom reservation boxes are allocated based on the number of the temporary allocations.

9. The reservation management device according to claim 1, wherein: The characteristic information of the visitor is the priority pre-set by the host for the visitor, The allocation unit allocates reservations to each visitor so that the reservation request frame of the visitor takes precedence over the priority of the visitor.

10. The reservation management device according to claim 9, wherein: The allocation unit extracts visitors whose desired reservation boxes specify arbitrary dates and times as the visitors, selects visitors from the extracted visitors as targets for reservation box allocation, performs temporary allocation to reservation boxes based on the desired reservation boxes of visitors to whom reservations have not yet been allocated among all visitors other than the visitors to whom reservation boxes are allocated, and allocates reservations to the visitors to whom reservation boxes are allocated based on the number of the temporary allocations.

11. The reservation management device according to claim 8 or 10, wherein: The allocating unit allocates the reservation of the visitor to whom the reservation frame is allocated after excluding the exclusion frame preset by the host from the reservation frame.

12. A reservation management system comprising: The reservation management device according to claim 1; and The terminal device of the visitor.

13. A reservation management method, comprising: Pre-set multiple appointment boxes prepared by the host; Pre-storing characteristic information of a plurality of visitors who make reservations for the plurality of reservation boxes; accepting reservation request boxes of the plurality of visitors; as well as Reservations for each visitor are allocated to the plurality of reservation blocks based on the reservation request block of each visitor and the characteristic information of each visitor.

14. A computer program product comprising a reservation management program, wherein the reservation management program is configured to cause a computer to execute the following steps: Pre-set multiple appointment boxes prepared by the host; Pre-storing characteristic information of a plurality of visitors who make reservations for the plurality of reservation boxes; accepting reservation request boxes of the plurality of visitors; as well as Reservations for each visitor are allocated to the plurality of reservation blocks based on the reservation request block of each visitor and the characteristic information of each visitor.

15. A computer-readable storage medium storing a reservation management program, wherein the reservation management program is configured to cause a computer to execute the following steps: Pre-set multiple appointment boxes prepared by the host; Pre-storing characteristic information of a plurality of visitors who make reservations for the plurality of reservation boxes; accepting reservation request boxes of the plurality of visitors; as well as Reservations for each visitor are allocated to the plurality of reservation blocks based on the reservation request block of each visitor and the characteristic information of each visitor.

Images