JP2009064270A - Reservation management method, reservation management system, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To shorten waiting time for a service. <P>SOLUTION: A schedule management device 20 stores a unit maximum capacity showing the number of persons acceptable per one basic frame in a setting information storage part 251, and when accepting input of a reservation request including patient ID and a desired time, specifies a reservation basic frame as a basic frame to which the desired time included in the accepted reservation request belongs, and tabulates the unit number of persons as an amount of schedule information corresponding to the reservation time included in the specified reservation basic frame from a schedule database 252, and when the tabulated unit number of persons is smaller than the unit maximum capacity, registers the schedule information including the desired time and the patient ID included in the reservation request in a schedule database 252. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a reservation management method, a reservation management system, and a program.

It is widely performed that a user makes a reservation before receiving a service, and various systems for managing the reservation have been proposed. For example, Patent Document 1 discloses a system that checks and warns of overlapping reservations at the time of reservation.
Japanese Patent Laid-Open No. 10-162064

  However, if the service provision period is filled with reservations, it is impossible to deal with users who are not reserved. In addition, if a non-reserved user is interrupted at a place full of reservations, the reserved user must wait.

  The present invention has been made in view of such a background, and an object of the present invention is to provide a reservation management method, a reservation management system, and a program that can provide services to users who are not reserved.

  The invention according to claim 1 of the present invention for solving the above-mentioned problem is a method for managing a reservation of a service, and specifies a user of the service in association with a CPU, a memory, and a reservation time. An information processing apparatus including a reservation database that stores user IDs to be used is a frame that is the number of people that can be reserved per one basic frame for a basic frame that is a period in which the service provision period is divided every predetermined time The reservation possible number is stored in the memory, the input of the reservation request including the user ID and the reservation desired time is accepted, and the reservation destination basic which is the basic frame to which the reservation desired time included in the received reservation request belongs Specifying a frame, and counting the number of reservations within the frame, which is the number of the user IDs corresponding to the reservation time included in the specified reservation destination basic frame, from the reservation database, If the frame in reservation number that total is less than the frame within reservable number, and be registered in the reservation database in association with the desired reservation time and the user ID included in the reservation request.

  According to the reservation management method of the present invention, it is possible to limit the number of people who can make a reservation in the basic frame, so it is possible to secure in advance a time for accepting users who are not reserved. Therefore, for example, it is possible to avoid a situation in which a medical institution is full of appointments and a non-reserved patient cannot be examined.

  Moreover, invention of Claim 2 among the present invention is the reservation management method of Claim 1, Comprising: The said information processing apparatus is the said number of people that can be reserved at the same time as the number of people that can be reserved simultaneously. When the number of reserved people in the frame is less than the number of people that can be reserved in the frame, the number of simultaneous reservations is calculated by counting the number of user IDs corresponding to the desired reservation time from the reservation database. When the calculated simultaneous reservation number is smaller than the simultaneous reservation possible number, the reservation request time and the user ID included in the reservation request are associated with each other and registered in the reservation database.

  In this case, since reservations of a plurality of users can be accepted at the same time, for example, even if one of the users does not arrive at the reservation time, the service can be provided to other users. . Therefore, it is possible to prevent idle time from being provided for the service. Therefore, it becomes possible to provide a service efficiently.

  The invention according to claim 3 of the present invention is the reservation management method according to claim 2, wherein the information processing apparatus stores the first and second simultaneous reservation possible numbers in the memory. And calculating the number of times when the desired reservation time is a second predetermined time unit shorter than the first predetermined time, which is the predetermined time, from the start time of the reservation destination basic frame, When the desired reservation time is an odd number of times, the first simultaneous reservation possible number is used as a comparison number, and when the reservation desired time is an odd number of times, the second simultaneous reservation possible number of people. As the comparison number, the number of simultaneous reservations is less than the number of comparisons, and the reservation request time and the user ID included in the reservation request are associated with each other and registered in the reservation database.

  The invention according to claim 4 of the present invention is the reservation management method according to claim 1, wherein the information processing apparatus associates the scheduled use time of the service with the use outside the reservation. A non-reservation database for storing the user ID for identifying a user, and the memory for an intra-frame allocatable number of persons that can be assigned a schedule for a non-reserved user per one basic frame The basic frame to which the requested allocation time included in the received allocation request is received and the scheduled allocation request for the non-reserved user including the user ID and the desired service provision time is received. The number of assigned persons, which is the number of the user IDs corresponding to the provision scheduled time included in the identified basic frame, is identified from the non-reservation database, and the total number of assigned persons is If less than those Occupancy, associates the providing desired time and the user ID included in the allocation request to be registered in the reservation outside the database.

  The invention according to claim 5 of the present invention is the reservation management method according to claim 4, wherein the information processing device is the number of non-reserved users who can be allocated at the same time. The number of people who can be assigned at the same time is stored in the memory, and when the number of people to be assigned is smaller than the number of people who can be assigned, the number of users assigned at the same time is counted from the non-reservation database to count the number of user IDs corresponding to the desired provision time. And when the calculated number of simultaneously allocated persons is smaller than the number of simultaneously allocated persons, the desired provision time and the user ID included in the allocation request are associated with each other and registered in the non-reservation database; To do.

  According to a sixth aspect of the present invention, there is provided a method for managing a service reservation, wherein a CPU, a memory, and a user ID for identifying a user of the service in association with a reservation time are specified. An information processing apparatus including a reservation database to store can make an in-frame reservation, which is the number of people that can be reserved per one basic frame, for a basic frame that is a period obtained by dividing the service provision period every first time The number of people is stored in the memory, the number of people that can be reserved at the same time is stored in the memory, the input of the reservation request including the user ID is accepted, and for each of the basic frames, From the reservation database, the number of reserved people in the frame is calculated by counting the number of the user IDs corresponding to the reservation time in the basic frame, and the reserved number in the frame is the number of people that can be reserved in the frame. The basic frame that is full is identified, and for each registration time that is a second time unit time from the start time of the identified basic frame, from the reservation database, the user ID corresponding to the registration time Calculating the number of simultaneous reservations counted by the number, specifying the registration time that the number of simultaneous reservations is less than the number of simultaneous reservations possible as the reservation time, and including the reservation time in association with the specified reservation time The user ID to be registered is registered in the reservation database.

  The invention according to claim 7 of the present invention is the reservation management method according to claim 6, wherein the information processing apparatus accepts an input of a command for acquiring a candidate for a time that can be reserved. In response to the command, for each of the basic frames, the number of reserved users in the frame counting the number of user IDs corresponding to the reservation time in the basic frame is calculated from the reservation database, Select the basic frame whose number of reservations is less than the number of people that can be reserved in the frame, and for each of the selected basic frame, the use corresponding to the registration time from the reservation database for each registration time in the basic frame The number of person IDs is counted to calculate the number of simultaneous reservations, and the list of registration times when the number of simultaneous reservations is less than the number of simultaneous reservations is output.

  Other problems and solutions to be disclosed by the present application will be made clear by the embodiments of the invention and the drawings.

  According to the present invention, the service waiting time can be shortened.

  Hereinafter, a reservation management system according to an embodiment of the present invention will be described. The appointment management system according to the present embodiment manages a schedule related to a medical examination of a patient who visits a medical institution, and reduces the burden of waiting time until the patient receives a medical examination.

  In the present embodiment, the scheduled start time of the examination is presented to the patient when the patient is accepted. In a general medical institution, it is unclear when a non-reserved patient will receive a call for examination, and all waiting time is required after the reception until the examination is performed. However, in the appointment management system of the present embodiment, the scheduled start time of the examination is presented at the time of reception, so that the patient's mental burden of not knowing when to receive the examination call is reduced.

  Moreover, in this embodiment, the time for accepting a reservation is limited, and a period for not accepting a reservation is provided, so that a period for examining a patient outside the reservation is provided in advance. As a result, it is possible to avoid a situation in which the reserved patient is full and the waiting time of the non-reserved patient becomes too long.

  In this embodiment, the waiting time of the patient means the time from the appointment time to the time when the examination is actually started for a patient with an appointment, and the patient who is not scheduled is presented to the patient. The time from the scheduled start time of the examination to the time when the examination is actually started shall be said.

