JP6946174B2 - A allocation device, an allocation program, and a computer-readable recording medium that stores the program. - Google Patents

Description

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

Conventionally, a CTI (Computer Telephony Integration) system has been proposed in which a customer's telephone is connected to an operator who is in a standby state (vacant state) when a customer orders a product by telephone. (See, for example, Patent Document 1).

In addition, there has been proposed an allocation device that allocates the work that the person in charge of the counter should originally perform to the person in charge of clerical work when the counter is congested in the counter work. This allocation device acquires candidates for clerical staff who should take the procedure on behalf of the clerical staff in consideration of the contribution of the counter work and the importance of the clerical staff's schedule (see, for example, Patent Document 2).

Japanese Unexamined Patent Publication No. 2002-84372 Japanese Unexamined Patent Publication No. 2010-218324

However, in the CTI system described in Patent Document 1, only a call from the customer is connected to the operator in the standby state, and there is no operator in the standby state, and the customer who is kept waiting after making a call. No consideration is given to how to deal with the situation efficiently. Further, although the allocation device described in Patent Document 2 can contribute to the elimination of congestion at the counter, it is not considered that only the person in charge of the counter who performs the counter business can handle it efficiently.

In this way, in the past, there was still room for improvement in dealing with customers efficiently with only the person in charge who should perform the original work.

The present invention has been made to solve such a conventional problem, and an object of the present invention is to store an allocation device, an allocation program, and an allocation program capable of responding to customers more efficiently. The purpose is to provide a computer-readable recording medium.

The allocation device of the present invention is an allocation device that allocates a request work from a customer to a plurality of persons in charge, and the request work is set to a completion time required for each of the plurality of persons in charge to complete the request work. The storage means stored for each type and the allocation means for allocating the plurality of requested operations to the plurality of persons in charge are provided, and the allocation means is based on the storage contents stored by the storage means. The person in charge with the lowest work efficiency is identified from the person in charge of The ratio of the completion time for each type is calculated, and the requested work having the largest ratio is given priority over the specified person in charge, and the total time for the plurality of persons in charge to perform the requested work is equalized. As described above, the requested work is allocated to the plurality of persons in charge.

Further, the allocation device of the present invention is an allocation device that allocates the request work corresponding to the customer to a plurality of persons in charge, and the completion time required for each of the plurality of persons in charge to complete the request work is set. , The person in charge of the lowest work efficiency specified by the plurality of persons in charge according to a predetermined condition, while storing each type of the requested work, other than the person in charge specified in the plurality of persons in charge. The storage means that stores the ratio of the completion time for each type of the requested work of the person in charge and the requested work that has the largest ratio stored by the storage means are given priority to the specified person in charge and said. It may be characterized by including an allocation means 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 is equalized.

Further, the allocation program of the present invention is an allocation program for allocating the request work corresponding to the customer to a plurality of persons in charge, and the completion required for each of the plurality of persons in charge to complete the request work on the computer. 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 charge according to predetermined conditions, and the time is assigned to the specified person in charge. , The ratio of the completion time for each type of the requested work of the other person other than the specified person among the plurality of persons in charge is calculated, and the person in charge who has specified the requested work having the largest ratio. It is characterized by realizing an allocation function of allocating the requested work to the plurality of persons in charge so as to give priority to the person and to equalize the total time for the plurality of persons in charge to perform the requested work. do.

Further, the allocation program of the present invention is an allocation program that allocates the request work corresponding to the customer to a plurality of persons in charge, and is required for each of the plurality of persons in charge to complete the request work on the computer. The completion time is stored for each type of the requested work, and the specified person among the plurality of persons is assigned to the person with the lowest work efficiency specified by the plurality of persons according to a predetermined condition. The requested work having the largest ratio stored by the storage means that stores the ratio of the completion time for each type of the requested work of the other person in charge is prioritized over the specified person in charge, and the plurality of said persons. It may be characterized in that the allocation function of allocating the requested work to the plurality of persons in charge is realized so that the total time for the person in charge to perform the requested work is equalized.

Further, the computer-readable recording medium of the present invention is a computer-readable recording medium that stores an allocation program that allocates a request work corresponding to a customer to a plurality of persons in charge, and the computer has the plurality of persons in charge. Based on the completion time for each type of the requested work required for each to complete the requested work, the person in charge with the lowest work efficiency is identified from the plurality of persons in charge according to predetermined conditions, and the specified person in charge is identified. The ratio of the completion time for each type of the requested work of the other person other than the specified person among the plurality of persons in charge was calculated, and the requested work having the largest ratio was specified. An allocation program that realizes an allocation function that allocates the requested work to the plurality of persons in charge so as to give priority to the person in charge and equalize the total time for the plurality of persons in charge to perform the requested work. I remember.

Further, the computer-readable recording medium of the present invention is a computer-readable recording medium that stores an allocation program that allocates a request work corresponding to a customer to a plurality of persons in charge, and the computer has the plurality of persons in charge. Among the plurality of persons in charge, the specified person is assigned to the person in charge with the lowest work efficiency specified based on the completion time for each type of the requested work required for each of the requested work to be completed. The ratio of the completion time for each type of the requested work of the other persons in charge is the largest, and the requested work is given priority over the specified person, and the plurality of persons in charge perform the requested work. The allocation program that realizes the allocation function of allocating the requested work to the plurality of persons in charge may be stored so that the time is even.

According to these, the requested work in which the ratio of the completion time for each requested work of the other person in charge to the person in charge with the lowest work efficiency is the largest is preferentially allocated to the person in charge with the lowest work efficiency. Here, the ratio of the completion time for each requested work of the person in charge with the lowest work efficiency indicates the work efficiency of other persons in charge based on the person in charge with the lowest work efficiency. Therefore, it can be said that the request work with the highest ratio is the request work with a small difference between the person in charge with the lowest work efficiency and the other person in charge. Then, 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 carry out the requested work relatively efficiently. Therefore, it is possible to raise the level of the person in charge with low work efficiency, and it is possible to deal with customers more efficiently.

