JP5143195B2 - Service order determination apparatus and service order determination method - Google Patents

Description

  The present invention relates to an apparatus and a method for determining a service order when assigning users who are accepted on the same day between or around reserved users.

In order to shorten the waiting time of customers generated in hospitals, beauty salons, restaurants, etc., a method for optimizing the order of providing services to each customer has been proposed.
In Patent Document 1, when creating a service order and assigning a non-reserved day-to-day customer to a reservation free time, if the free time to be assigned is small, the total wait of each customer when forcibly assigning to each free time is disclosed. A service time allocation method and apparatus for calculating a time and allocating a customer to a free time that minimizes the total waiting time are disclosed. Patent Document 2 discloses a waiting time control system and method for creating an order so that parallel processing can be performed when there is a procedure in which service processing procedures are common among customers when determining the service order and parallel processing is possible. It is disclosed.

Japanese Patent No. 4143110 JP 2010-79430 A

The techniques of Patent Documents 1 and 2 determine the service order so that the overall waiting time is minimized. At this time, a predetermined weighting function is used for the waiting time, the waiting time is increased or decreased, and the priority when the service order is determined is adjusted. For example, if the waiting time of reservation customers or customers in the early order of reception, which was given the highest priority in the initial order, increases, the priority is given to those customers by giving weight to the increase. . However, although this weighting function greatly affects the creation of an optimal service order, the weighting function and its coefficient are determined by trial and error.
In this case, the waiting time of the reservation customer may be longer than the waiting time of the customer on the day reception, and unfairness is generated for such a customer. On the other hand, even if the customer is on the reception day, dissatisfaction occurs if the waiting time is too long.

  The present invention has been made in view of the above problems, and its main object is to determine the service order so that unfairness does not occur among service users.

In order to solve the above problems, the present invention provides reservation data including a reservation time of the day, a required time of service, a start time and an end time for each of one or more reservation users who are users who have reserved a service. This is a device (service order determination device) that determines the service order that is stored and assigned to any one of the users between and before and after the reservation user. Means for acquiring the reception time of the user on the day and the time required for the service, and the start time of the user on the day as the start time of the user on the day, for each service order, Means for setting the time, adding the required time to the set start time to calculate the end time, and for each service order, the reservation user after the user on the day The start time is set to the later of the reservation time of the reservation user and the end time of the previous user, and the end time is calculated by adding the required time to the set start time. Means for subtracting the reception time from the start time of the user on the day for each service order, and calculating a waiting time for the user on the day, and the reserved user for each service order. Means for subtracting the reservation time from the start time to calculate the waiting time of the reservation user, and for each service order, a standard deviation of the waiting time of the user of the day and the reservation user is calculated. means, wherein as the day user of the waiting time target greater service order than latency of the reservation user, and means for selecting the service order in which the standard deviation of the waiting time is minimized, the Characterized in that it obtain.
According to this configuration, by selecting the service order in which the standard deviation of the waiting time of each user is minimized among the service orders in which the users are assigned on the same day before or after one or more reservation users, Since there is less variation in waiting time among users, it is possible to eliminate unfairness among users.

In addition, because the waiting time of this day user to the candidates larger than the waiting time of all reserved users, in particular, it is possible to achieve the elimination of unfairness to the reservation user of the day user.

In the service order determination apparatus of the present invention, the service order selection unit may be configured such that the waiting time of the user on the day is greater than the time obtained by multiplying the waiting time of the reservation user by a weighting factor greater than 1. It is good also as targeting.
According to this configuration, the service order in which the waiting time of the reservation user is considerably shorter than the waiting time of the user on the same day by weighting the waiting time of the reservation user without changing the waiting time of the user on the day. Therefore, it is possible to further eliminate the feeling of unfairness of the reservation user for the user on the day.