FIG. 1 is a diagram illustrating a period during which reservations can be accepted and a period during which reservations cannot be accepted.
In this embodiment, a medical institution performs a diagnosis during a period from 09:00 to 16:00 (hereinafter referred to as a provision period).

  The provision period is divided every predetermined time (60 minutes as an example in the present embodiment), and each divided period is called a basic frame. The basic frame is composed of two periods called a reservation frame and a current day frame. The reservation frame is a period for accepting a reservation, and the current day frame is a period for not accepting a reservation. On the day slot, a schedule related to the examination of an unreserved patient is assigned.

  The reservation frame is composed of a plurality of reservation registration frames, and the current day frame is composed of a plurality of current day registration frames. The reservation registration frame and the current day registration frame have a length of 10 minutes or 20 minutes, for example, and these lengths are registered as setting information described later by the system administrator.

  In the present embodiment, it is possible to accept a reservation for each reservation registration frame and to accept a plurality of reservations for the same reservation registration frame. In addition, for patients who are not reserved, a schedule is registered for each day registration frame, and a plurality of schedules can be registered for the same day registration frame.

  In this way, in this embodiment, a day frame is provided for each basic time frame so that the period for providing medical examination is not filled with appointments alone. Therefore, a patient who is not scheduled can be examined on the day frame. Therefore, it is possible to avoid a situation where the appointment is full and the patient outside the appointment cannot be examined.

  In the reservation management system of this embodiment, a plurality of patients are assigned to the same reservation registration frame and same-day registration frame. For example, when one of the reserved patients is delayed, other reservations are made. The patient can be examined. Thereby, the operation rate of a doctor can be raised. Therefore, it is possible to shorten the time when the doctor is not performing a medical examination, and the waiting time of the entire patient can be shortened.

  Hereinafter, a reservation management system for managing reservations and schedules using the frame as described above will be described in detail.