Further, in the present invention, the storage means stores waiting time data according to the customer's expectation of the requested business, and the allocating means responds to the expectation that the customer's waiting time is stored by the storage means. It is preferable to allocate the requested work to the plurality of persons in charge so as not to exceed the waiting time.

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 as expected, the customer can be dealt with without feeling dissatisfied.

Further, in the present invention, the learning means for learning the completion time required for the plurality of persons in charge to complete the requested work for each type of the requested work is further provided, and the storage means is stored. It is preferable to sequentially update the time 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, it can be updated when the technical ability of each person in charge is improved and the completion time is shortened. It is possible to appropriately allocate the requested work.

Further, in the present invention, the storage means stores the priority of the requested work, and the allocation means is processed so that the requested work having the higher priority stored by the storage means is processed first. It is preferable to allocate the requested work to the plurality of persons in charge.

According to this, since the request work is allocated to multiple persons in charge so that the request work with high priority is processed first, the time to wait with high severity is extremely short, for example, in hospitals and clinics. It is possible to allocate the desired patients so that they can be examined at an early stage, and it is possible to allocate the requested work more appropriately.

The allocation device is not limited to one realized by one computer, but is a concept including one configured by connecting a plurality of computers to a network. In addition, in the above, "priority allocation" means that the number of requested tasks with the highest ratio of completion time is compared between the person in charge identified as having the lowest work efficiency and the other person in charge. It means that the number of persons in charge who are identified as having the lowest business efficiency is the largest.

Further, in the above, "the largest ratio" is not limited to the ratio itself, but may be an average value for each requested work of the ratio, or may be another value obtained from the ratio. In particular, when the reciprocal of the ratio or the average value is adopted, it goes without saying that "the ratio is the largest" means "the reciprocal of the ratio or the average value is the smallest".

Further, in the above, "to be equal" means that the difference in total time between the person in charge with the longest total time and the person in charge with the shortest total time is within a predetermined time. That is, when the requested work is allocated without considering the total time, there are multiple allocation patterns, but "to be even" means the maximum value of the total time among these multiple allocation patterns. It means that the difference between the minimum value and the minimum value is 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 that stores the program, which can respond to customers more efficiently.

It is an external view which shows the allocation device which concerns on embodiment of this invention. It is a hardware block diagram which shows the allocation device which concerns on this embodiment. It is a chart which shows the stored contents. It is a functional block diagram which shows the allocation device which concerns on this embodiment. It is a 1st flowchart which shows the operation of the allocation device which concerns on this embodiment. It is a 2nd flowchart which shows the operation of the allocation device which concerns on this embodiment. It is the first figure which shows the state of the allocation of the requested work, and shows the state of the allocation when the requested work occurs before the start of the work. It is the 2nd figure which shows the state of the allocation of the requested work, and shows the state of the allocation when the requested work occurs after the start of the work. It is the third figure which shows the state of the allocation of the requested work, and shows the state of the allocation when the requested work occurs after the start of the work. FIG. 4 is a fourth diagram showing the state of allocation of requested work, showing the state of allocation when the requested work occurs after the start of work, and particularly shows the state of allocation in consideration of the expected value.

Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings, but the present invention is not limited to the embodiments. In particular, the method of allocating the requested work to a plurality of persons in charge so as to give priority and equalize the total time is not limited to the following, 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 device 1 shown in FIG. 1 is realized as, for example, one function of a personal computer, and efficiently allocates a request work from a customer to a plurality of persons in charge. Such an allocation device 1 is provided with input means such as a keyboard 2 and a mouse 3, and by inputting a plurality of request operations from a customer while operating the input means, the request operations can be efficiently sent 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 restaurant, the request work is an individual order content, and the person in charge A cook who makes foods such as hamburgers in the kitchen. In this case, the operator who inputs the requested work to the allocation device 1 is a cashier's clerk. When the allocation device 1 is used in a hospital / clinic, the requesting work is a medical examination of a mild patient, a medical examination of a moderate patient, a medical examination of a severe patient, and the like, and the person in charge is a doctor who examines the patient. In this case, the operator who inputs the requested work to the allocation device 1 is the receptionist of the hospital / clinic.