Further, in the service order determination apparatus according to the present invention, the means for calculating the standard deviation of the waiting time of the user of the day and the reservation user multiplied the weighting coefficient larger than 1 by the waiting time of the reservation user. It is good also as using.
According to this configuration, after calculating the standard deviation of the waiting time, the service order that minimizes the standard deviation is selected. Therefore, the order in which the variation in the waiting time of the user on the day and the weighted waiting time of the reservation user is the smallest is selected. Will be decided. According to this, the difference between the waiting time of the user on the day (same as the actual waiting time) and the weighted waiting time of the reservation user (greater than the actual waiting time) is small, and the actual waiting time With regard to the above, since the order of services in which the reservation user becomes smaller than the user on the day is determined, it is possible to further eliminate the unfairness of the reservation user to the user on the day.

  The present invention includes a service order determination method. In addition, the problems disclosed by the present application and the solutions thereof will be clarified by the description of the mode for carrying out the invention and the drawings.

  ADVANTAGE OF THE INVENTION According to this invention, a service order can be determined so that an unfair feeling may not arise among the users of a service.

It is a figure which shows the hardware constitutions of the service order determination apparatus 1. It is a figure which shows the structure of patient database 15A memorize | stored in the memory | storage part 15 of the service order determination apparatus 1. FIG. It is a figure which shows the structure of the waiting patient table 15B memorize | stored in the memory | storage part 15 of the service order determination apparatus 1. FIG. It is a flowchart which shows the process which the service order determination apparatus 1 produces the patient database 15A on the day of a medical examination. It is a flowchart which shows the process for the service order determination apparatus 1 to shorten a patient's waiting time. It is a flowchart (1/2) which shows the process in which the service order determination apparatus 1 calculates the optimal examination order. It is a flowchart (2/2) which shows the process in which the service order determination apparatus 1 calculates the optimal examination order. It is a figure which shows the specific example of waiting patient table 15B.

  Hereinafter, embodiments for carrying out the present invention will be described with reference to the drawings. The service order determination apparatus according to the embodiment of the present invention accepts the day of reception among the assigned positions when allocating the service time of the user of the day reception during or around the service time of the reserved user. The position where the waiting time of the user is larger than the waiting time of all the reserved users is extracted, and the position where the standard deviation of the waiting time of each user is minimized is identified from the extracted positions. The service time of the reception user on the day is assigned to the position. According to this, it is possible to reduce unfairness among users. In the following, as a service to be provided, a patient examination in a hospital will be described as an example.