== System configuration ==
FIG. 2 is a diagram showing the overall configuration of the reservation management system according to the present embodiment. As shown in the figure, the reservation management system of the present embodiment includes a reception terminal 11, an operator terminal 12, and a schedule management device 20. The reception terminal 11, the operator terminal 12, and the schedule management device 20 are each connected to a communication network 30 and can communicate with each other. The communication network 30 is, for example, a LAN (Local Area Network) or the Internet laid on the premises of a medical institution. The communication network 30 is constructed using, for example, a telephone line network, Ethernet (registered trademark), a wireless communication network, or the like.

  The reception terminal 11 is a computer that is installed at a reception of a medical institution and reads identification information (hereinafter referred to as a patient ID, which corresponds to a user ID of the present invention) for identifying a patient from a patient's examination ticket. The reception terminal 11 is, for example, a personal computer, a workstation, or a PDA. In addition, the reception terminal 11 receives input of information related to a diagnosis such as a department received by the patient. For example, the reception terminal 11 may display guidance for a patient and receive input of information such as a department from the patient, or may receive input of information from an employee engaged in reception work.

  The operator terminal 12 is a computer operated by an operator who accepts reservations. The operator terminal 12 is, for example, a personal computer, a workstation, or a PDA. In the present embodiment, for example, it is assumed that the operator operates the operator terminal 12 in accordance with a reservation request received from a patient by telephone or e-mail. The operator terminal 12 transmits a command (hereinafter referred to as “reservable time acquisition request”) for acquiring a list of reservable times (hereinafter abbreviated as “reservable time list”) to the schedule management apparatus 20, which will be described later. The reservation available time list returned from the schedule management device 20 is displayed. The operator transmits the reservation available time list displayed on the operator terminal 12 to the patient, for example, orally. The operator inputs information such as the appointment time determined by the patient and the department to be received to the operator terminal 12, and the operator terminal 12 issues a command (hereinafter referred to as an appointment request) to make an appointment based on the inputted information. Is transmitted to the schedule device 21. Thereby, as will be described later, the schedule management device 20 registers the patient reservation.

  The schedule management device 20 is a computer that manages appointments such as appointments for examinations and scheduled start times of examinations for non-reserved patients. The schedule management device 20 is, for example, a personal computer, a workstation, or a PDA.

== Schedule management device 20 ==
FIG. 3 is a diagram illustrating a hardware configuration of the schedule management apparatus 20. As shown in the figure, the schedule management device 20 includes a CPU 201, a memory 202, a storage device 203, a communication interface 204, an input device 205, and an output device 206. The storage device 203 is, for example, a hard disk drive or a CD-ROM drive that stores data and programs. The CPU 201 implements various functions by reading the program stored in the storage device 203 into the memory 202 and executing it. The communication interface 204 is an interface for connecting to the communication network 30. The communication interface 204 is, for example, a modem for connecting to a telephone line network or an adapter for connecting to Ethernet (registered trademark). The input device 205 accepts input of various types of information, such as a keyboard, mouse, IC card reader, touch panel, and microphone. The output device 206 is, for example, a display, a printer, or a speaker that outputs information.

  FIG. 4 is a diagram illustrating a software configuration of the schedule management apparatus 20. As shown in the figure, the schedule management device 20 includes a reservationable time acquisition request receiving unit 211, a reservationable time list generating unit 212, a reservationable time transmitting unit 213, a reservation request receiving unit 214, a reservation information registration unit 215, a reservation A message transmission unit 216, a reception information reception unit 217, a reception information registration unit 218, a reception message transmission unit 219, a setting information storage unit 251, and a schedule database 252 are provided.

