JP2019117515A - Allocation apparatus, allocation program, and computer readable recording medium storing the program - Google Patents

Abstract

To provide an allocation apparatus, an allocation program, and a computer readable recording medium storing the program, capable of dealing with a customer more efficiently.SOLUTION: An allocation apparatus 1 includes an allocation part 13 that allocates a plurality of requested tasks to a plurality of persons in charge. The allocation part 13 includes: an identifying part 13a that identifies a person in charge with the lowest operation efficiency from among the plurality of persons in charge according to a predetermined condition; and a ratio calculation part 13b that calculates a completion time ratio for each type of the requested tasks of the other persons in charge excluding the identified person in charge among the plurality of persons in charge with respect to the identified person in charge. The requested task having the largest ratio is preferentially allocated to the identified person in charge, and the requested tasks are allocated to the plurality of persons in charge so as to equalize the total time for the plurality of persons in charge to carry out the requested tasks.SELECTED DRAWING: Figure 4

Description

  The present invention relates to an allocation device, an allocation program, and a computer readable recording medium storing the program.

  Conventionally, there has been proposed a CTI (Computer Telephony Integration) system for connecting a customer's telephone to an operator in a waiting state (vacant state) when there is a product order from the customer by telephone. (See, for example, Patent Document 1).

  In addition, there has been proposed an allocation device which allocates to the clerk a task that should be performed by the person in charge of the window when the window is congested in the window operation. This allocation device obtains candidates for the clerk responsible for the procedure in consideration of the degree of contribution of the window work and the importance of the schedule of the clerk in charge (see, for example, Patent Document 2).

JP 2002-84372 A JP, 2010-218324, A

  However, in the CTI system described in Patent Document 1, only a call from a customer is connected to an operator in a standby state, and there is no operator in a standby state and a customer who waits after making a call. It is not considered at all to respond efficiently. In addition, although the allocation device described in Patent Document 2 can contribute to the elimination of the congestion at the window, it is not considered to respond efficiently only by the window clerk who performs the window operation.

  As described above, conventionally, there is still room for improvement in terms of efficiently dealing with customers by only the person in charge who should perform the original work.

  The present invention has been made to solve such conventional problems, and an object of the present invention is to store an allocation device, an allocation program, and a program that can respond to customers more efficiently. A computer readable recording medium is provided.

  The allocation apparatus according to the present invention is an allocation apparatus for allocating a client's requested work to a plurality of persons in charge, wherein the completion time required for each of the plurality of persons in charge to complete the requested work is the requested operation. Storage means stored for each type of storage, and allocation means for allocating a plurality of the requested tasks to the plurality of persons in charge, the allocation means based on the storage content stored by the storage means The person in charge of the person in charge is identified according to a predetermined condition and the person in charge with the lowest work efficiency is identified, and the identified person in charge is the request task of the person in charge other than the identified person in charge among the plurality of persons in charge. The ratio of the completion time for each type is calculated, and the total time in which the plurality of persons in charge perform the requested work is equalized preferentially to the requested person in charge that specifies the requested work with the largest ratio. See Characterized by allocating the requested services to the plurality of representative.

  Further, the allocation apparatus according to the present invention is an allocation apparatus for allocating a client-requested corresponding service to a plurality of persons in charge, and a completion time required for each of the plurality of persons in charge to complete the request operation. And storing for each type of the requested work, and for the person in charge with the lowest work efficiency specified according to the predetermined condition from the plurality of persons in charge, other than the identified persons among the plurality of persons in charge A storage means for storing the ratio of the completion time for each type of the requested work of the person in charge, and the requested work with the largest ratio stored by the storage means are given priority to the specified person in charge and the person in charge. It may be characterized by comprising: allocation means for allocating the requested work to the plurality of persons in charge so that the total time in which the plurality of persons in charge perform the requested work may be equal.

  Further, the allocation program according to the present invention is an allocation program for allocating a client-requested corresponding service to a plurality of persons in charge, and a computer is required to complete each of the plurality of persons in charge. Based on the stored contents stored by the storage means stored for each type of the requested work, the person in charge with the lowest work efficiency is identified from the plurality of persons in accordance with a predetermined condition, and the identified person And a person in charge of calculating the ratio of the completion time for each type of the requested work of the other persons except the identified one among the plurality of persons in charge, and determining the requested work having the largest ratio. The assignment function is assigned to the plurality of persons in charge so that the total time in which the plurality of persons in charge are required to carry out the request work is equalized preferentially to the person in charge And wherein the Rukoto.

  Further, the allocation program according to the present invention is an allocation program for allocating the requested work corresponding to the customer to a plurality of persons in charge, and each of the plurality of persons in charge is required for the computer to complete the requested work. The completion time is stored for each type of the requested work, and the identified one among the plurality of persons for the person with the lowest work efficiency specified according to the predetermined condition from the plurality of persons in charge The plurality of requested tasks that have the largest ratio stored by the storage unit storing the ratio of the completion time for each type of the requested task except for the other assigned persons are prioritized to the identified assigned person. It is characterized in that an allocation function is implemented to allocate the requested work to the plurality of persons so that the total time for the persons in charge may perform the requested work to be equal. It may be.

  Further, a computer readable recording medium of the present invention is a computer readable recording medium storing an allocation program for allocating a client corresponding work to a plurality of persons in charge, wherein the plurality of persons in charge of the computer Based on the completion time for each type of the requested work required to complete the requested work, the person in charge with the lowest work efficiency is identified from the plurality of persons in accordance with a predetermined condition, and the identified person in charge Calculating the ratio of the completion time for each type of the requested work of the other responsible persons excluding the identified one among the plurality of persons in charge, and specifying the requested work with the largest ratio Allocation function for allocating the requested work to the plurality of persons in charge so that the total time for the plurality of persons in charge to perform the requested work becomes equal to the persons in charge preferentially Stores an allocation program for implementing.

  Further, a computer readable recording medium of the present invention is a computer readable recording medium storing an allocation program for allocating a client corresponding work to a plurality of persons in charge, wherein the plurality of persons in charge of the computer The person in charge identified among the plurality of persons in charge with the person in charge with the lowest work efficiency specified based on the completion time for each type of the requested work required to complete the requested work The ratio of the said completion time for each type of said request work of the other person in charge excluding is the total of the plurality of persons in charge who carry out the request work given priority to the person in charge who specified the request work with the largest An allocation program for realizing an allocation function of allocating the requested work to the plurality of persons in charge may be stored so as to equalize the time.

  According to these, the request work with the highest ratio of the completion time ratio of each person in charge to the person in charge with the person with the lowest work efficiency is preferentially allocated to the person in charge with the lowest work efficiency. Here, the ratio of the completion time of the person in charge with the lowest task efficiency for each requested task indicates the task efficiency of the other person in charge based on the person in charge with the lowest task efficiency. Therefore, it can be said that the requested work with the largest ratio is the requested work with a small difference between the person in charge with the lowest work efficiency and the other person in charge. And, by preferentially allocating such requested work to the person in charge with the lowest work efficiency, even the person in charge with the lowest work efficiency can perform the requested work relatively efficiently. Therefore, since the person in charge with low business efficiency can be raised, it is possible to respond to customers more efficiently.

  Further, in the present invention, the storage means stores waiting time data according to the expectation of the customer of the requested work, and the allocating means responds to the expectation stored by the storage means of the customer's waiting time. Preferably, the requested work is assigned to the plurality of persons in charge so that the waiting time is not exceeded.

  According to this, since the request work is allocated to a plurality of persons in charge so that the waiting time of the customer does not exceed the waiting time according to the expectation, the customer can be dealt with without dissatisfaction.

  Further, in the present invention, the method further comprises learning means for learning completion time required for the plurality of persons in charge to complete the requested work for each type of the requested work, and the storage means stores the completed Preferably, the time is sequentially updated to the completion time learned by the learning means.

  According to this, since the completion time is learned and sequentially updated to the learned completion time, when the technical ability of each person in charge is increased and the completion time is shortened, this can be updated, Allows allocation of requested work appropriately.

  Further, in the present invention, the storage means stores the priority of the requested work, and the allocation means processes the requested work with high priority stored by the storage means first. It is preferable to allocate the requested work to the plurality of persons in charge.

  According to this, in order to allocate the request work to a plurality of persons in charge so that the higher priority work is processed first, for example, the time for which the severity is high and waiting in a hospital or clinic may be extremely short. Allocations can be made so that desirable patients can receive a medical examination early, and allocation of requested work can be performed more appropriately.

  The above allocation apparatus is a concept including not only one realized by one computer but also one constituted by connecting a plurality of computers via a network. In the above, “allocate preferentially” refers to the case where the number of requested tasks with the highest completion time ratio is compared between the person in charge identified as the lowest in business efficiency and the other person in charge: The highest number of personnel identified as having the lowest business efficiency.

  In the above, “the ratio is the largest” is not limited to the ratio itself, but may be an average value for each requested service of the ratio, or may be another value obtained from the ratio. In particular, when the inverse number of the ratio or the average value is adopted, it is needless to say that "the ratio is the largest" becomes "the inverse number of the ratio or the average value".

  Furthermore, in the above, "to be even" means that the difference in total time between the person in charge having the largest total time and the person in charge having the smallest total time falls within a predetermined time. That is, when the requested work is allocated without considering the total time, the allocation pattern extends in a plurality, but “to be even” means the maximum value of the total time among the plurality of allocation patterns. The difference between the and the minimum value falls within a predetermined time.

  According to the present invention, it is possible to provide an allocation device, an allocation program, and a computer readable recording medium storing the program, which can more efficiently respond to customers.