An example in which the allocation device 1 is used in a hospital / clinic will be described below, but the allocation device 1 is used not only in hospitals / clinics but also in restaurants (including delivery types) including the above-mentioned fast food restaurants. It may be used as a customer center for providing services and receiving complaints. 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 (allocation 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 10a and a RAM 10b as shown in FIG. The ROM 10a is a read-only memory in which various programs for operating the allocation device 1 are stored. The RAM 10b is a read-write readable memory that stores various data and has an area required for processing work of the CPU 10.

The display 20 displays an input image by operating the keyboard 2 and the mouse 3, and displays the allocation result of the requested work by the allocation device 1. The communication I / F unit 30 is an interface for communicating with another device. In the allocation device 1, the requested work may be input through the communication I / F unit 30. For example, in hospitals and clinics, appointments for medical examinations via the Internet are 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 operating the allocation device 1. That is, the CPU 10 may realize each function of the allocation device 1 according to the present embodiment according to the programs stored in the HDD 50 and the USB 60.

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

Specifically, the data of the completion time of 1.5 minutes for the examination of the mildly ill patient, 6 minutes for the examination of the moderately ill patient, and 4 minutes for the examination of the severely ill patient are stored for Doctor A. Similarly, for Doctor B, the completion time data of 3 minutes for the examination of the mild patient, 7 minutes for the examination of the moderate patient, and 5 minutes for the examination of the severe patient is stored, and for Doctor C, 4.5 for the examination of the mild patient. The data of the completion time of 9 minutes for the examination of the moderately ill patient and 7.5 minutes for the examination of the severely ill patient is stored.

Further, the HDD 50 and the USB 60 store the basic time data for each requested work. Specifically, the basic time is 3 minutes (lower limit 1.5 minutes) for the examination of mildly ill patients, 7 minutes (lower limit 6 minutes) for the examination of moderate patients, and 5 minutes (lower limit 4 minutes) for the examination of severely ill patients. Data is stored.

A mild patient is, for example, a patient who does not need a prescription or a patient who does not need treatment only by a prescription, a moderate patient is a patient who needs treatment but does not need to be hospitalized, and a severely ill patient is, for example, hospitalized. Is a patient in need.

In addition, the HDD 50 and the USB 60 store the waiting time data for each requested operation. For example, a mildly ill patient has no limit to the waiting time from a visit, a moderately ill patient can wait 120 minutes, and a severely ill patient can only wait about 10 minutes. That is, from the doctor's point of view, it can be judged that the lower the severity of the patient, the more physical strength he / she has and the longer the time to wait for the medical examination. The HDD 50 and the USB 60 store waiting time data in consideration of the severity of such a patient (from the viewpoint of a doctor). Therefore, as will be described later, the allocation device 1 according to the present embodiment allocates the patient examination work to a plurality of doctors A to C so as not to exceed such a waiting time. This waiting time indicates the priority of the requested work, and the medical examination of the severely ill patient has the highest priority, the medical examination of the mildly ill patient has the highest priority, and the medical examination of the moderately ill patient has the lowest priority.

From the patient's point of view, the lower the severity, the shorter the consultation time (completion time), so there is an expectation that the patient should be examined earlier. That is, patients tend to be reluctant to wait for a long time even though they only need a short consultation. For example, mildly ill patients expect to be seen within 30 minutes of their visit, and moderately ill patients I hope you will see me within 60 minutes of your visit. On the other hand, patients tend to be satisfied if the doctor takes a long time to see them, even if the waiting time is long. That is, there is an expected consultation time according to the waiting time. For example, mildly ill patients want to see a doctor within 30 minutes of their visit, but even if they wait 40 minutes, they are happy if the doctor takes a long time to see them, even if they wait only 20 minutes. Even if it is not done, there is a tendency to be unsatisfied if the doctor's consultation time is extremely short. Therefore, when these are put together, the waiting time data for Doctor A is 15 minutes for mildly ill patients, 30 minutes for moderately ill patients, and 10 minutes for severely ill patients. The waiting time data for Doctor B is 30 minutes for mildly ill patients, 60 minutes for moderately ill patients, and 10 minutes for severely ill patients, and the waiting time data for Doctor C is 45 minutes for mildly ill patients and 90 minutes for moderately ill patients. , 10 minutes for critically ill patients. The HDD 50 and the USB 60 store waiting time data in consideration of such customer satisfaction (patient's point of view). Therefore, as will be described later, the allocation device 1 according to the present embodiment allocates the patient examination work to a plurality of doctors A to C so as not to exceed the waiting time for each doctor. The waiting time indicates an expected value on the patient side, and the expected value tends to increase as the waiting time becomes longer.

Furthermore, it is desirable to consider regional characteristics in the waiting time according to the patient's expected value. For example, in the case of a hospital / clinic set up in a region that is not tolerant of waiting, the waiting time is multiplied by a coefficient less than "1". That is, in the case of a hospital / clinic set up in a rural area that is not tolerant of waiting, the waiting time for mildly ill patients is, for example, 10 minutes for doctor A, 20 minutes for doctor B, and 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 has an input reception unit 11, a reservation reception unit 12, an allocation unit (allocation means) 13, and a learning unit (learning) as each function executed by the CPU 10. Means) 14 and.

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 visits a hospital / clinic, the receptionist classifies the patient as a mild patient, a moderate patient, or a severe patient based on the contents of the questionnaire, and the keyboard 2 or When the classification information is input by the mouse 3, the input receiving unit 11 receives the classification information.

The reservation reception unit 12 is a portion that executes a process of receiving reservation information from the communication I / F unit 30. When the reservation reception unit 12 inputs in advance that the patient wants to receive a medical examination at a specific date and time through another device (patient's smartphone or PC), the reservation reception unit 12 determines whether the medical examination can be performed at the specific date and time or a date close to the specific date and time. to decide. If it is possible to see a doctor, it will accept reservations for a specific date and time or a date close to it, and if it is not possible to see a doctor, it will send information about other dates and times to other devices. Further, the reservation reception unit 12 displays the contents of the interview on the device on the patient side at the same time as receiving the reservation, and whether the patient is a mild patient, a moderate patient, or a severe patient according to the answer to the interview contents. To classify.

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

First, the identification unit 13a identifies the doctor with the lowest work efficiency from a plurality of doctors A to C according to predetermined conditions based on the stored contents (completion time data) 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 request work is the largest, or the completion time of a specific request work (for example, the request work with the largest number of handlings). May be a long time. According to such a predetermined condition, the specific unit 13a identifies the doctor with the lowest work efficiency. For example, in the case of the example shown in FIG. 3, the specific unit 13a identifies the doctor C as the person in charge with the lowest work efficiency.

The ratio unit 13b calculates the ratio of the completion time. The ratio unit 13b is a type of work requested by doctor C, who is identified as the person in charge with the lowest work efficiency, by other persons (doctor A and doctor B) other than the specified doctor C among a plurality of persons in charge. Calculate the ratio of completion times for each (completion time of other doctors / completion time of identified doctors). Specifically, in the example shown in FIG. 3, the ratio unit 13b calculates the ratio of doctor A to be 0.33 and the ratio of doctor B to be 0.67 for the examination work of a mildly ill patient. Similarly, the ratio unit 13b calculates the ratio of doctor A to be 0.57 and the ratio of doctor B to 0.78 for the examination work of moderately ill patients, and the ratio of doctor A for the examination work of severely ill 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 having the largest ratio to the specified doctor C. In the above example, the ratio is the largest in the examination work of the moderately ill patient of Doctor B. Therefore, the allocation unit 13 preferentially allocates the examination work of the moderately ill patient to the doctor C in the example shown in FIG. Here, regarding the medical examination work, the experience and determination of the doctor affect the completion time. Experienced doctors and quick-decision doctors tend to have shorter completion times. However, it tends to take a certain amount of time for the examination work of moderately ill patients, even if it is difficult to make a judgment and an experienced doctor or a doctor who makes a quick decision. For this reason, the ratio of medical examinations for moderately ill patients tends to increase.

In addition, in the above, "priority allocation" means that the number of medical examinations handled by the identified doctor C and other doctors A and B, who have the highest ratio of completion time, is compared. It means that the number of doctors handled is the largest.

Further, in the above, since the ratio of the examination work of the moderately ill patient of the doctor B is the largest, the examination work of the moderately ill patient is preferentially allocated to the doctor C, but the present invention is not limited to this. That is, an average value is calculated for each of the ratio of medical examination work for mildly ill patients, the ratio of medical examination work for moderately ill patients, and the ratio of medical examination work for severely ill patients, and the medical examination work with the largest average value is given to doctor C. You may give priority to allocation. That is, the allocation unit 13 calculates the average value of the examination work of the mildly ill patient as (0.33 + 0.67) / 2 = 0.5, and the average value of the examination work of the moderately ill patient is (0.57 + 0.78). Calculate as / 2 = 0.675, and calculate the average value of the medical examination work for mildly ill patients as (0.53 + 0.67) / 2 = 0.6. Then, the allocation unit 13 may determine that the examination work of the moderately ill patient having the highest average value is preferentially allocated to the doctor C.

As described above, the "largest ratio" in the above is not limited to the ratio itself, but may be an average value for each requested work of the ratio, or may be another value obtained from the ratio. In particular, when the reciprocal of the ratio or the average value is adopted, it goes without saying that "the ratio is the largest" means "the reciprocal of the ratio or the average value is the smallest".

As described above, the allocation unit 13 executes 1) the allocation process based on the ratio.

Further, the allocation unit 13 also executes 2) allocation processing based on the total time. This process is a process that is performed simultaneously with the process based on the ratio, and is not performed individually. That is, the allocation unit 13 allocates the requested work to a 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 executing the above processing based on the ratio. The total time can be obtained by adding the completion time shown in FIG. 3 for each doctors A to C.

In the above, "to be equal" means a state in which the difference in total time between the doctor with the longest total time and the doctor with the shortest total time is within a predetermined time. That is, when the requested work is allocated without considering the total time, there are multiple allocation patterns, but "to be even" means the maximum value of the total time among these multiple allocation patterns. It means that the difference between the minimum value and the minimum value is within a predetermined time.

In the above, the allocation unit 13 preferentially allocates to the doctor C who has specified the examination work of the moderately ill patient having the largest ratio, and does not necessarily allocate all of them. This takes into account the relationship between 2) total time, 3) priority, and 4) expected value. That is, when the total time cannot be equalized by the doctors A to C when the allocation is based on the ratio, the allocation ignoring the partial ratio is executed. That is, the medical examination work for moderately ill patients may be allocated to doctor A or doctor B, and the medical examination work for mildly ill patients may be assigned to doctor C. Furthermore, in consideration of 3) priority and 4) expected value, the medical examination work for moderately ill patients may be assigned to doctor A or doctor B, and the medical examination work for mildly ill patients may be assigned to doctor C. be. As mentioned above, patients tend to be dissatisfied if they are not examined in the order of visits. In addition, the severity (doctor's point of view) and customer satisfaction (patient's point of view) should be taken into consideration when allocating medical examination work. Due to this tendency, the waiting time data shown in FIG. 3 is stored in the HDD 50 and the USB 60. The allocation unit 13 allocates the request work so that the time stored in the waiting time data does not elapse from the time of the visit, and due to the waiting time, the examination work for the moderately ill patient is assigned to doctor A or doctor B. It may be allocated. Further, as is clear from the waiting time shown in FIG. 3, when the waiting time becomes long, the medical examination work of the mildly ill patient may be assigned to the doctor C. In this embodiment, since the allocation device 1 is used in the hospital / clinic, the priority is according to the severity of the patient, but the priority is not limited to this, and the priority is in the order of request. You may.

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

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