The setting information storage unit 251 stores setting information of the schedule management device 20. A configuration example of the setting information stored in the setting information storage unit 251 is shown in FIG. As shown in the figure, the setting information includes basic frame time, reservation frame unit time, current day frame unit time, number of reservation registration frames, number of current day registration frames, odd number of simultaneous reservations, even number of simultaneous reservations, odd number of simultaneous reservations Includes the allocatable number of people and even number of people that can be assigned at the same time.
The basic frame time indicates the length of the basic frame. The reservation registration frame time and the day registration frame time indicate the lengths of the reservation registration frame and the day registration frame, respectively.
The number of reserved registration frames indicates the number of reservation registration frames constituting the reservation frame, and the current day registration frame number indicates the number of current day registration frames constituting the current day frame.

  The number of people that can be reserved within the frame is the number of people that can be reserved in the reservation frame. The odd number of simultaneous reservations is the number of people that can be reserved for the odd-numbered reservation registration frame within the reservation frame, and the even number of simultaneous reservations is the number of people that can be simultaneously reserved for the even-numbered reservation registration frame within the reservation frame. . Therefore, a value obtained by multiplying the average value of the odd-number simultaneous reservation-capable number and even-number simultaneous reservation-capable number by the number of reservation registration frames is the number of reservations within the frame.

  The number of people that can be assigned within the frame is the number of people who can be assigned to a medical examination for that day frame. The odd number of people who can be assigned at the same time is the number of people who can be assigned to the odd numbered registration frame on the current day, and the even number of people who can be assigned at the same time can be assigned to the medical examination for the even numbered registration frame on that day. It is the number of people. Therefore, a value obtained by multiplying the average value of the odd number of simultaneously assignable people and the even number of assignable people by the number of registered frames on the day becomes the in-frame assignable number of people.

  The schedule database 252 stores information related to the examination schedule (hereinafter referred to as schedule information). FIG. 6 shows a configuration example of schedule information stored in the schedule database 252. As shown in the figure, the schedule information includes a patient ID for identifying a patient to be examined, a medical department where the patient is examined, a scheduled examination time, and a classification. The classification is information indicating whether the schedule information is a schedule based on a reservation or a non-reservation schedule based on reception on the day. In this embodiment, the classification is either “reserved” or “not reserved”.

  The reservable time acquisition request reception unit 211 receives a reservable time acquisition request transmitted from the operator terminal 12. It is assumed that the operator can set the desired reservation time in the reservation available time acquisition request as necessary. In this case, as will be described later, a reservation registration frame that can be reserved after the start time of the basic frame to which the desired reservation time belongs is searched. The reservation available time list generation unit 212 generates a reservation available time list in response to a reservation available time acquisition request. The reservation available time transmission unit 213 transmits the reservation available time list to the operator terminal 12.

  The reservation request receiving unit 214 receives a reservation request transmitted from the operator terminal 12. A configuration example of the reservation request is shown in FIG. As shown in the figure, the reservation request includes a patient ID, a department, and a reservation time. The reservation information registration unit 215 generates schedule information based on the reservation request, and registers the generated schedule information in the schedule database 252. The reservation message transmission unit 216 transmits a message regarding registration of schedule information based on the reservation request to the operator terminal 12. Examples of the message transmitted by the reservation message transmission unit 216 include a message indicating that a reservation has been made and a message indicating that an error has occurred during registration.

  The reception information receiving unit 217 receives reception information transmitted from the reception terminal 11. A configuration example of the reception information is shown in FIG. As shown in the figure, the reception information includes a patient ID and a medical department. The reception information registration unit 218 generates schedule information based on the reception information, and registers the generated schedule information in the schedule database 252. The reception message transmission unit 219 transmits a message related to registration of schedule information based on the reception information to the reception terminal 11. For example, the reception message transmission unit 219 transmits a message indicating that the scheduled time included in the schedule information registered based on the reception information is the scheduled start time of the diagnosis to the reception terminal 11. By displaying this message on the reception terminal 11, it becomes possible for a non-reserved patient to know in advance the scheduled start time of the examination. Therefore, it is possible to remove the anxiety that it is not known when the order of examinations will come as in the past. In addition, the patient can freely act until the scheduled start time, and the time that the patient actually waits for a consultation call is from the scheduled start time to the time when the diagnosis is actually started. Thus, patient waiting time is reduced.

  The above-described reservation available time acquisition request reception unit 211, reservation available time list generation unit 212, reservation available time transmission unit 213, reservation request reception unit 214, reservation information registration unit 215, reservation message transmission unit 216, reception information reception unit 217, the reception information registration unit 218, and the reception message transmission unit 219 are realized by the CPU 201 included in the schedule management device 20 reading the program stored in the storage device 203 into the memory 202 and executing it. The setting information storage unit 251 and the schedule database 252 are realized as storage areas provided by the memory 202 and the storage device 203 provided in the schedule management device 20.

== Reservable time list generation process ==
Next, processing performed by the schedule management apparatus 20 according to the present embodiment will be described.
As described above, when receiving the reservation available time acquisition request, the schedule management device 20 generates a reservation available time list and responds to the operator terminal 12 with the generated reservation available time list. FIG. 9 is a diagram showing a flow of a reservation time list generation process.

  If the desired reservation time is set in the available reservation time acquisition request received by the available reservation time acquisition request reception unit 211 (S401: YES), the available reservation time list generation unit 212 has a basic frame to which the desired reservation time belongs. And the time of the starting point of the identified basic frame is set to K (S402). On the other hand, if the reservation desired time is not set in the reservation available time acquisition request (S401: NO), the reservation available time list generation unit 212 starts the examination (in this embodiment, 09:00). Is set to K (S403).

  The reservation available time list generation unit 212 empties the reservation available time list (S404), and performs the following processing while K is before the end time of the examination (16:00 in the present embodiment). Do.

  The reservation possible time list generation unit 212 sets “1” in the counter (S405), sets K in S (S406), and performs the following processing while the counter does not exceed the number of reserved registration frames in the setting information. Do.

  If the counter is an odd number (S407: YES), the reservation possible time list generation unit 212 sets the odd number of simultaneous reservations possible in the setting information to L (S408), and if the counter is an even number (S407: NO), the setting information Let L be the number of people who can make an even number simultaneous reservation (S409). The reservation possible time list generation unit 212 counts the number of schedule information whose scheduled time is S and whose category is “reservation” from the schedule database 252 and sets it as C (S410). If C is less than L (S411: YES), S is added to the reservation available time list (S412).

  The reservation available time list generation unit 212 increments the counter (S413), and adds the reservation registration frame time of the setting information to S (S414).