It is an outline view showing an allocation device concerning an embodiment of the present invention. It is a hardware block diagram which shows the allocation apparatus which concerns on this embodiment. It is a chart showing memory contents. It is a functional block diagram which shows the allocation apparatus which concerns on this embodiment. It is a first flowchart showing the operation of the allocation device according to the present embodiment. It is a 2nd flow chart which shows operation of an allocation device concerning this embodiment. It is a 1st figure which shows the mode of allocation of request work, and shows the mode of allocation when request work generate | occur | produces before work start. It is a 2nd figure which shows the mode of allocation of request work, and shows the mode of allocation when request work generate | occur | produces after work start. It is a 3rd figure which shows the mode of allocation of request work, and shows the mode of allocation when request work generate | occur | produces after work start. It is a 4th figure which shows the mode of allocation of request work, and shows the mode of allocation when request work generate | occur | produces after work start, and shows the mode of allocation which considered the expectation value especially.

  Hereinafter, preferred embodiments of the present invention will be described based on the drawings, but the present invention is not limited to the embodiments. In particular, as a method of allocating the requested work to a plurality of persons in charge so as to equalize the total time preferentially, the invention is not limited to the method described below, and each known method may be used. .

  FIG. 1 is an external view showing an allocation device according to an embodiment of the present invention. The allocation apparatus 1 shown in FIG. 1 is realized, for example, as one function of a personal computer, and efficiently allocates a request from a customer to a plurality of persons in charge. Such an allocation apparatus 1 includes input means such as a keyboard 2 and a mouse 3 and operates the input means to input a plurality of requested tasks from the customer, thereby efficiently performing the requested tasks to a plurality of persons in charge. It will be allocated.

  In the above, the request work and the person in charge differ depending on the environment in which the allocation device 1 is used. For example, when the allocation device 1 is used in a fast food store, the request work is individual order content and the person in charge is He is a cooker who makes food such as hamburgers in the kitchen. In this case, the operator who inputs the requested work to the allocating device 1 is a clerk of the cashier. In addition, when the allocation device 1 is used in a hospital or clinic, the requested work is an examination of mild patients, an examination of moderate patients, an examination of severe patients, etc., and the person in charge is a doctor who examines patients. In this case, the operator who inputs the requested work to the allocation device 1 is the person in charge of reception at the hospital or clinic.

  Although an example in which the allocation apparatus 1 is used in a hospital or clinic will be described below, the allocation apparatus 1 is not limited to a hospital or clinic, but may be used in a restaurant (including delivery type) including the fast food store. Also, it may be used for a customer center that accepts service provision, complaints, etc. Furthermore, if applicable, it may be used in other stores / facilities.

  FIG. 2 is a hardware configuration diagram showing the allocation device 1 according to the present embodiment. As shown in FIG. 2, the allocation device 1 further includes a CPU (allocating means, learning means) 10, a display 20, a communication I / F unit 30, an HDD (storage means) 50, and a USB (storage means) 60. And have.

  The CPU 10 controls the entire allocation device 1 according to the present embodiment, and includes a ROM 10 a and a RAM 10 b as shown in FIG. 2. The ROM 10 a is a read only memory in which various programs for causing the allocation device 1 to function are stored. The RAM 10 b is a read / write memory that stores various data and has an area necessary for the processing operation of the CPU 10.

  The display 20 displays an input image by the operation of the keyboard 2 or the mouse 3 or displays an allocation result of requested work by the allocation device 1. The communication I / F unit 30 is an interface for communicating with another device. The allocation device 1 may also receive a request job via the communication I / F unit 30. For example, in a hospital or clinic, an appointment for consultation on the Internet or the like is applicable.

  The HDD 50 and the USB 60 are auxiliary storage devices connected to a personal computer. Similar to the ROM 10a, the HDD 50 and the USB 60 may store various programs for causing the allocation device 1 to function. That is, the CPU 10 may realize each function of the allocation device 1 according to the present embodiment in accordance with the programs stored in the HDD 50 and the USB 60.

  Furthermore, the HDD 50 and the USB 60 store the completion time required for each of a plurality of persons in charge to complete the requested work for each type of requested work. FIG. 3 is a chart showing stored contents. As shown in FIG. 3, the HDD 50 and the USB 60 are required to complete the three requested tasks of examination of mild patients, examination of moderate patients and examination of severe patients by each of a plurality of (three) doctors A to C. Data of the completion time is stored.

  Specifically, data of completion time of 1.5 minutes for medical examination of mild patients, 6 minutes for medical examination of moderate patients, and 4 minutes for medical examination of severe patients are stored. Similarly, data on completion time is stored for Doctor B's examination of a mild patient for 3 minutes, 7 minutes for a moderate patient's examination and 5 minutes for a severe patient's examination, Doctor C's case for a mild patient's examination 4.5 Minutes, data on completion time of 9 minutes for the examination of moderate patients and 7.5 minutes for the examination of severe patients are stored.

  Furthermore, the HDD 50 and the USB 60 store data of basic time for each requested task. Specifically, the basic time is 3 minutes for the diagnosis of mild patients (lower limit 1.5 minutes), 7 minutes for the diagnosis of moderate patients (lower limit 6 minutes), and 5 minutes for the diagnosis of severe patients (lower limit 4 minutes) Data is stored.

  A mild patient is, for example, a patient who does not need prescription or a patient who only needs prescription, a moderate patient is, for example, a patient who needs treatment but does not need to be hospitalized, and a severe patient is, for example, hospitalization Is a patient who needs

  In addition, the HDD 50 and the USB 60 store data of waiting time for each requested task. For example, mild patients have no restriction on the waiting time from the hospital due to their medical condition, moderate patients can wait 120 minutes, and severe patients can wait only about 10 minutes. That is, from the viewpoint of the doctor, it can be determined that the less severe the patient, the more physical fitness there is and the longer it takes to wait for medical examination. The HDD 50 and the USB 60 store waiting time data in consideration of the severity of the patient (viewpoint on the doctor side). Therefore, as described later, the allocation device 1 according to the present embodiment allocates the examination work of patients to a plurality of doctors A to C so as not to exceed such a waiting time. The waiting time indicates the priority of the requested work, the highest priority for the diagnosis of the severe patient, the second highest for the diagnosis of the mild patient, and the lowest priority for the diagnosis of the moderate patient.

  In addition, from the viewpoint of the patient side, since the consultation time (completion time) is shorter as the severity is lower, there is an expectation that the medical examination should be made earlier. In other words, patients tend to dislike having to wait for a long time despite the fact that they need to see for a short time. For example, mild patients expect to have a medical examination within 30 minutes from the hospital visit. Expect to see a doctor within 60 minutes of coming to the hospital. On the other hand, patients tend to be satisfied if the doctor takes a long time for medical examination even if the waiting time is long. That is, there is a medical examination time expected according to the waiting time. For example, a mild patient would like to see a doctor within 30 minutes of coming to the hospital, but even if he kept waiting for 40 minutes he would be satisfied if the doctor took a long time to see the doctor, even if only 20 minutes. Even if not, they tend to be dissatisfied if the doctor's visit time is extremely short. Thus, when these are combined, the waiting time data is 15 minutes for mild patients, 30 minutes for moderate patients, and 10 minutes for severe patients for Doctor A. The waiting time data for Doctor B is 30 minutes for mild patients, 60 minutes for moderate patients, and 10 minutes for severe patients, and the waiting time data for Doctor C is 45 minutes for mild patients and 90 minutes for moderate patients 10 minutes in severe patients. The HDD 50 and the USB 60 store waiting time data in consideration of such customer satisfaction (patient's viewpoint). Therefore, as described later, the allocation device 1 according to the present embodiment allocates the examination work of patients to a plurality of doctors A to C so as not to exceed the waiting time for each doctor. This waiting time indicates the expectation value on the patient side, and the expected value tends to be higher as the waiting time is longer.

  Furthermore, it is desirable to consider regionality in the waiting time according to the patient's expectation value. For example, in the case of a hospital or clinic provided in a region that is not resistant to waiting, the waiting time will be multiplied by a coefficient less than "1". That is, in the case of a hospital or clinic provided in a rural area where there is no resistance to waiting, the waiting time of a mild patient is, for example, 10 minutes for Doctor A, 20 minutes for Doctor B, 30 minutes for Doctor C Become.

  FIG. 4 is a functional configuration diagram showing the allocation device 1 according to the present embodiment. As shown in FIG. 4, the allocation device 1 according to the present embodiment includes, as each function executed by the CPU 10, an input reception unit 11, a reservation reception unit 12, an allocation unit (allocation means) 13, and a learning unit (learning Means) 14).

  The input receiving unit 11 is a part that executes a process of receiving an input operation by the keyboard 2 or the mouse 3. For example, when a patient comes to a hospital or clinic, the receptionist classifies whether the patient is a mild patient, a moderate patient, or a severe patient based on the contents described in the inquiry table. When the input operation of classification information is performed by the mouse 3, the input receiving unit 11 receives the classification information.

  The reservation acceptance unit 12 is a unit that executes a process of accepting reservation information from the communication I / F unit 30. If the appointment reception unit 12 inputs that the patient wants to receive a medical examination on a specific date and time in advance through another device (the patient's smartphone or PC), whether the medical examination can be made on that specific date or near date to decide. If diagnosis is possible, a reservation of a specific date or near date is accepted, and if diagnosis is not possible, information on other dates is transmitted to other devices. In addition, the reservation reception unit 12 causes the device on the patient side to display the inquiry content simultaneously with the reception of the reservation, and whether the patient is a mild patient, a moderate patient, or a severe patient according to the response to the inquiry content Classify

  The allocation unit 13 executes processing for allocating the requested work to the doctors A to C, who are the plurality of persons in charge. The allocation unit 13 executes allocation processing based on four criteria of 1) ratio, 2) total time, 3) priority, and 4) expected value. In particular, the allocation unit 13 includes a specification unit 13a and a ratio calculation unit 13b, and after the processing of the specification unit 13a and the ratio calculation unit 13b, performs 1) allocation processing based on the ratio.

  First, the identification unit 13a identifies a doctor with the lowest work efficiency from a plurality of doctors A to C according to a predetermined condition, based on stored contents (data of completion time) stored in the HDD 50 and the USB 60. Here, the predetermined condition is, for example, that the total obtained by adding the completion times of a plurality of types of requested work is the largest, or the completion time of the specified requested work (for example, the requested work with the largest number of transactions) Is a long time. According to such predetermined conditions, the identification unit 13a identifies a doctor with the lowest work efficiency. For example, in the example illustrated in FIG. 3, the identification unit 13 a identifies the doctor C as a person in charge with the lowest work efficiency.

  The ratio unit 13 b calculates the ratio of completion time. The ratio unit 13b is a type of requested work of other persons (doctor A and doctor B) other than the identified doctor C among the plurality of persons in charge of the doctor C identified as the person in charge with the lowest work efficiency. Calculate the ratio of completion time per other (completion time of other doctors / completion time of specified doctors). Specifically, in the example shown in FIG. 3, the ratio unit 13 b calculates the ratio of the doctor A as 0.33 and the ratio of the doctor B as 0.67 in the examination work for mild patients. Similarly, the ratio unit 13b calculates the ratio of Doctor A as 0.57 and the ratio of Doctor B as 0.78 for medical examination of moderate patients, and the ratio of Doctor A for medical examination of severe patients. Is calculated as 0.53, and the ratio of doctor B is calculated as 0.67.

  The allocation unit 13 preferentially allocates the requested work with the largest ratio to the identified doctor C. In the above-described example, the ratio is the largest for doctor B's examination of moderate disease patients. For this reason, the allocation unit 13 preferentially allocates to the doctor C the examination service of the moderate disease patient in the example shown in FIG. Here, with regard to the examination work, the doctor's experience and determination influence the completion time. For experienced doctors and early decision-making doctors, completion times tend to be shorter. However, for the examination of patients with moderate disease, it is difficult to make judgments, and even experienced doctors and early decision-making doctors tend to require a certain amount of time. For this reason, there is a tendency for the ratio to become large for the examination work of moderate disease patients.

  Moreover, in the above, “preferentially allocate” refers to the case where the number of medical examination services for patients with moderate disease with the highest ratio of completion time is compared for the specified doctor C and the other doctors A and B. It says that the handling number of the doctor C is the largest.

  Furthermore, in the above description, since the ratio of examination services for moderate disease patients by doctor B is the largest, examination services for moderate disease patients are preferentially allocated to doctor C, but the invention is not limited thereto. That is, an average value is calculated for each of the ratio of examination services of mild patients, the ratio of examination services of moderate patients, and the ratio of examination services of severe patients. It may be allocated preferentially. That is, the allocation unit 13 calculates the average value of the examination services of mild patients as (0.33 + 0.67) /2=0.5, and the average value of examination services of moderate patients (0.57 + 0.78) It calculates with /2=0.675, and calculates the average value of the examination work of the mild patient as (0.53 + 0.67) /2=0.6. Then, the allocation unit 13 may determine that the doctor C should preferentially allocate the medical examination work of the moderate disease patient whose average value is the highest.

  As described above, "the ratio is the largest" is not limited to the ratio itself, but may be an average value for each requested service of the ratio, or may be another value obtained from the ratio. In particular, when the inverse number of the ratio or the average value is adopted, it is needless to say that "the ratio is the largest" becomes "the inverse number of the ratio or the average value".

  As described above, the allocation unit 13 performs 1) allocation processing based on the ratio.

  Furthermore, the allocation unit 13 executes 2) allocation processing based on the total time. This process is a process performed simultaneously with the process based on the ratio, and is not performed separately. That is, the allocation unit 13 allocates the requested work to the plurality of doctors A to C so that the total time for the doctors A to C to perform the requested work is equal while performing the above-described processing based on the ratio. The total time can be obtained by adding the completion time shown in FIG. 3 to each of the doctors A to C.

  In the above, “to be even” means that the difference in total time between the doctor with the largest total time and the doctor with the smallest total time falls within a predetermined time. That is, when the requested work is allocated without considering the total time, the allocation pattern extends in a plurality, but “to be even” means the maximum value of the total time among the plurality of allocation patterns. The difference between the and the minimum value falls within a predetermined time.

  In the above, the allocation unit 13 preferentially allocates to the doctor C who has specified the examination service of the moderate disease patient with the largest ratio, and not all of them. This takes into consideration the relationship between 2) total time, 3) priority, and 4) expected value. That is, in the case of allocating based on the ratio, if the doctors A to C can not equalize the total time, allocation in which a part of the ratio is ignored is executed. That is, the examination work for moderate patients may be assigned to doctor A or doctor B, and the examination work for mild patients may be allocated to doctor C. Furthermore, in consideration of 3) priorities and 4) expected values, examination work for moderate patients may be allocated to Doctor A or Doctor B, and examination work for mild patients may be allocated to Doctor C. is there. As mentioned above, patients tend to be dissatisfied with the fact that they do not visit the hospital in order of visit. In addition, severity (doctor's point of view) and customer satisfaction (patient's point of view) should be considered for the allocation of examination services. Due to this tendency, data of the waiting time shown in FIG. 3 is stored in the HDD 50 and the USB 60. The allocator 13 allocates the requested work so that the time stored in the data of the waiting time does not elapse from the time of the hospital visit, and due to the waiting time, the examination work of the moderate disease patient is Doctor A or Doctor B It may be allocated. Further, as is apparent from the waiting time shown in FIG. 3, the doctor C may be assigned to a medical examination service for a mild patient when the waiting time is long. In the present embodiment, since the allocation device 1 is used in a hospital or clinic, the priority corresponds to the severity of the patient, but the priority is not limited to this, and the priority is in the order of request. May be

  The learning unit 14 learns the completion time. More specifically, in each of the doctor's offices A to C, a PC for displaying an image of a patient's medical chart is installed. For example, the learning unit 14 measures the time until the image of the patient's medical chart is displayed and the image of the next patient's medical chart is displayed, and determines that this time is required for the patient's examination work. Will be accumulated as completion time. Then, when the accumulated completion time data reaches a predetermined number, the learning unit 14 updates the average value of the predetermined number of data as new completion time data.

  The learning unit 14 is not limited to the above operation, and may update, for example, the median of the average value of a fixed number of data and the current completion time as data of a new completion time. Furthermore, the learning unit 14 may adopt a moving average value without adopting an average value of a fixed number of data.

  In addition, in addition to each doctor AC in the allocation apparatus 1 provided with the learning part 14, when a new doctor is added, the data of the basic time is employ | adopted as the data of completion time for every request work to the doctor. Then, data of individual completion time will be generated by the learning by the learning unit 14 like doctors A to C.

  In addition, when the learning unit 14 updates the data of the completion time, it is preferable to update the data of the waiting time (expected value) according to the updated data.

  Next, the operation of the allocation device 1 according to the present embodiment will be described. FIG. 5 is a first flowchart showing the operation of the allocation device 1 according to the present embodiment. The process illustrated in FIG. 5 is performed periodically, and is performed, for example, once a day.

  As shown in FIG. 5, first, the identification unit 13a of the allocation unit 13 identifies a doctor with the lowest work efficiency according to a predetermined condition (S1). Note that, as described above, the predetermined condition is, for example, that the total obtained by adding the completion times of a plurality of types of requested operations is the largest, or a specific requested operation (for example, requested operations with the largest number of transactions) Is the longest completion time.

  Next, the ratio calculation unit 13b of the allocation unit 13 calculates the ratio of the completion time of another doctor to the doctor specified in step S1 (S2). This ratio is calculated for each requested task, as described above.

  Here, the calculated ratio indicates the work efficiency of other doctors based on the doctor with the lowest work efficiency. For this reason, it can be said that the requested work with the largest ratio is the requested work with little difference between the doctor with the lowest work efficiency and the other doctors. Therefore, the allocation unit 13 determines the requested work with the largest ratio (that is, the requested work with the smallest difference between the doctor with the lowest work efficiency and the other doctors) as the priority work (S3). Then, the process illustrated in FIG. 5 ends.

  FIG. 6 is a second flowchart showing the operation of the allocation device 1 according to the present embodiment. The process shown in FIG. 6 is a process that is executed each time a request job occurs. As shown in FIG. 6, first, when the request work occurs, the allocation unit 13 determines whether the request work is the priority work specified in step S3 shown in FIG. 5 (S4).

  If it is determined that the work is a priority work (S4: YES), the allocation unit 13 executes allocation processing based on two criteria of 1) ratio and 2) total time (S5). It is needless to say that 3) priority and 4) expected value are considered in the process of step S5. After that, the process shown in FIG. 6 is ended, and the occurrence of the next requested job is awaited. On the other hand, when it is judged that it is not priority work (S4: NO), the allocation part 13 performs an allocation process based on the reference | standard of 2) total time (S6). It goes without saying that 3) priority and 4) expected value are considered also in the process of step S6. After that, the process shown in FIG. 6 is ended, and the occurrence of the next requested job is awaited. Here, the priority and the expected value are considered from the time when the patient has a waiting time. That is, when the examination work is performed without waiting time, it is not necessary to consider the priority and the expected value, and the allocation process is executed with the priority and the expected value removed. .

  Next, how the assignment work is assigned will be described in more detail. In the following description, the doctor C is the person in charge with the lowest work efficiency, and the priority work is the examination work of a moderate disease patient. That is, based on the data shown in FIG. 3, the doctor with the lowest work efficiency is identified, and the ratio is calculated.

  FIG. 7 is a first diagram showing the state of allocation of requested work, and shows the state of allocation when requested work occurs before the start of the work. That is, it shows the case of the medical examination reservation by the Internet and the telephone.

  As shown in FIG. 7 (a), first, it is assumed that 11 mild patients have requested medical examination work. Here, since the examination work for patients with mild illness is not a priority work, as shown in the flowchart of FIG. 6, it is determined as "NO" in step S4, and each requested work is allocated so that the total time becomes even. That is, the examination services of 6 mild patients are assigned to Doctor A, the examination services of 3 mild patients are assigned to Doctor B, and 2 for Doctor C so that the total amount of completion time is equal for each doctor. The examination work of human mild patients is allocated.

  After that, it is assumed that there is a request for medical examination work from one moderate disease patient. Here, since the examination work of the moderate disease patient is a priority work, as shown in the flowchart of FIG. 6, it is determined as "YES" in step S4. Then, the allocation unit 13 allocates the examination work of the moderate disease patient to the doctor C who is identified as the person in charge having the lowest work efficiency (see FIG. 7B).

  After that, it is assumed that there is a request for medical examination work from one more moderate patient. In this case, the allocation unit 13 allocates the examination work of the moderate disease patient to the doctor C who is identified as the person in charge with the lowest work efficiency, so that the total amount of completion time becomes equal for each doctor. . That is, the allocation unit 13 allocates the medical examination services for the moderate disease patients to the doctor C, and transfers the medical examination services for the mild patients assigned to the doctor C at the stage shown in FIG. 7A to the doctor A and the doctor B. (See FIG. 7 (c)). In this way, the reason for the transfer is that if the doctor C is assigned without changing the examination work of another moderate patient, the difference in total time between the doctor C and the other doctors A and B is determined. It is because time will be exceeded.

  As described above, the allocation apparatus 1 according to the present embodiment allocates priority work to a specific person in charge with priority, and distributes the total time equally, resulting in overall work. It will minimize the time. In addition, in the example shown in FIG. 7, since the case of the consultation reservation by the internet or a telephone is shown, a patient is predicted to come to a hospital at a designated time, and a waiting time will not occur. That is, the priority and the expected value will not be considered.

  FIG. 8 is a second diagram showing the state of allocation of requested work, and shows the state of allocation when requested work occurs after the start of the work.

  As shown in FIG. 8 (a), it is first assumed that eleven mild patients have requested medical examination work. In this case, as in the example shown in FIG. 7A, the requested work is allocated so that the total time is even. That is, the examination services of 6 mild patients are assigned to Doctor A, the examination services of 3 mild patients are assigned to Doctor B, and 2 for Doctor C so that the total amount of completion time is equal for each doctor. The examination work of human mild patients is allocated. Also, in the example shown in FIG. 8A, doctor A is examining the fourth mild patient, doctor B is examining the second mild patient, and doctor C is the first mild patient. I am looking for

  In such a condition, it is assumed that there is a request for medical examination work from one moderate disease patient. Here, since the examination work of the moderate disease patient is a priority work, as shown in the flowchart of FIG. 6, it is determined as "YES" in step S4. Then, the allocation unit 13 allocates the examination work of the moderate disease patient to the doctor C who is identified as the person in charge with the lowest work efficiency (see FIG. 8B). At this time, the medical examination work of the mild patients assigned to the doctor C is assigned to the doctor A.

  After that, it is assumed that there is a request for medical examination work from one more moderate patient. In this case, if the allocation unit 13 allocates the examination work of a moderate disease patient to the doctor C having the lowest work efficiency, it will not be possible to achieve equalization (within a predetermined time) for the total time. In particular, when the medical examination work of a moderate disease patient is further assigned to the doctor C from the state shown in FIG. 8 (b), one moderate disease patient is in the waiting room even though the doctor A and the doctor B are open. I am kept waiting and inefficient.

  Therefore, the allocation unit 13 allocates the medical examination work of the moderate disease patient to the doctor B, and transfers the medical examination work of the mild patient who was assigned to the doctor B at the stage shown in FIG. 8 (c)). As a result, while the priority work is assigned to the doctor C, the total time is equally allocated, as a result, the overall work time can be minimized.

  The reason why the medical examination work for the moderate disease patients is allocated to the doctor B in the above is based on the ratio. That is, when the priority task can not be allocated to the person in charge with the lowest task efficiency, the allocating unit 13 calculates the total of the ratio of other requested tasks excluding the priority task. It is efficient to perform tasks other than priority tasks for those who have the lowest total. Therefore, in the case of the example shown in FIG. 8, the examination work of the moderate disease patient is allocated to the doctor B.

  In the example shown in FIG. 8, waiting time occurs for some patients. For this reason, priority is taken into consideration, and as shown in FIG. 8 (c), moderate-patients who come to a hospital later are started to have a medical examination before mild patients. In addition, because waiting time is occurring, expected values are also taken into consideration, and in the example shown in FIG. 8 (c), medical examinations are performed in a form (waiting time and doctor) that meets all expectations. Customer satisfaction will be maintained.

  FIG. 9 is a third diagram showing the state of allocation of requested work, and shows the state of allocation when requested work occurs after the start of the work.

  As shown in FIG. 9A, first, it is assumed that 11 mild patients have requested medical examination work. In this case, as in the example shown in FIG. 7A, the requested work is allocated so that the total time is even. That is, the examination services of 6 mild patients are assigned to Doctor A, the examination services of 3 mild patients are assigned to Doctor B, and 2 for Doctor C so that the total amount of completion time is equal for each doctor. The examination work of human mild patients is allocated. Also, in the example shown in FIG. 9 (a), doctor A is examining the sixth mild patient, doctor B is examining the third mild patient, and doctor C is the second mild patient. I am under examination.

  In such a condition, it is assumed that there is a request for medical examination work from one moderate disease patient. Here, since the examination work of the moderate disease patient is a priority work, as shown in the flowchart of FIG. 6, it is determined as "YES" in step S4. Then, the allocation unit 13 allocates the medical examination work of the moderate disease patient to the doctor C who is identified as the person in charge having the lowest work efficiency (see FIG. 9B).

  After that, it is assumed that there is a request for medical examination work from one more moderate patient. In this case, if the allocation unit 13 allocates the examination work of a moderate disease patient to the doctor C having the lowest work efficiency, it will not be possible to achieve equalization (within a predetermined time) for the total time. In particular, when the medical examination work of a moderate disease patient is further assigned to the doctor C from the state shown in FIG. 9 (b), one moderate disease patient is in the waiting room even though the doctor A and the doctor B are open. I am kept waiting and inefficient.

  Therefore, the allocation unit 13 allocates the medical examination work of the moderate disease patient to the doctor B (see FIG. 9C). In this case, Doctor A is already examining the sixth mild patient, Doctor B is examining the third mild patient, and Doctor C is examining the second mild patient. There is no transfer of requested work. Further, the reason why the medical examination work for the moderate disease patients is allocated to the doctor B in the above is the same as the reason shown in FIG.

  Furthermore, in the example shown in FIG. 9, a slight waiting time occurs for moderate patients. Therefore, processing in which the priority and the expected value are considered is performed.

  FIG. 10 is a fourth diagram showing a state of allocation of requested work, and shows a state of allocation when requested work occurs after the start of the work, and in particular shows a state of allocation considering an expected value.

  As shown in FIG. 10A, first, it is assumed that 18 mild patients have requested medical examination work. In this case, the requested work is allocated so that the total time is even. That is, the examination services of 10 mild patients are assigned to doctor A, the examination services of 5 mild patients are assigned to doctor B, and the examination services of 3 mild patients are assigned to doctor C. At this point in time, consultation services for doctors A to C have not been started.

  In such a condition, it is assumed that there is a request for medical examination work from two moderate patients immediately. In this case, the doctor's C is assigned the examination work of the moderate disorder patient who is the priority work, and the request work is allocated so that the total time is even. That is, the examination services of 12 mild patients are assigned to Doctor A, the examination duties of 6 mild patients are assigned to Doctor B, and the examination duties of 2 moderate patients are assigned to Doctor C. The second moderate patient may be assigned to doctor A or doctor B, but in the example shown in FIG. 10, doctor C is assigned instead of doctor A or doctor B. This is because in a situation where as many as 20 patients come to the hospital at one time, efficiency is given priority over priority. That is, the allocation unit 13 performs allocation in consideration of priority during normal times, but when a certain number or more of patients visit at one time (within a prescribed time), priority is given to efficiency without considering priority. Allocation will be done. Here, when processing as described above, it is premised that the second moderate patient does not wait for more than 120 minutes in the waiting time (priority) shown in FIG. 3.

  And if allocation is performed as mentioned above, the total of completion time will be 18 minutes about doctors A-C. For this reason, with regard to a mild patient who is to be consulted for Doctor A at the end, the waiting time becomes 16.5 minutes, which makes him not satisfied with the expected value. Therefore, the allocator 13 reallocates a mild patient who is to be consulted about Doctor A to Doctor B. As a result, for mild patients who should have felt dissatisfaction, the result will be in line with the expected value, so that dissatisfaction can be avoided.

  A specific example of the allocation process will be described below. The allocation apparatus 1 according to the present embodiment may perform allocation as shown in FIGS. 7 to 10, but performs allocation in principle as follows. In the following, for example, the above-mentioned predetermined time is a time of one minute or more which requires the maximum time.

  First, when a plurality of tasks are requested at the same time, the allocation unit 13 assigns all the priority tasks to the person in charge with poor efficiency, and assigns all the other tasks to the other persons in charge equally. shake. At this time, the allocation unit 13 allocates the tasks to be started in the order of priority on a per-person basis.

  Then, the total work time of the person in charge having the longest total work time is compared with the total work time of the person in charge having the shortest total work time. As a result of comparison, if the difference between the two is within a predetermined time, it is determined that the allocation is properly performed, and the process is ended.

  On the other hand, if it is not within the predetermined time, adjustment processing is executed. At this time, the total work hours of the other persons in charge are almost close. For this reason, the allocation unit 13 determines which of the nearly approximate time (can be the total work time of any person in charge) and the total work time of the person in charge with the lowest work efficiency is longer.

  If the person with the worst efficiency is the longest, move one of the operations of the person with the worst efficiency to the person with the shortest total working time among the other agents. Then, the allocation unit 13 compares the total work time of the person in charge having the longest total work time with the total work time of the person in charge having the shortest total work time, and is appropriate if the difference between the two is within the predetermined time. The process is terminated. If not, one more person in charge of the work efficiency is moved to a person in charge with the shortest total work time at this point. Thereafter, these processes are repeated until the predetermined time is reached.

  Then, finally, the allocation unit 13 confirms whether the work has been started in the order of priority based on the person-in-charge base, and if different, changes the work order based on the person-in-charge base.

  By the way, if it is judged that the near general time is longer between the near general time and the total work time of the person in charge with the lowest work efficiency, one of the work of the person in charge with the longest total work time is the most Move to a person in charge who is inefficient. Then, the allocation unit 13 compares the total work time of the person in charge having the longest total work time with the total work time of the person in charge having the shortest total work time, and is appropriate if the difference between the two is within the predetermined time. The process is terminated.

  On the other hand, otherwise, one of the tasks of the person in charge having the longest total job time at this point is moved to the person in charge with the lowest job efficiency. The allocation unit 13 repeats this processing until it is determined that the processing is within a predetermined time.

  Then, finally, the allocation unit 13 confirms whether the work has been started in the order of priority based on the person-in-charge base, and if different, changes the work order based on the person-in-charge base.

  Next, from this state, the allocation unit 13 confirms the entire work order, and selects one to be exchanged between the persons in charge, if the work is not started in the priority order, Even if it is replaced, it is judged whether it is within the predetermined time, and if it is within the predetermined time, it is replaced, otherwise it is abandoned. Furthermore, the allocation unit 13 determines whether the person in charge with the lowest efficiency is allocated to the person in charge that is the least efficient than the other person in charge when replacing the person in charge. When many are not allocated, give up replacement.

  For example, as a result of confirming the entire work order, when the start order of the work is in order of priority, when 1, 1, 1, 4, 3, 2, ..., ... (order 1 is the highest) If it is a high task), it is judged whether or not the task of priority 2 and the task of priority 3 or priority 4 (the task of a person in charge different from the person in charge of priority 2) can be replaced. That is, when a task with a lower priority than a task with a high priority is to be started first, it is determined to replace these tasks.

  Then, the allocation unit 13 first determines whether the task of priority 2 and the task of priority 4 can be replaced. Even when replaced, when the difference between the total work time of the person in charge having the longest total work time and the total work time of the person in charge having the shortest total work time is within a predetermined time (and the person in charge is the least efficient (When most allocated to the user), the allocation unit 13 replaces the work of priority 2 with the work of priority 4. As a result, the job order becomes 1, 1, 1, 2, 3, 4... In priority order.

  On the other hand, when the difference does not fall within the predetermined time after replacement (or when the most inefficient person in charge is not allocated the most), the allocating unit 13 performs the task of priority 2 and the task of priority 4 Abandon replacement with. Then, the allocation unit 13 determines whether to replace the task of priority 2 with the task of priority 3.

  As a result, if the difference between the total work time of the person in charge having the longest total work time and the total work time of the person in charge having the shortest total work time is within a predetermined time (and the person with the worst efficiency is the most When there are many tasks assigned, the task with priority level 2 and the task with priority level 3 are replaced, and it is not within the predetermined time (or when the task with the lowest efficiency is not assigned the most) For example, the priority 2 task and the priority 3 task are abandoned. As a result, the work of priority 2 will not be replaced. Then, the allocation unit 13 determines again whether the work has been started in the priority order again, except for the abandoned one (for example, the work of the priority 2), and repeats the above processing.

  In addition, the process of starting the work within the waiting time also performs the entire check in the same manner as described above, and if there is a work not started within the waiting time, the allocation unit 13 is started within the waiting time of this work Make replacement decisions for all tasks. Then, in the case of replacement, the work is started within the waiting time in both of the replacement and if it is within the predetermined time, replacement is performed.

  On the other hand, if one of the tasks has not been started within the waiting time or is not within the predetermined time, replacement is abandoned. Then, except for the abandoned ones, it is determined again whether the work has been started within the waiting time, and the above processing is repeated.

  When the replacement process is performed so that tasks are started in order of priority, tasks that are out of the waiting time may occur. In addition, when the replacement process is performed so that the work is started within the waiting time, there is a possibility that the work which is not in the priority order may occur. Therefore, only one of them may be performed or, if possible, the other may be performed within the range in which the content adjusted by one of the processes is not broken.

  Furthermore, if there is only one task request after the above processing, if this is a priority task, it is assigned to the person who is most inefficient. Then, the same process as the process described above is performed. On the other hand, if it is not the priority work, the work requested newly is assigned to the person in charge with the shortest total work time in order to equalize the total work time. Then, processing is performed to comply with the above-mentioned priority or waiting time.

  In this manner, according to the allocation apparatus 1 according to the present embodiment, the requested work with the highest ratio of completion time for each request by another person in charge to the person with the lowest operation efficiency is the person in charge with the lowest operation efficiency. Give priority to people with disabilities. Here, the ratio of the completion time of the person in charge with the lowest task efficiency for each requested task indicates the task efficiency of the other person in charge based on the person in charge with the lowest task efficiency. Therefore, it can be said that the requested work with the largest ratio is the requested work with a small difference between the person in charge with the lowest work efficiency and the other person in charge. And, by preferentially allocating such requested work to the person in charge with the lowest work efficiency, even the person in charge with the lowest work efficiency can perform the requested work relatively efficiently. Therefore, since the person in charge with low business efficiency can be raised, it is possible to respond to customers more efficiently.

  In particular, in the past, it has tended to focus on making full use of the person in charge with high work efficiency in order to efficiently carry out the requested work, but this embodiment makes use of the person in charge with low work efficiency. By focusing on people who have low business efficiency, we aim to respond to customers efficiently. In the conventional case, a person with high work efficiency becomes very busy, which may lead to an increase in stress of the person with high work efficiency and dissatisfaction with the evaluation. In addition, people who are able to work are as busy as they are and they lose their motivation to improve their skills. However, in the case of the present embodiment, even the person in charge with low work efficiency performs bottom-up, which can reduce the possibility of increasing the stress of the person in charge with high work efficiency and dissatisfaction with the evaluation. . In addition, the possibility of losing skill improvement can be reduced.

  In addition, the client can handle the customer without dissatisfaction, because the client can allocate the requested work to a plurality of persons in charge so that the waiting time of the customer does not exceed the waiting time according to the expectation.

  In addition, in order to learn completion time and sequentially update it to learned completion time, when the technical power of each person in charge is improved and completion time is shortened, this can be updated, and it is requested appropriately Ability to allocate work.

  In addition, in order to allocate the requested work to a plurality of persons in charge so as to be processed first from the higher priority requested work, for example, it is desirable for a patient to have a very short waiting time for a high degree of severity in a hospital or clinic. Allocation and the like can be made so that medical consultations can be received early, and allocation of requested work can be performed more appropriately.

  As mentioned above, although this invention was demonstrated based on embodiment, this invention is not limited to the said embodiment, You may add a change in the range which does not deviate from the meaning of this invention.

  For example, although the allocation device 1 according to the present embodiment is realized by one PC, the concept is not limited to this, and is a concept including an allocation system realized by connecting a plurality of computers via a network.

  Further, the program for causing the allocation apparatus 1 to function in the present embodiment is not limited to the recording medium of the ROM 10a, the HDD 50, the USB 60, and other apparatuses, and is stored in another recording medium such as CD-ROM, CD-R, etc. It may be

  Furthermore, although the allocation apparatus 1 has the learning function in the present embodiment, the invention is not limited to this, and may not have the learning function.

  In addition, the allocating device 1 according to the present embodiment includes the specifying unit 13a and the ratio calculating unit 13b in the allocating unit 13. However, the specific result and the ratio may be stored in advance in storage means such as the HDD 50 and the USB 60 without being limited to this. That is, the storage unit may store in advance information on the person in charge with the lowest work efficiency and information on the ratio. This is because the processing can be simplified without executing the processing according to the flowchart shown in FIG.

  Further, in the above, the learning unit 14 may update the completion time by multiplying the numerical value before the update by a coefficient, and the update method is not particularly limited to the above.

1 ... allocation device 2 ... keyboard 3 ... mouse 10 ... CPU
10a ... ROM
10b ... RAM
11 ... input reception unit 12 ... reservation reception unit 13 ... allocation unit (allocation means)
13a ... specific part 13b ... ratio calculation part 14 ... learning part (learning means)
20: Display 30: Communication I / F unit 50: HDD (storage means)
60 ... USB (storage means)

Claims (9)

It is an allocation device that allocates a client's requested work to multiple personnel,
Storage means for storing, for each type of the requested work, a completion time required for each of the plurality of persons in charge to complete the requested work;
Allocation means for allocating a plurality of the requested tasks to the plurality of persons in charge;
The allocation means identifies, based on the stored contents stored by the storage means, the person in charge with the lowest task efficiency according to a predetermined condition from the plurality of persons in charge, and the plurality of persons in charge for the identified person in charge. The ratio of the completion time for each type of the requested work of the other responsible persons excluding the identified one of the persons in charge is calculated, and the requested work with the largest ratio is prioritized to the specified responsible person, And, the assignment work is assigned to the plurality of persons in charge so that the total time for the plurality of persons in charge to carry out the request work becomes equal. It is an allocation device that allocates the requested work corresponding to the customer to a plurality of persons in charge,
The completion time required for each of the plurality of persons in charge to complete the requested work is stored for each type of the requested work, and the lowest work efficiency specified according to the predetermined conditions from the plurality of persons in charge A storage unit storing a ratio of the completion time for each type of requested work of the other staff members other than the identified one among the plurality of staff members with respect to the staff member;
The requested work is given priority over the requested work with the largest ratio stored by the storage means to the identified person in charge, and the total time that the plurality of persons in charge perform the requested work is equal Allocation means for allocating to the plurality of persons in charge;
An allocation apparatus comprising: The storage means stores waiting time data according to the expectation of the customer of the requested work,
The allocation means allocates the requested work to the plurality of persons in charge so that the waiting time of the customer does not exceed the waiting time according to the expectation stored by the storage means. The allocation apparatus according to any one of claims 1 and 2. The system further comprises learning means for learning completion time required for the plurality of persons in charge to complete the requested work for each type of the requested work,
The allocation apparatus according to any one of claims 1 to 3, wherein the storage means sequentially updates the stored completion time to the completion time learned by the learning means. . The storage means stores the priority of the requested work,
The allocation means allocates the requested work to the plurality of persons in charge so that the requested work having a high priority stored in the storage means is processed first. The allocation apparatus of any one of claim 4. It is an allocation program that allocates the requested work corresponding to the customer to multiple personnel, and
The completion time required for each of the plurality of persons in charge to complete the requested work is stored in the computer from the plurality of persons in charge based on the storage content stored by the storage unit stored for each type of the requested work. The person in charge with the lowest work efficiency is identified according to a predetermined condition, and the identified person in charge is the type of the requested task of the person in charge other than the identified person in charge among the plurality of persons in charge The ratio of completion time is calculated, and the request work with the largest ratio is given priority to the specified person in charge, and the total time for the plurality of people in charge to perform the request work is equal. An allocation program for realizing an allocation function of allocating requested work to the plurality of persons in charge. It is an allocation program that allocates the requested work corresponding to the customer to multiple personnel, and
While storing the completion time required for each of the plurality of persons in charge to complete the requested work on the computer for each type of the requested work, the most work identified from the plurality of persons in charge according to the predetermined condition The ratio stored by the storage means storing the ratio of the completion time for each type of requested work of the other staff members other than the identified one among the plurality of staff members with respect to the staff member with low efficiency is stored The request work is allocated to the plurality of persons in charge so that the largest request work is preferentially given to the person in charge and the total time in which the plurality of persons in charge perform the request work is equal. An allocation program characterized by realizing an allocation function. A computer readable recording medium storing an allocation program for allocating a requested work corresponding to a customer to a plurality of persons in charge;
According to a predetermined condition, the person in charge with the lowest work efficiency is selected from the plurality of persons in charge on the basis of the completion time for each type of the requested work which each of the plurality of persons in charge needs to complete the requested work. The ratio of the completion time for each requested service type of the other staff members other than the identified one among the plurality of staff members identified with respect to the identified staff person is calculated, and the ratio is the most Allocation of the requested work to the plurality of persons in charge so as to equalize the total time in which the plurality of persons in charge carry out the requested work, with priority given to the person in charge who specified the large requested work. A computer readable recording medium storing an allocation program for realizing a function. A computer readable recording medium storing an allocation program for allocating a requested work corresponding to a customer to a plurality of persons in charge;
In the computer, the person in charge of the person in charge with the lowest task efficiency identified based on the completion time for each of the types of the requested task that each of the plurality of staffs needs to complete the requested task Among the persons in charge other than the identified person in charge, the ratio of the completion time for each type of the requested work is the highest in the requested work, and the plurality of persons in charge are the highest in the requested work. A computer readable recording medium storing an allocation program for realizing an allocation function of allocating the requested work to the plurality of persons in charge so that a total time in which the person performs the requested work becomes equal.

Images