When a new doctor is added in addition to the doctors A to C in the allocation device 1 provided with the learning unit 14, the basic time data is adopted as the completion time data for each requested work for that doctor. After that, learning by the learning unit 14 will generate individual completion time data as in doctors A to C.

In addition, when the learning unit 14 updates the completion time data, it is preferable that the waiting time (expected value) data is updated 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 shown in FIG. 5 is performed periodically, and is executed at a frequency such as once a day.

As shown in FIG. 5, first, the specific unit 13a of the allocation unit 13 identifies the doctor with the lowest work efficiency according to a predetermined condition (S1). In addition, as described above, the predetermined condition is that, for example, the total obtained by adding the completion times of a plurality of types of requested work is the largest, or a specific requested work (for example, the requested work with the largest number of handlings). It may be 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 business as described above.

Here, the calculated ratio indicates the work efficiency of other doctors based on the doctor with the lowest work efficiency. Therefore, it can be said that the request work with the highest ratio is the request work with a small difference between the doctor with the lowest work efficiency and other doctors. Therefore, the allocation unit 13 determines the request work having the highest ratio (that is, the request work with the smallest difference between the doctor with the lowest work efficiency and other doctors) as the priority work (S3). Then, the process shown in FIG. 5 is completed.

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 every time a requested operation occurs. As shown in FIG. 6, when the requested work occurs, the allocation unit 13 first determines whether or not the requested work is the priority work specified in step S3 shown in FIG. 5 (S4).