After the above processing is repeated, the reservationable time list generation unit 212 adds the basic frame time of the setting information to K (S415), and repeats the processing from (S405).
As described above, the reservation available time list is generated.

== Reservation processing ==
The reservation available time list generated as described above is transmitted to the operator terminal 12.
The operator terminal 12 displays a reservation available time list, accepts designation of a reservation available time included in the reservation available time list, and, together with the designated time, a patient ID that identifies the patient and a medical treatment that the patient visits A reservation request including a department is transmitted to the schedule management device 20.

  In the schedule management device 20, when the reservation request receiving unit 214 receives a reservation request, a diagnosis reservation process is performed. FIG. 10 shows the flow of the reservation process.

  The reservation information registration unit 215 acquires the reservation time included in the reservation request received by the reservation request reception unit 214, and specifies a basic frame (hereinafter referred to as a reservation destination basic frame) to which the acquired reservation time belongs (S421). .

  The reservation information registration unit 215 counts the schedule information whose reservation time is within the reservation destination basic frame and whose category is “reservation” from the schedule database 252 and sets it to N (S422). If N is equal to or greater than the number of reservations within the setting information frame (S423: NO), an error message indicating that reservation cannot be made at the designated reservation time is transmitted to the operator terminal 12 (S424).

  If N is less than the number of people that can be reserved within the frame (S423: YES), the reservation information registration unit 215 sets the time from the start point of the reservation destination basic frame to S (S425) and sets the time from S to the scheduled time as setting information. The value obtained by adding 1 to the quotient divided by the reserved registration frame time is I (S426). That is, in the reservation destination basic frame, the reservation time corresponds to the I-th reservation registration frame.

  If I exceeds the number of reserved registration slots in the setting information (S427: NO), the process proceeds to (S424), and the reservation message transmitting unit 216 indicates an error message indicating that reservation cannot be made at the designated reservation time. Is transmitted to the operator terminal 12.

  If I is equal to or less than the number of reservation registration frames (S427: YES), the reservation information registration unit 215 counts the number of schedule information corresponding to the reservation time and having the category “reservation” from the schedule database 252. C (S428).

  If I is an odd number (S429: YES), the reservation information registration unit 215 sets the odd number of simultaneous reservations possible in the setting information to L (S430), and if I is an even number (S429: NO), the setting information is an even number. Let L be the number of people who can make simultaneous reservations (S431).

  If C is greater than or equal to L (S432: NO), the process proceeds to (S424), and the reservation message transmission unit 216 sends an error message to the operator terminal 12 indicating that the reservation registration frame is filled with reservations and cannot be reserved. Send.

  On the other hand, if C is less than L (S432: YES), the reservation information registration unit 215 creates schedule information in which the patient ID, the department and the reservation time, and “reservation” included in the reservation request are set. To the schedule database 252 (S433).

  As described above, the schedule information based on the reservation request is registered in the schedule database 252.

  As described above, in the reservation management system of the present embodiment, the number of patients that can be reserved in the basic frame can be limited in advance. Therefore, it is possible to secure in advance a time for accepting an unreserved patient. Therefore, it is possible to avoid a situation in which a reservation is full and a patient outside the reservation cannot be examined. In addition, when the appointment is full and the examination is performed while interrupting the non-reserved patient, the patient's waiting time will increase. By securing it, it becomes possible to suppress an increase in patient waiting time.

  Further, as described above, according to the reservation management system of the present embodiment, reservations for a plurality of patients can be received at the same time. Therefore, for example, even if one of the patients does not come at the appointment time, the other patient can be examined, so that the doctor's idle time can be prevented. Therefore, it becomes possible to perform a medical examination efficiently as a whole medical institution, and the waiting time of the patient can be shortened.

  Note that the operator terminal 12 may transmit a reservation request not specifying a reservation time to the schedule management device 20 without acquiring a reservation available time list. In this case, the schedule management apparatus 20 sets 09:00 to K and performs the above-described processing of (S404) to (S411) in FIG. 9. When C is less than L in (S411), Schedule information in which the patient ID and department, S, and “reservation” included in the reservation request are created and registered in the schedule database 252 and the process is terminated. Accordingly, the operator can make a reservation request without specifying a time, and therefore can deal with a patient who requests a reservation at the earliest possible time.