≪Device configuration and overview≫
FIG. 1 is a diagram illustrating a hardware configuration of the service order determination apparatus 1. The service order determination apparatus 1 includes a communication unit 11, a display unit 12, an input unit 13, a processing unit 14, and a storage unit 15, and each unit is connected so that data can be transmitted and received via a bus 16. The communication unit 11 is a part that performs IP (Internet Protocol) communication and the like with other devices via a network, and is realized by, for example, a NIC (Network Interface Card) or the like. The display unit 12 is a part that displays data according to an instruction from the processing unit 14, and is realized by, for example, a liquid crystal display (LCD). The input unit 13 is a part for an operator to input data (for example, data for designating an examination room when confirming a patient's examination order), and is realized by, for example, a keyboard or a mouse. The processing unit 14 exchanges data between the respective units via a predetermined memory and controls the entire service order determination apparatus 1. A CPU (Central Processing Unit) is stored in the predetermined memory. This is realized by executing the program. The storage unit 15 stores data from the processing unit 14 and reads the stored data, and is realized by a nonvolatile storage device such as an HDD (Hard Disk Drive) or an SSD (Solid State Drive). The The service order determination device 1 is installed in a hospital office or the like, but may be a stand-alone device (PC (Personal Computer) or the like), or a device capable of communicating with a plurality of terminals via a network. (Such as a server).

<< Data structure >>
2 and 3 are diagrams showing the structure of data stored in the storage unit 15 of the service order determination apparatus 1. FIG. FIG. 2 shows the configuration of the patient database 15A. The patient database 15A is a collection of schedule data and results data related to patient examinations for each examination room and examination day in the hospital's clinical department. Patient ID 15A1, appointment time 15A2, reception time 15A3, examination time 15A4, start It consists of records for each patient including time 15A5, end time 15A6, and waiting time 15A7. The patient ID 15A1 is an ID unique to a patient who receives (or has received) an examination on the examination day in the examination room. In the case where the reservation time 15A2 is a patient who has been reserved up to the previous day, it indicates the start time of the diagnosis reserved by the patient. The reception time 15A3 indicates the time when the patient was received in the case of a patient who visited the hospital on the day without reservation. The examination time 15A4 indicates the predicted value or actual value of the time taken for the patient's examination. The start time 15A5 indicates the predicted value or actual value of the patient's diagnosis start time. The end time 15A6 indicates a predicted value or actual value of the patient's examination end time, and is calculated and set by adding the examination time 15A4 to the start time 15A5. The waiting time 15A7 indicates the time when the patient is scheduled to wait for the examination (or actually waited). In the case of a reserved patient, the waiting time 15A7 is calculated and set by [start time 15A5-reserved time 15A2]. Calculated and set by [start time 15A5-reception time 15A3]. Note that the patient database 15A is not limited to each examination room, but may be a database in which patient schedule data and performance data are accumulated for each doctor in charge or medical facility.

  FIG. 3 shows the configuration of the waiting patient table 15B. The waiting patient table 15B is obtained by extracting schedule data of waiting patients whose examination order is fixed from the patient database 15A. The patient ID 15B1, the reservation time 15B2, the reception time 15B3, the examination time 15B4, the start time 15B5, the end time 15B6, It consists of records for each patient including a waiting time 15B7, a waiting time 15B8 and a weighting waiting time 15B9. The patient IDs 15B1 to 15B7 are the same as the patient IDs 15A1 to 15A7 of the patient database 15A. The waiting time 15B8 is obtained by converting the waiting time 15B7, which is an hour / minute unit, into a minute unit. The weighting waiting time 15B9 is obtained by multiplying the waiting time 15B8 by a weighting coefficient. For example, the weighting coefficient for a reserved patient is 1.5, and the weighting coefficient for a reception patient on the day is 1. Thereby, the waiting time of the patient can be compared and evaluated so that the waiting time of the actually reserved patient becomes considerably smaller than the waiting time of the receiving patient on the day.

≪Device processing≫
FIGS. 4 to 6 (FIGS. 6A and 6B) are flowcharts showing processing of the service order determination apparatus 1. In this process, in the service order determination apparatus 1, the processing unit 14 creates the patient database 15A while referring to and updating the data in the storage unit 15, creates the waiting patient table 15B from the patient database 15A, and waits for the waiting patient table. 15B is used to determine the optimal service order for each patient.

  FIG. 4 shows a process of creating the patient database 15A on the date of the examination date. First, the service order determination apparatus 1 performs batch processing on the day before the examination date (S401). Specifically, first, reservation data including a patient ID and a reservation time is captured. The appointment data is data related to the appointment appointment on the day of the examination date received by the start time of the batch processing, and the data stored in another device may be received by the communication unit 11 via the network, Data stored in the unit 15 may be read into the work memory. Next, the examination time for each reserved patient is predicted and set in the work memory. As a method for predicting the examination time, a statistical method for calculating an average value or a mode value of past performance data may be used. [0072] of Japanese Patent No. 4194573 and paragraph [4] of Japanese Patent No. 4217899 [0080] The method disclosed in FIG.

  Then, the records including the patient ID, the reservation time, and the examination time are rearranged in order from the earliest reservation time and the smallest examination time. Subsequently, the start time, end time, and waiting time for each patient are specified based on the reservation time, the examination time, and the order of each record, and added to each record. At that time, the start time is determined by the reservation time or the end time of the previous patient. The end time is calculated by adding the examination time to the start time. The waiting time is calculated by subtracting the reservation time from the start time. Furthermore, each record in which the patient ID, appointment time, examination time, start time, end time, and waiting time are determined is stored in the storage unit 15 as an addition to the patient database 15A. By the above batch processing, the schedule data of the patient database 15A is set from the reservation data.

  Next, when the examination date is reached, the service order determination device 1 monitors an event that occurs on that day. Specifically, the processing of S403 and S404 is repeated until the monitoring is completed while leaving a predetermined time interval (S402 to S405). First, it is confirmed whether or not the event of the day has occurred (S403). Events include reception on the day, start of diagnosis, and end of diagnosis. When an event occurs, event data including a patient ID and an event time is received by the communication unit 11 or acquired by the input unit 13. . If the event of the day has not occurred (NO in S403), the confirmation is repeated (S403).

  If the event of the day has occurred (YES in S403), the service order determination apparatus 1 acquires the event data, and writes the corresponding patient record or data to be updated in the patient database 15A of the storage unit 15 ( S404). In the case of reception on the day, a record including a patient ID 15A1 and a reception time 15A3 of a newly received patient is newly added. In the case of starting the examination, the actual values of the start time 15A5 and the waiting time 15A7 are set in the record of the corresponding patient ID 15A1. When the examination ends, the actual value of the end time 15A6 and the examination time 15A4 is set in the record of the corresponding patient ID 15A1.

  FIG. 5 shows a process for reducing patient waiting time. This processing is performed on the day of the examination while the examination work is being performed for each examination room. The service order determination apparatus 1 first selects an examination room (S501). And the process of S503-S507 is repeated until the end of the examination work for the examination room, with a predetermined time interval (S502-S508).

  First, the service order determination apparatus 1 extracts a record of waiting patients whose examination order has been confirmed from the patient database 15A of the storage unit 15, and creates a waiting patient table 15B (S503). The waiting patients whose examination order has been confirmed are reserved patients up to the previous day and patients whose examination order has been confirmed in S507. In the first process, a waiting patient table 15 </ b> B is newly created and stored in the storage unit 15. In the second and subsequent processes, when there is a waiting patient for which a new examination order has been confirmed at that time, the record of the patient is added to the waiting patient table 15 </ b> B of the storage unit 15. Next, it is determined whether or not there is a new reception patient that is not reserved (S504). When there is a new reception patient, a record in which only the patient ID 15A1 and the reception time 15A3 are valid is stored in the patient database 15A. If there is no new reception patient (NO in S504), the processing in S505 to S507 is skipped.

  If there is a new reception patient (YES in S504), the service order determination apparatus 1 predicts the consultation time of the new reception patient, and sets the predicted consultation time in the work memory together with the patient ID and the reception time (S505). As a method for predicting the examination time, a statistical method for calculating an average value or a mode value of past performance data may be used. [0072] of Japanese Patent No. 4194573 and paragraph [4] of Japanese Patent No. 4217899 [0080] The method disclosed in FIG. Then, using the waiting patient table 15B, among the waiting patients whose examination order has been determined, which subroutine should be assigned a new reception patient, that is, a subroutine for calculating the optimum examination order is called (S506). Details of the subroutine processing will be described later. Based on the calculation of the optimal examination order, the examination order of the newly received patient is determined (S507). At this time, the data of the confirmed examination order may be displayed on the display unit 12 or may be transmitted to another device by the communication unit 11.

  In the above processing, an examination room is selected and a new reception patient is monitored for each examination room. However, when a patient related to each examination room is newly received, S505 related to the examination room is selected. The processing task in S507 may be generated and operated.

  6A and 6B show the calculation process of the optimal examination order. This process is a process of a subroutine called in S506 of FIG. 5, and determines a position where a new reception patient is to be placed on the waiting patient table 15B. Hereinafter, a description will be given with reference to a specific example of the waiting patient table 15B in FIGS.

  Referring to FIG. 6A, first, the service order determination apparatus 1 counts the number of patients in the waiting patient table 15B and substitutes it into a variable m (S601). According to the example of FIG. 3, 5 is assigned to the variable m. Note that the variable m is secured on the work memory of the service order determination apparatus 1. Next, the processing of S603 to S611 is repeated while changing the variable j from 0 to m (S602 to S612).

  First, the service order determination apparatus 1 arranges a record of a newly received patient between the jth and j + 1th records in the waiting patient table 15B, and the entire arrangement at that time is set as an order pattern j (S603). Next, the start time 15B5 and end time 15B6 of each patient in the waiting patient table 15B are calculated and set (S604).

  In the case of j = 0, that is, taking FIG. 7A as an example, when the record of the newly received patient A is placed at the head of the waiting patient table 15B, the start time of the newly received patient A is At time 9:00, the end time of the newly received patient A becomes time 9:15, which is obtained by adding the examination time 0:15 to the start time 9:00. The start time of the next patient 1 is the earlier time (late or the same) time 9:15 of the reservation time 9:00 of the patient 1 and the end time 9:15 of the previous patient A, The end time of the patient 1 is 9:25 obtained by adding the examination time 0:10 to the start time 9:15 (hereinafter the same).

  In the case of j = 2, that is, taking FIG. 7 (c) as an example, when the record of the newly received patient A is placed between the patients 2 and 3 in the waiting patient table 15B, The start time becomes the end time 9:30 of the patient 2, and the end time of the newly received patient A becomes the time 9:45 obtained by adding the examination time 0:15 to the start time 9:30. The start time of the next patient 3 is the earlier (late or same) time 9:45 of the reservation time 9:30 of the patient 3 and the end time 9:45 of the previous patient A, The end time of the patient 3 becomes time 9:59 obtained by adding the examination time 0:14 to the start time 9:45 (hereinafter the same).

  In the case of j = 5, that is, referring to FIG. 7 (f) as an example, when the record of the newly received patient A is placed at the end of the waiting patient table 15B, the start time of the newly received patient A is the last The end time of the reserved patient of (the previous one) becomes 10:22, and the end time of the newly received patient becomes time 10:37 obtained by adding the examination time 0:15 to the start time 10:22.

  Subsequently, the service order determination apparatus 1 calculates and sets the waiting time 15B7 of each patient in the waiting patient table 15B (S605). The waiting time of the reserved patient is a time obtained by subtracting the reservation time from the start time. The waiting time of the patient who received the day is the time obtained by subtracting the reception time from the start time. At this time, the waiting time 15B7 in units of hours and minutes is converted into a waiting time 15B8 in minutes. Then, the standard deviation STD of the waiting time 15B8 of each patient is calculated and set in the work memory (S606).

  Furthermore, the service order determination apparatus 1 secures the flag F in the work memory, and substitutes 0 for the flag F (S607). The flag F is set for each order pattern j, and 0 is substituted when the order pattern j is set as an optimal order candidate, and 1 is set when the order pattern j is excluded from the optimal order candidates. . Next, the determination process of S609 is repeated while changing the variable i from 1 to m (S608 to S610). The variable i is secured on the work memory of the service order determination device 1. In the determination process, it is confirmed whether or not the waiting time of the newly received patient is smaller than the waiting time of the i-th patient (the reserved patient and the previously received patient) (S609). If not smaller (NO in S609), the next patient is confirmed (S609). If it is smaller (YES in S609), 1 is substituted into the flag F (S611), and the process related to the next arrangement (order pattern) is performed (S603). Further, if the waiting time of the newly received patient is not smaller than the waiting time of all the patients (when the determination in S609 is NO each time), the flag F remains 0 as substituted in S607.

  According to this, if the waiting time of the newly received patient is not smaller than the waiting time of all the patients, the order pattern j becomes a candidate for the optimum order. In other words, if the waiting time of the newly received patient is smaller than the waiting time of at least one patient, the order pattern j is excluded from the candidates for the optimum order.

  As described above, the standard deviation STD and the flag F of the waiting time of each patient are set for each order pattern. In the example of FIG. 7, the order pattern of (c), (d), (e), and (f) in which the waiting time of the patient A is larger than any waiting time of the patients 1 to 5 is the candidate for the optimum order, and the flag F is set to 0.

  Subsequently, referring to FIG. 6B, the service order determination apparatus 1 stores a large numerical value (for example, a numerical value such as 10,000) that is not assumed as the standard deviation STD in the storage variable STDmin having the minimum value, and stores the optimal order pattern. The variable P is secured (S613). And the process of S615-S617 is repeated, changing the variable j from 0 to m (S614-S618). First, it is determined whether or not the flag F of the order pattern j is 0 (S615). If the flag F is not 0, that is, 1 (NO in S615), the order pattern j is not a candidate, so the processing of S616 and S617 is skipped and the determination process for the next order pattern j is performed (S615). .

  If the flag F is 0 (YES in S615), it is determined whether or not the standard deviation STD in the order pattern j is smaller than the minimum value STDmin (S616). If smaller (YES in S616), the standard deviation STD in the order pattern j is assigned to the minimum value STDmin, and the order pattern j is assigned to the optimum order pattern P (S617). Note that since a large numerical value is assigned to STDmin in advance in S613, the determination in S616 performed first is always YES, and the minimum value STDmin is updated. If it is not smaller (NO in S616), the process of S617 is skipped and the determination process for the next order pattern j is performed (S615).

  When the loop processing of S614 to S618 is completed, among the order patterns j in which the flag F is 0 (that is, the waiting time of the newly received patient is smaller than the waiting time of all the patients), the one having the smallest standard deviation STD is optimal. Since it is substituted for the order pattern P, the order in which the newly received patients are arranged between the Pth and P + 1th positions in the waiting patient table 15B becomes the optimal examination order (S619). In the example of FIG. 7, among the candidates (c), (d), (e), and (f), the order pattern (c) having the smallest standard deviation of the waiting time is selected as the optimum order.

  In S605, the waiting time 15B8 of each patient is calculated. In S606, the standard deviation of the waiting time 15B8 is calculated. The deviation may be calculated.

  In this case, in the example of FIG. 7, the weighting waiting time of patient A (coefficient is 1) is larger than any of the weighting waiting times (coefficient is 1.5) of patients 1 to 5 (d), (e), and (f ) Becomes an optimal order candidate, and the flag F is set to 0. According to this, since the weighted coefficient of the reserved patients 1 to 5 is larger than that of the patient A who receives the day, the order pattern in which the waiting time of each reserved patient is considerably smaller than the waiting time of the patient who receives the day is selected. To be evaluated.

  Then, since the standard deviation of the weighting waiting time 15B9 is compared and the order pattern having the smallest standard deviation is selected, the order pattern of (d) is selected as the optimum order in the example of FIG. When outputting the waiting time of each patient in the optimal order to the doctor or patient, the waiting time 15B7 or 15B8 is output instead of the weighting waiting time 15B9.

  In the above embodiment, in order to cause each unit in the service order determination apparatus 1 shown in FIG. 1 to function, a program executed by the processing unit 14 is recorded on a computer-readable recording medium, and the recorded program is stored in the computer. It is assumed that the service order determination apparatus 1 according to the embodiment of the present invention is realized by being read and executed by. In this case, the program may be provided to the computer via a network such as the Internet, or a semiconductor chip or the like in which the program is written may be incorporated in the computer.

  According to the embodiment of the present invention described above, when assigning a new reception patient to the waiting patient table 15B in the service order determination device 1, according to the reservation time, reception time, and examination time of each patient, The optimal service order can be determined while reducing patient waiting time. In particular, since the service order that minimizes the standard deviation of the waiting time is selected, variation in the waiting time is reduced, and unfairness can be prevented from occurring for each patient. Secondly, it is possible to avoid unfairness in reserved patients because the waiting time of newly accepted patients is not less than (greater than or equal to) the waiting time of all waiting patients. it can. Then, when comparing the waiting time of the waiting patient with the new receiving patient, a service order in which the waiting time of the reserved patient is considerably shorter than that of the newly receiving patient is selected by weighting the waiting time of the waiting patient. Therefore, the unfair feeling of the reserved patient can be solved.

<< Other embodiments >>
As mentioned above, although the form for implementing this invention was demonstrated, the said embodiment is for making an understanding of this invention easy, and is not for limiting and interpreting this invention. The present invention can be changed and improved without departing from the gist thereof, and equivalents thereof are also included in the present invention. For example, the following embodiments can be considered.
(1) In the above embodiment, the example in which the service order determination device 1 is applied to patient examination by a doctor in each examination room of a hospital has been described. However, the present invention is not limited to this, and other service providing facilities such as beauty You may apply the service order determination apparatus 1 about the service in a hospital, a restaurant, etc. In the case of a hospital, the place where the service is provided is an examination room, but in the case of a beauty salon, it is a seat, and in the case of a restaurant, a table or a private room.
(2) In the flowchart of FIG. 5, when extracting waiting patients whose examination order has been confirmed in S503, not only the reserved patients up to the previous day and patients whose examination order has been confirmed in S507, for example, in the morning of the day It is also possible to target patients who are scheduled for an afternoon visit.
(3) In the above embodiment, the weighting function is an example of a linear function so that the waiting time 15B8 of the waiting patient table 15B is multiplied by a constant and the weighting waiting time 15B9 is calculated. For example, a quadratic function or an exponential function may be used.

1 Service Order Determining Device 14 Processing Unit 15 Storage Unit 15B Waiting Patient Table (Reservation Data)
15B1 Patient ID (user)
15B2 Reservation time 15B3 Reception time 15B4 Examination time (required time)
15B5 Start time 15B6 End time 15B7 Wait time 15B8 Wait time 15B9 Weighted wait time

Claims (6)

Stores reservation data including the reservation time of the day, the time required for the service, the start time and the end time for each of the one or more reservation users who have reserved the service, and the user who received the reservation without reservation A device for determining a service order in which a certain day user is assigned to any one of the reservation user and before and after,
Means for obtaining the reception time of the user on the day and the time required for the service;
For each service order, the reception time or the previous reservation user's end time is set as the start time of the user on the day, and the end time is added to the set start time and the end time is set. Means for calculating time;
For each service order, as the start time of the reservation user after the user on the day, the later time of the reservation time of the reservation user and the end time of the previous user is set. Means for calculating the end time by adding the required time to the set start time;
Means for subtracting the reception time from the start time of the user on the day for each service order to calculate the waiting time of the user on the day;
Means for calculating the waiting time of the reservation user by subtracting the reservation time from the start time of the reservation user for each service order;
Means for calculating a standard deviation of waiting time of the user on the day and the reservation user for each service order;
Means for selecting the service order that minimizes the standard deviation of the waiting time for a service order in which the waiting time of the user on the day is larger than the waiting time of the reservation user ;
A service order determination apparatus comprising: The service order determination device according to claim 1 ,
The means for selecting the service order is:
The service order determination device characterized in that the waiting time of the user on the day is greater than the time obtained by multiplying the waiting time of the reservation user by a weighting factor larger than 1. The service order determination device according to claim 2 ,
Means for calculating the standard deviation of the waiting time of the user on the day and the reservation user,
The service order determination apparatus characterized by using a time obtained by multiplying the waiting time of the reservation user by a weighting coefficient larger than 1. Use received on the day without reservation by a computer storing reservation data including the reservation time of the day, the time required for the service, the start time and the end time for each of one or more reservation users who have reserved the service A method of determining a service order assigned to any one of the reservation user among before and after the reservation user,
The computer
Obtaining the reception time of the user on the day and the time required for the service;
For each service order, the reception time or the previous reservation user's end time is set as the start time of the user on the day, and the end time is added to the set start time and the end time is set. Calculating a time;
For each service order, as the start time of the reservation user after the user on the day, the later time of the reservation time of the reservation user and the end time of the previous user is set. Adding the required time to the set start time to calculate the end time;
Subtracting the reception time from the start time of the user on the day for each service order to calculate the waiting time of the user on the day;
Subtracting the reservation time from the start time of the reservation user for each service order to calculate the waiting time of the reservation user;
Calculating a standard deviation of the waiting time of the user on the day and the reservation user for each service order; and
Selecting the service order that minimizes the standard deviation of the waiting time for a service order in which the waiting time of the user on the day is greater than the waiting time of the reservation user ;
The service order determination method characterized by performing. The service order determination method according to claim 4 ,
The step of selecting the service order includes:
A service order determination method, wherein the waiting time of the user on the day is greater than the time obtained by multiplying the waiting time of the reservation user by a weighting factor greater than 1. The service order determination method according to claim 5 ,
In the step of calculating the standard deviation of the waiting time of the user on the day and the reservation user,
A service order determination method characterized by using a time obtained by multiplying the waiting time of the reservation user by a weighting factor larger than 1.

Images