When it is determined that the work is a priority task (S4: YES), the allocation unit 13 executes the allocation process based on two criteria of 1) ratio and 2) total time (S5). Needless to say, 3) priority and 4) expected value are taken into consideration in the process of step S5. After that, the process shown in FIG. 6 is completed, and the next requested work is waited for. On the other hand, when it is determined that the work is not a priority work (S4: NO), the allocation unit 13 executes the allocation process based on 2) the standard of total time (S6). Needless to say, 3) priority and 4) expected value are taken into consideration in the process of step S6. After that, the process shown in FIG. 6 is completed, and the next requested work is waited for. Here, the priority and the expected value are considered from the time when the patient has a waiting time. That is, when the medical 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 in the state where the priority and the expected value are excluded. ..

Next, the state of allocation of requested work will be described in more detail. In the following explanation, Doctor C is the person in charge with the lowest work efficiency, and the priority work is the medical examination work for moderately ill patients. 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 the requested work, and shows the state of the allocation when the requested work occurs before the start of the work. That is, the case of appointment for medical examination via the Internet or telephone is shown.

As shown in FIG. 7A, first, it is assumed that 11 mildly ill patients request medical examination work. Here, since the medical examination work for mildly ill patients is not a priority work, as shown in the flowchart of FIG. 6, it is determined as "NO" in step S4, and each request work is allocated so that the total time is equal. That is, doctor A is assigned the examination work of 6 mildly ill patients, doctor B is assigned the examination work of 3 mildly ill patients, and doctor C is assigned 2 so that the total completion time is equal for each doctor. Medical examination work for mildly ill patients is allocated.

After that, it is assumed that one moderately ill patient requests a medical examination. Here, since the medical examination work for the moderately ill patient is a priority work, it is determined as "YES" in step S4 as shown in the flowchart of FIG. Then, the allocation unit 13 allocates the examination work of the moderately ill patient to the doctor C specified as the person in charge with the lowest work efficiency (see FIG. 7B).

After that, it is assumed that one more moderately ill patient requests a medical examination. In this case, the allocation unit 13 allocates the examination work of the moderately ill patient to the doctor C who is specified as the person in charge with the lowest work efficiency, but allocates each doctor so that the total completion time is equal. .. That is, the allocation unit 13 allocates the examination work of the moderately ill patient to the doctor C, and transfers the examination work of the mildly ill patient 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 making the transfer is that if the examination work of another moderately ill patient is assigned to doctor C without transfer, the difference in total time between doctor C and other doctors A and B is predetermined. This is because it will exceed the time.

As described above, the allocation device 1 according to the present embodiment preferentially allocates the priority work to a specific person in charge and allocates the work so that the total time is even, and as a result, the overall work. The time will be minimized. In the example shown in FIG. 7, since the case of appointment for medical examination by the Internet or telephone is shown, it is predicted that the patient will come to the hospital at a designated time, and no waiting time will occur. That is, the priority and the expected value are not taken into consideration.

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

As shown in FIG. 8A, first, it is assumed that 11 mildly ill patients request 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 equal. That is, doctor A is assigned the examination work of 6 mildly ill patients, doctor B is assigned the examination work of 3 mildly ill patients, and doctor C is assigned 2 so that the total completion time is equal for each doctor. Medical examination work for mildly ill patients is allocated. Further, in the example shown in FIG. 8A, doctor A is examining a fourth mildly ill patient, doctor B is examining a second mildly ill patient, and doctor C is examining a first mildly ill patient. Is being examined.

In such a situation, it is assumed that one moderately ill patient requests a medical examination. Here, since the medical examination work for the moderately ill patient is a priority work, it is determined as "YES" in step S4 as shown in the flowchart of FIG. Then, the allocation unit 13 allocates the examination work of the moderately ill patient to the doctor C specified as the person in charge with the lowest work efficiency (see FIG. 8B). At this time, the medical examination work for the mildly ill patient, which was assigned to Doctor C, is assigned to Doctor A.

After that, it is assumed that one more moderately ill patient requests a medical examination. In this case, if the allocation unit 13 allocates the examination work of the moderately ill patient to the doctor C who has the lowest work efficiency, the total time cannot be equalized (within a predetermined time). In particular, from the state shown in FIG. 8 (b), when the examination work of the moderately ill patient is further assigned to the doctor C, one moderately ill patient is in the waiting room even though the doctor A and the doctor B are vacant. It is inefficient because it has been kept waiting.

Therefore, the allocation unit 13 allocates the medical examination work for the moderately ill patient to the doctor B, and transfers the medical examination work for the mildly ill patient, which was assigned to the doctor B at the stage shown in FIG. 8 (b), to the doctor A (FIG. FIG. 8 (c)). As a result, while assigning priority work to doctor C, allotment is made so that the total time is even, and as a result, the overall work time is minimized.

The reason why doctor B was assigned the medical examination work for moderately ill patients in the above is based on the ratio. That is, when it is not possible to allocate the priority work to the person in charge with the lowest work efficiency, the allocation unit 13 calculates the total ratio of the other requested work excluding the priority work. For the person in charge with the lowest total, it is efficient to perform work other than priority work. Therefore, in the case of the example shown in FIG. 8, the examination work of the moderately ill patient is assigned to the doctor B.