== Reception process outside reservation ==
Next, a process for registering schedule information for a non-reserved patient will be described.
When reception is performed for an unreserved patient, reception information is transmitted from the reception terminal 11 to the schedule management device 20. In the schedule management device 20, when the reception information receiving unit 217 receives the reception information, a schedule information registration process based on the reception information shown in FIG. 11 is performed.

  The reception information registration unit 218 acquires the current time, sets the acquired current time as K (S441), and empties the assignable time list (S442). The reception information registration unit 218 performs the following process until K reaches 16:00, which is the end of the examination.

  The reception information registration unit 218 sets “1” in the counter (S443) and sets K in S (S444). The reception information registration unit 218 performs the following processing while the counter is equal to or less than the number of registration frames on the day of the setting information.

  When the counter is an odd number (S445: YES), the reception information registration unit 218 sets the odd number of the setting information that can be simultaneously allocated to L (S446), and when the counter is an even number (S445: NO), the setting information is an even number. The number of people that can be allocated simultaneously is set to L (S447). The reception information registration unit 218 counts the number of schedule information whose scheduled time is S and whose category is “non-reserved” from the schedule database 252 as C (S448).

  When C is less than L and S is after the current time (S449: YES), the reception information registration unit 218 determines S, exits the processing loop, and proceeds to (S454).

  On the other hand, if C is greater than or equal to L or S is before the current time (S449: NO), the reception information registration unit 218 increments the counter (S450), and S is the registration frame for setting information on that day. The time is added (S451).

  If S is not determined even after performing the above processing, the reception information registration unit 218 sets 16:00 to S (S453).

  The reception information registration unit 218 creates schedule information by setting the patient ID and the department included in the reception information, S, and “non-reserved” schedule information with S determined as described above as a scheduled time. Register in the database 252 (S454).

  The reception message transmission unit 219 creates a message “Scheduled start of diagnosis is S” (S455), and transmits the created message to the reception terminal 11 (S456).

  As described above, the schedule information based on the reception information is registered in the schedule database 252, and a message for informing the registered scheduled start time of the diagnosis is transmitted to the reception terminal 11. Therefore, the reception terminal 11 can display the scheduled start time of the diagnosis for the patient who has received the reception. The patient can grasp in advance the scheduled start time of the examination at the time of reception. Therefore, the patient does not have to wait in front of the examination room until the scheduled examination start time, which is convenient because other tasks can be completed. In addition, it is possible to reduce the mental burden of the patient who does not know when there is an examination call. Also, the waiting time for the patient to actually wait for the start of the examination is shortened.

  Instead of the operator terminal 12, a reservation time acquisition request or reservation request may be transmitted to the schedule management device 20 from a patient terminal operated by the patient. Similarly, instead of the reception terminal 11, a terminal such as a mobile phone or a PDA formed by the patient can be used as the communication network 30, and the reception information may be transmitted from the patient terminal to the schedule management device 20. .

  Further, schedule information based on the reception information may be registered by the same processing as in FIG. In this case, in the processing of FIG. 10, the reservation time is the scheduled desired time of the allocation information, the number of people that can be reserved within the frame is the number of people that can be allocated within the frame, the reservation registration frame time is the registration frame time of the day, An odd number of people that can be assigned simultaneously. In (S422) and (S428), the schedule information whose category is “non-reserved” is counted, and in (S433), the patient ID, the department, the desired scheduled time, and the schedule information of “non-reserved” are registered. Like that. In this case, a non-reserved patient can also specify the desired reception time.

== Simulation =
FIG. 12 shows the result of a simulation for examining the waiting time of a patient using the above-described basic frame, reservation frame, current day frame, reservation registration frame, and reservation method using the same day registration frame.

  For this simulation, we used the results of a survey of patient visits at a hospital. In this hospital, about two-thirds of outpatients were scheduled, and the average examination time was about 5 minutes. Therefore, in this simulation, the length of the reservation registration frame and the day registration frame was examined in three ways of 5 minutes, 5 minutes, 10 minutes, and 20 minutes. In addition, the length of the basic frame was examined in two ways, 30 minutes and 60 minutes.

  In the table of FIG. 12, the first line in which “actual data” is set in the basic frame indicates the actual waiting time of the patient in the hospital where the above-described investigation was performed.

  In the table in the figure, the reservation-based waiting time is the average value of the time from the time when the patient makes a reservation until the patient actually sees the patient, and the arrival-based waiting time indicates that the patient visits the hospital. It is the average value of the time from the time of reception to the time when the patient is actually examined. Also, in this simulation, it is assumed that the scheduled start time of the examination is presented to the patient at the time of reception, and the schedule-based waiting time means that the patient actually sees the diagnosis from the scheduled start time of the examination presented to the patient. This is the average time to receive.

  In the column of reservation registration frame, the reservation registration frame time of the setting information is shown, and the numerical value in parentheses indicates the number of people who can make a reservation at the same time. In the case of two numerical values connected with a hyphen “-” in parentheses, the left side of the hyphen indicates the odd-number simultaneous reservation possible number and the right side indicates the even number simultaneous reservation possible number. For example, as in the example of FIG. 5, when the odd-number simultaneous reservation possibility number is “3” and the even-number simultaneous reservation possibility number is “5”, “(3-5)” is described. Similarly, in the current day frame column, the current day registration frame time is shown, and the number of people who can be allocated at the same time is shown in parentheses. The left side of the hyphen is an odd number of people who can be assigned simultaneously, and the right side is an even number of people who can be assigned simultaneously.

  In this simulation, for the sake of simplicity, it is assumed that the appointment is made when the patient visits. In other words, reservation processing is performed in which the desired reservation time is not set when a patient with a reservation visits using actual data obtained from the survey.

  In addition, the hospital where the above survey was conducted does not notify the scheduled start time of consultations when accepting non-reserved outpatients, so it is expected that unreserved patients will be called immediately after the visit. Therefore, it is assumed that the waiting time on the scheduled basis for the non-reserved patient was about 105 minutes, the same as the waiting time on the arrival basis.

  As shown in FIG. 12, in all cases, latency was reduced for both scheduled and arrival bases for non-reserved patients. In addition, the waiting time is about 12 to 20 minutes on a scheduled basis, and the difference is smaller than the waiting time on the reservation basis for a patient who has a reservation is about 9 to 20 minutes. In other words, as in the present embodiment described above, by accepting a reservation using the basic frame, the reservation frame, and the current day frame, the waiting time of the patient is shortened. Therefore, it is possible to avoid a case where an unreserved patient is unduly waited.

  As shown in FIG. 12, good results are obtained when the basic frame is “60”, the reservation registration frame is “20 (3-5)”, and the current day registration frame is “10 (1-3)”.

  In addition, among the results shown in FIG. 12, the waiting time of the reservation registration frame and the current day registration frame is 5 minutes, but the waiting time is shortened. Since it is assumed that there are non-reserved patients who do not appear in the examination at the scheduled time, if only one person is scheduled in the same registration frame, if the patient is delayed as described above, There is a possibility that it will be free time. Therefore, it is desirable to assign 10 or more minutes to the reservation registration frame and the day registration frame, that is, a plurality of people at the same time.

  Although the present embodiment has been described above, the above embodiment is intended to facilitate understanding of the present invention and is not intended to limit the present invention. The present invention can be changed and improved without departing from the gist thereof, and the present invention includes equivalents thereof.

It is a figure explaining the period which can accept a reservation, and the period which cannot be accepted. It is a figure showing the whole reservation management system composition concerning this embodiment. 2 is a diagram illustrating a hardware configuration of a schedule management device 20. FIG. 3 is a diagram showing a software configuration of a schedule management device 20. FIG. 6 is a diagram illustrating a configuration example of setting information stored in a setting information storage unit 251. FIG. It is a figure which shows the structural example of the schedule information memorize | stored in the schedule database. It is a figure which shows the structural example of a reservation request. It is a figure which shows the structural example of reception information. It is a figure which shows the flow of a production | generation process of a reservation possible time list | wrist. It is a figure which shows the flow of a reservation process. It is a figure which shows the flow of the registration process of the schedule information based on reception information. It is a figure which shows the result of simulation.

Explanation of symbols

DESCRIPTION OF SYMBOLS 11 Reception terminal 12 Operator terminal 20 Schedule management apparatus 30 Communication network 201 CPU
202 Memory 203 Storage Device 204 Communication Interface 205 Input Device 206 Output Device 211 Reservable Time Acquisition Request Receiving Unit 212 Reservable Time List Generation Unit 213 Reservable Time Transmitting Unit 214 Reservation Request Receiving Unit 215 Reservation Information Registration Unit 216 Reservation Message Transmitting Unit 217 Reception information reception unit 218 Reception information registration unit 219 Reception message transmission unit 251 Setting information storage unit 252 Schedule database

Claims (9)