In the example shown in FIG. 8, waiting time occurs for some patients. Therefore, the priority is taken into consideration, and as shown in FIG. 8 (c), the moderately ill patients who come to the hospital later are started to be examined before the mildly ill patients. In addition, due to the occurrence of waiting time, the expected value is also taken into consideration. In the example shown in FIG. 8C, all patients are examined in a form (waiting time and doctor) that meets their expectations. This means that customer satisfaction will be maintained.

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

As shown in FIG. 9A, first, it is assumed that 11 mildly ill patients request 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 equal. That is, doctor A is assigned the examination work of 6 mildly ill patients, doctor B is assigned the examination work of 3 mildly ill patients, and doctor C is assigned 2 so that the total completion time is equal for each doctor. Medical examination work for mildly ill patients is allocated. Further, in the example shown in FIG. 9A, doctor A is examining a sixth mildly ill patient, doctor B is examining a third mildly ill patient, and doctor C is examining a second mildly ill patient. I am undergoing a medical examination.

In such a situation, it is assumed that one moderately ill patient requests a medical examination. Here, since the medical examination work for the moderately ill patient is a priority work, it is determined as "YES" in step S4 as shown in the flowchart of FIG. Then, the allocation unit 13 allocates the examination work of the moderately ill patient to the doctor C specified as the person in charge with the lowest work efficiency (see FIG. 9B).

After that, it is assumed that one more moderately ill patient requests a medical examination. In this case, if the allocation unit 13 allocates the examination work of the moderately ill patient to the doctor C who has the lowest work efficiency, the total time cannot be equalized (within a predetermined time). In particular, from the state shown in FIG. 9 (b), when the examination work of the moderately ill patient is further assigned to the doctor C, one moderately ill patient is in the waiting room even though the doctor A and the doctor B are vacant. It is inefficient because it has been kept waiting.

Therefore, the allocation unit 13 allocates the examination work of the moderately ill patient to the doctor B (see FIG. 9C). In this case, Doctor A is already examining the sixth mildly ill patient, Doctor B is examining the third mildly ill patient, and Doctor C is examining the second mildly ill patient. Therefore, the requested work will not be transferred. Further, the reason why the medical examination work for the moderately ill patient was assigned to the doctor B in the above is the same as the reason shown in FIG.

Further, in the example shown in FIG. 9, a slight waiting time occurs for the moderately ill patient. Therefore, the process in which the priority and the expected value are taken into consideration is executed.

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

As shown in FIG. 10 (a), first, it is assumed that 18 mildly ill patients request medical examination work. In this case, the requested work is allocated so that the total time is equal. That is, 10 mildly ill patients are assigned to doctor A, 5 mildly ill patients are assigned to doctor B, and 3 mildly ill patients are assigned to doctor C. At this point, the medical examination work for doctors A to C has not started.

In such a situation, it is assumed that two moderately ill patients immediately request a medical examination. In this case, the medical examination work for the moderately ill patient, which is the priority work, is assigned to the doctor C, and the request work is allocated so that the total time is equal. That is, doctor A is assigned the examination work of 12 mildly ill patients, doctor B is assigned the examination work of 6 mildly ill patients, and doctor C is assigned the examination work of 2 moderately ill patients. The second moderately ill patient may be assigned to Doctor A or Doctor B, but in the example shown in FIG. 10, it is not assigned to Doctor A or Doctor B, but to Doctor C. This is because efficiency was prioritized over priority in the situation where as many as 20 patients came to the hospital at one time. That is, the allocation unit 13 performs allocation in consideration of priority in normal times, but when a certain number or more of patients visit the hospital once (within a specified time), priority is given to efficiency without considering priority. The allocation will be done. Here, when processing as described above, it is premised that the second moderately ill patient does not wait for more than 120 minutes, which is the waiting time (priority) shown in FIG.

Then, when the allocation is performed as described above, the total completion time for doctors A to C is 18 minutes. For this reason, the waiting time for a mildly ill patient who is the last to be examined by Doctor A is 16.5 minutes, which does not meet the expected value and makes him feel dissatisfied. Therefore, the allocation unit 13 reallocates the mildly ill patient who is last examined for doctor A to doctor B. As a result, the expected value is met for mildly ill patients who should have been dissatisfied, and it is possible to prevent dissatisfaction.

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

First, when a request is made for a plurality of tasks at the same time, the allocation unit 13 allocates all the priority tasks to the inefficient person in charge and allocates all the other tasks to the other persons in an equal manner. shake. At this time, the allocation unit 13 allocates the work so that the work is started in the order of priority on the basis of each person in charge.

Then, the total working hours of the person in charge with the longest total working hours are compared with the total working hours of the person in charge with the shortest total working hours. 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 terminated.

On the other hand, if it is not within the predetermined time, the adjustment process is executed. At this time, the total business hours of other persons in charge are almost the same. For this reason, the allocation unit 13 determines which of the approximately close time (the total working time of any person in charge is acceptable) and the total working time of the person in charge with the lowest work efficiency is longer.

If the person with the least work efficiency is longer, move one of the tasks of the person with the least work efficiency to the person with the shortest total work time among the other people. Then, the allocation unit 13 compares the total working time of the person in charge with the longest total working time with the total working time of the person in charge with the shortest total working time, and if the difference between the two is within a predetermined time, it is appropriate. Judges that it has been allocated to, and ends the process. If not, the work of the person in charge with the least work efficiency is moved to the person in charge with the shortest total work time at this point. After that, these processes are repeated until the predetermined time is reached.