A method of managing service reservations,
An information processing apparatus comprising a CPU, a memory, and a reservation database that stores a user ID that identifies a user of the service in association with a reservation time,
With respect to the basic frame that is a period obtained by dividing the service provision period every predetermined time, the number of reservations within the frame that is the number of people that can be reserved per one basic frame is stored in the memory,
Accepting an input of a reservation request including the user ID and a desired reservation time,
A reservation destination basic frame that is the basic frame to which the reservation desired time included in the received reservation request belongs,
The number of reservations within the frame, which is the number of user IDs corresponding to the reservation time included in the specified reservation destination basic frame, is totaled from the reservation database,
When the total number of reserved people in the frame is less than the number of people that can be reserved in the frame, registering the reservation request time and the user ID included in the reservation request in association with the reservation database;
The reservation management method characterized by this. The reservation management method according to claim 1,
The information processing apparatus includes:
The number of people who can make a reservation at the same time is stored in the memory,
When the number of reserved people in the frame is less than the number of people that can be reserved in the frame, the number of simultaneous reservations is calculated by counting the number of user IDs corresponding to the desired reservation time from the reservation database. When the number of reservations is less than the number of people that can be reserved at the same time, registering the reservation request time and the user ID included in the reservation request in association with the reservation database;
The reservation management method characterized by this. The reservation management method according to claim 2,
The information processing apparatus includes:
Storing the number of first and second simultaneous reservations possible in the memory;
Calculating the reservation desired time from the start time of the reservation destination basic frame in a second predetermined time unit that is shorter than the first predetermined time, which is the predetermined time,
When the desired reservation time is an odd-numbered time, the first simultaneous reservation possible number is used as a comparison number. When the desired reservation time is an odd-numbered time, the second simultaneous reservation is possible. With the number of people as the comparison number,
Registering the reservation request time and the user ID included in the reservation request in association with the reservation database when the simultaneous reservation number is smaller than the comparison number of persons,
The reservation management method characterized by this. The reservation management method according to claim 1,
The information processing apparatus includes an unreserved database that stores the user ID that identifies the unreserved user in association with the scheduled service provision time,
For each of the basic slots, the number of assignable persons within the frame, which is the number of persons who can be assigned a schedule for an unreserved user, is stored in the memory.
Accepting a schedule allocation request for a non-reserved user, including the user ID and the desired time of service provision;
Specifying the basic frame to which the desired provision time included in the received allocation request belongs;
Aggregating the number of assigned users, which is the number of the user IDs corresponding to the scheduled provision time included in the identified basic frame, from the non-reservation database,
When the total allocated number of allocated persons is less than the allocatable number of persons, registering the desired provision time and the user ID included in the allocation request in the non-reservation database in association with each other;
The reservation management method characterized by this. The reservation management method according to claim 4,
The information processing apparatus is
The number of simultaneously assignable people, which is the number of non-reserved users who can be assigned at the same time, is stored in the memory,
When the allocated number is smaller than the allocatable number, the simultaneous allocation number is calculated by counting the number of user IDs corresponding to the desired provision time from the non-reservation database, and the calculated simultaneous allocation number is Registering in the non-reservation database in association with the desired provision time and the user ID included in the allocation request when the number is less than the simultaneously assignable number of people,
The reservation management method characterized by this. A method of managing service reservations,
An information processing apparatus comprising a CPU, a memory, and a reservation database that stores a user ID that identifies a user of the service in association with a reservation time,
With respect to a basic frame that is a period obtained by dividing the service provision period every first time, the in-frame reservation possible number of people that can be reserved per one basic frame is stored in the memory,
The number of people who can make a reservation at the same time is stored in the memory,
Receiving an input of a reservation request including the user ID;
For each of the basic frames, from the reservation database, calculate the number of reserved people in the frame counting the number of the user ID corresponding to the reservation time in the basic frame,
The basic frame in which the reserved number in the frame is less than the number of bookable in the frame,
For each registration time that is a second time unit time from the start time of the identified basic frame, the number of simultaneous reservations obtained by counting the number of user IDs corresponding to the registration time is calculated from the reservation database. ,
Specifying the registration time as the reservation time, wherein the simultaneous reservation number of people is less than the simultaneous reservation possible number of people,
Registering the user ID included in the reservation request in the reservation database in association with the specified reservation time;
A reservation management method comprising: The reservation management method according to claim 6,
The information processing apparatus includes:
Accept command input to get candidate time available for reservation,
In response to the command, for each of the basic frames, from the reservation database, calculate the number of reserved people in the frame that counts the number of the user ID corresponding to the reservation time in the basic frame,
Select the basic frame in which the number of reserved people in the frame is less than the number of bookable people in the frame,
For each of the selected basic frames, for each registration time in the basic frame, calculate the number of simultaneous reservations by counting the number of user IDs corresponding to the registration time from the reservation database,
Outputting the list of registration times when the number of simultaneous reservations is less than the number of simultaneous reservations possible;
The reservation management method characterized by this. A system for managing service reservations,
A reservation database for storing a user ID for identifying a user of the service in association with a reservation time;
With respect to a basic frame that is a period obtained by dividing the service provision period every predetermined time, an in-frame reservable number storage unit that stores a reservable number of persons that is a number of persons that can be reserved per one basic frame,
A reservation request input unit for receiving an input of a reservation request including the user ID and a desired reservation time;
A basic frame specifying unit for specifying a reservation destination basic frame that is the basic frame to which the desired reservation time included in the received reservation request belongs;
An in-frame reserved number counting unit for counting the number of reserved users in the frame, which is the number of the user IDs corresponding to the reservation time included in the specified reservation destination basic frame, from the reservation database;
A reservation information registering unit that registers the reservation request time and the user ID included in the reservation request in association with the reservation database when the total number of reserved persons in the frame is less than the number of people that can be reserved within the frame; ,
A reservation management system comprising: A program for managing service reservations,
An information processing apparatus comprising a CPU, a memory, and a reservation database that stores a user ID that identifies a user of the service in association with a reservation time,
Storing in the memory the number of people that can be reserved within a frame, which is the number of people that can be reserved per one basic frame, for a basic frame that is a period obtained by dividing the service provision period every predetermined time;
Receiving a reservation request including the user ID and a desired reservation time;
Specifying a reservation destination basic frame that is the basic frame to which the reservation desired time included in the received reservation request belongs;
A step of counting from the reservation database the number of reservations within the frame, which is the number of user IDs corresponding to the reservation time included in the specified reservation destination basic frame;
When the total number of reserved people in the frame is less than the number of people that can be reserved in the frame, the step of registering the reservation request time and the user ID included in the reservation request in association with the reservation database;
A program that executes

Images