Finally, the allocation unit 13 confirms whether the work is started in the order of priority on the person-in-charge basis, and if it is different, the work order is changed on the person-in-charge basis.

By the way, if it is judged that the closest time is longer than the total work time of the person in charge with the least 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 with poor work efficiency. Then, the allocation unit 13 compares the total working time of the person in charge with the longest total working time with the total working time of the person in charge with the shortest total working time, and if the difference between the two is within a predetermined time, it is appropriate. Judges that it has been allocated to, and ends the process.

On the other hand, if not, one of the tasks of the person in charge with the longest total work time at this point is moved to the person in charge with the least work efficiency. The allocation unit 13 repeats this process until it is determined that the process is within a predetermined time.

Finally, the allocation unit 13 confirms whether the work is started in the order of priority on the person-in-charge basis, and if it is different, the work order is changed on the person-in-charge basis.

Next, the allocation unit 13 confirms the overall work order from this state, and if the work is not started in the order of priority, selects the work order to be exchanged one by one among the persons in charge. Even if it is replaced, it is judged whether it is within the predetermined time, if it is within the predetermined time, it is replaced, and if not, it is abandoned. Further, the allocation unit 13 also determines whether the person in charge with the least efficiency is assigned the most priority work in the case of replacement, and the person in charge with the least priority work is the most inefficient. When it becomes a state where it is not allocated much, give up the replacement.

For example, as a result of checking the overall business order, when the business start order is the order of 1, 1, 1, 4, 3, 2 ... (Priority 1 is the highest). (When the work is high), it is determined whether the work of priority 2 can be replaced with the work of priority 3 or 4 (the work of the person in charge different from the person in charge of priority 2). That is, when a business having a low priority is to be started earlier than a business having a high priority, a decision is made to replace the business with these operations.

Then, the allocation unit 13 first determines whether the work of priority 2 and the work of priority 4 can be replaced. Even if they are replaced, when the difference between the total working hours of the person in charge with the longest total working hours and the total working hours of the person in charge with the shortest total working hours is within the specified time (and the most inefficient person in charge). (When the most assigned to the person), the allocation unit 13 replaces the work of priority 2 with the work of priority 4. As a result, the business order becomes 1,1,1,2,3,4 ... In order of priority.

On the other hand, when the difference does not fall within the predetermined time when the replacement is performed (or when the most inefficient person in charge is not allocated the most), the allocation unit 13 has a priority 2 task and a priority 4 task. Abandon the replacement with. Then, the allocation unit 13 executes the replacement determination between the work of priority 2 and the work of priority 3.

As a result, when the difference between the total working time of the person with the longest total working time and the total working time of the person with the shortest total working time is within the predetermined time (and the most inefficient person). When the work of priority 2 and the work of priority 3 are exchanged and the work is not allocated within the specified time (or when the most inefficient person is not assigned the most) The replacement of the work of priority 2 and the work of priority 3 is abandoned. As a result, the replacement process is not executed for the work of priority 2. Then, the allocation unit 13 determines whether or not the work has been started again in the order of priority, except for the one that has been abandoned (for example, the work of priority 2), and repeats the above processing.

Further, the process of starting the work within the waiting time is also the same as above, and the allocation unit 13 checks the whole, and if there is a work that is not started within the waiting time, it is started within the waiting time of this work. Make a replacement decision for all operations. Then, in the case of replacement, if the business is started within the waiting time on both sides of the replacement and the replacement is performed within the predetermined time, the replacement is performed.

On the other hand, if the business is not started within the waiting time or is not within the predetermined time, the replacement is abandoned. Then, except for the ones that have been abandoned, it is determined whether the business is started again within the waiting time, and the above processing is repeated.

If the replacement process is performed so that the operations are started in the order of priority, there is a possibility that the operations outside the waiting time may occur. In addition, if the replacement process is performed so that the work is started within the waiting time, there is a possibility that the work may not be in the order of priority. Therefore, only one of them may be performed, or if possible, one of them may be prioritized, and the other process may be executed as long as the contents adjusted by the one process are not destroyed.

Further, if there is only one business request after the above processing, if this is a priority business, it is first assigned to the person in charge who is the least efficient. Then, the same process as the above-mentioned process is executed. On the other hand, if it is not a priority work, the newly requested work is assigned to the person in charge with the shortest total work time in order to equalize the total work time. Then, a process for observing the above-mentioned priority or waiting time is executed.

In this way, according to the allocation device 1 according to the present embodiment, the person in charge with the lowest work efficiency is in charge of the request work in which the ratio of the completion time for each request work of another person to the person in charge with the lowest work efficiency is the largest. Priority is given to those who are assigned. Here, the ratio of the completion time for each requested work of the person in charge with the lowest work efficiency indicates the work efficiency of other persons in charge based on the person in charge with the lowest work efficiency. Therefore, it can be said that the request work with the highest ratio is the request work with a small difference between the person in charge with the lowest work efficiency and the other person in charge. Then, 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 carry out the requested work relatively efficiently. Therefore, it is possible to raise the level of the person in charge with low work efficiency, and it is possible to deal with customers more efficiently.

In particular, in the past, in order to efficiently carry out the requested work, the focus has tended to make full use of the person in charge with high work efficiency, but in this embodiment, how to utilize the person in charge with low work efficiency. The focus is on whether or not, and the aim is to respond to customers efficiently by raising the level of personnel with low operational efficiency. In the conventional case, the person in charge with high work efficiency becomes very busy, which may lead to an increase in stress of the person in charge with high work efficiency and dissatisfaction with the evaluation. In addition, the more people who can work, the busier they are and the less motivated each person in charge to improve their skills. However, in the case of the present embodiment, even a person in charge with low work efficiency raises the level, so that it is possible to reduce the possibility of increasing stress of the person in charge with high work efficiency and leading to dissatisfaction with the evaluation. .. In addition, the possibility of losing the motivation to improve skills can be reduced.

In addition, 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 as expected, the customer can be dealt with without feeling dissatisfied.

In addition, since the completion time is learned and updated sequentially to the learned completion time, if the technical ability of each person in charge improves and the completion time is shortened, this can be updated and requested appropriately. You can allocate work.

In addition, in order to allocate the request work to multiple persons in charge so that the request work with high priority is processed first, for example, in a hospital or clinic, it is desirable that the patient has a high severity and the waiting time is extremely short. It is possible to allocate the work so that the patient can be examined earlier, and the requested work can be allocated more appropriately.

Although the present invention has been described above based on the embodiments, the present invention is not limited to the above-described embodiments, and modifications may be made without departing from the spirit of the present invention.

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

Further, the program for operating the allocation device 1 in the present embodiment is not limited to the recording media of the ROM 10a, HDD 50, USB 60, and other devices, but is stored in other recording media such as a CD-ROM and a CD-R. You may be.

Further, in the present embodiment, the allocation device 1 has a learning function, but the present invention is not limited to this, and the allocation device 1 may not have a learning function.

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

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

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 unit 13b ... Ratio calculation unit 14 ... Learning unit (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 the work requested by the customer to multiple persons in charge.
A storage means that stores the completion time required for each of the plurality of persons in charge to complete the requested work for each type of the requested work, and
It is provided with an allocation means for allocating a plurality of the requested operations to the plurality of persons in charge.
The allocation means identifies the person with the lowest work efficiency from the plurality of persons in charge according to predetermined conditions based on the stored contents stored by the storage means, and the plurality of persons in charge with respect to the identified person in charge. Among them, the ratio of the completion time for each type of the requested work of the other person in charge other than the specified person in charge is calculated, and the requested work having the largest ratio is given priority to the specified person in charge. Moreover, the allocation device is characterized in that the requested work is allocated to the plurality of persons in charge so that the total time for the plurality of persons in charge to perform the requested work is equalized. It is an allocation device that allocates the request work corresponding to the customer to multiple 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 work efficiency specified from the plurality of persons in charge according to a predetermined condition is the lowest. A storage means for storing the ratio of the completion time for each type of the requested work of the person in charge other than the specified person in charge among the plurality of persons in charge, and a storage means.
The request work is given priority to the person in charge who has specified the request work having the largest ratio stored by the storage means, and the total time for the plurality of people in charge to perform the request work is equalized. And the allocation means for allocating to the plurality of persons in charge,
A allocating device characterized by being provided with. The storage means stores the waiting time data according to the customer's expectation of the requested business, and stores the waiting time data.
The claim is characterized in that 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 device according to either 1 or 2. Further provided with a learning means for learning the completion time required for the plurality of persons in charge to complete the requested work for each type of the requested work.
The allocation device 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 and stores the priority.
Claim 1 is characterized in that the allocation means allocates the request work to the plurality of persons in charge so that the request work having a high priority stored by the storage means is processed first. Item 4. The allocation device according to any one of items 4. It is an allocation program that allocates the request work corresponding to the customer to multiple persons in charge.
The completion time required for each of the plurality of persons in charge to complete the requested work is stored in the computer by the storage means stored for each type of the requested work from the plurality of persons in charge. The person in charge with the lowest work efficiency is specified according to a predetermined condition, and for the specified person in charge, the person in charge other than the specified person in charge is described for each type of the requested work. The ratio of the completion time is calculated, and the requested work having the largest ratio is given priority over the specified person in charge, and the total time for the plurality of persons in charge to perform the requested work is equalized. An allocation program characterized by realizing an allocation function that allocates requested work to the plurality of persons in charge. It is an allocation program that allocates the request work corresponding to the customer to multiple persons in charge.
The computer stores the completion time required for each of the plurality of persons in charge to complete the requested work for each type of the requested work, and the most work specified by the plurality of persons in charge according to a predetermined condition. The ratio stored by the storage means that stores the ratio of the completion time for each type of the requested work of the person in charge other than the specified person among the plurality of persons in charge with respect to the person in charge with low efficiency. Allocate the requested work to the plurality of persons in charge so that the largest requested work is given priority to the specified person in charge and the total time for the plurality of persons in charge to perform the requested work is equal. An allocation program characterized by realizing an allocation function. It is a computer-readable recording medium that stores an allocation program that allocates the request work corresponding to the customer to multiple persons in charge.
Based on the completion time for each type of the requested work required for each of the plurality of persons in charge to complete the requested work, the person in charge having the lowest work efficiency is assigned to the computer according to a predetermined condition from the plurality of persons in charge. The ratio of the completion time for each type of the requested work of the person in charge other than the specified person in charge to the specified person in charge is calculated, and the ratio is the highest. Allocate the requested work to the plurality of persons in charge so that the large requested work is prioritized over the specified person in charge and the total time for the plurality of persons in charge to perform the requested work is equal. A computer-readable recording medium that stores a allocation program that realizes the function. It is a computer-readable recording medium that stores an allocation program that allocates the request work corresponding to the customer to multiple persons in charge.
For the person with the lowest work efficiency identified on the computer based on the completion time for each type of the requested work required for each of the plurality of persons in charge to complete the requested work, the plurality of persons in charge Among them, the person in charge other than the specified person in charge has the largest ratio of the completion time for each type of the requested work, and the requested work has the largest priority over the specified person in charge, and the plurality of persons in charge. A computer-readable recording medium that stores an allocation program that realizes an allocation function that allocates the requested work to the plurality of persons in charge so that the total time for the person to perform the requested work is equalized.

Images