Task allocation method and task allocation program
By grouping workers and optimizing task difficulty distributions in stages, the method enhances task assignment accuracy and reduces processing time, addressing the limitations of conventional independent division unit optimization.
Patent Information
- Application Number
- JP2023081225
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-17
- Publication Date
- 2024-11-28
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
Conventional task assignment methods lack accuracy due to independent optimization processing for each division unit without cooperation between units, leading to lower optimization results when time is divided into increments.
A task assignment method that groups workers into multiple groups, calculates a first target difficulty level distribution for each group, and assigns tasks to approach a group goal difficulty distribution, followed by assigning tasks to individual workers based on their proficiency levels to achieve a second target difficulty distribution.
Improves optimization accuracy while reducing processing time by dividing the task assignment process into stages that consider both group and individual worker proficiency, maintaining the same level of accuracy as a single-stage process.
Smart Images

Figure 2024165239000001_ABST
Abstract
Description
[Technical field]
[0001] The present invention relates to a task allocation method and a task allocation program. [Background technology]
[0002] Linear programming has been known as a method for optimally allocating tasks to workers while considering both productivity and proficiency. In recent years, a technology has been developed to reduce the time required for optimization calculations when formulating staffing plans for logistics centers by dividing a day's work time into 30-minute intervals and optimizing each division. [Prior art documents] [Patent documents]
[0003] [Patent Document 1] International Publication No. 2019 / 064379 Summary of the Invention [Problem to be solved by the invention]
[0004] In the conventional method described above, the optimization process is performed for each division unit independently, and there is no coordination between the division units. Therefore, the accuracy of the conventional method described above is lower than when the optimization process is performed without dividing the work time.
[0005] In one aspect, the present invention aims to improve the accuracy of optimization. [Means for solving the problem]
[0006] In one aspect, a task allocation method by a computer is provided, in which the computer groups workers into a plurality of groups, synthesizes first target difficulty distributions of workers included in each of the plurality of groups to generate a group target difficulty distribution, assigns a plurality of tasks to the group such that the distribution of task difficulty approaches the group target difficulty distribution, generates a second target difficulty distribution for the workers based on the distribution of difficulty of the plurality of tasks assigned to the group and the first target difficulty distribution for the workers, and assigns the plurality of tasks to each worker included in the group such that the distribution of task difficulty approaches the second target difficulty distribution. Effect of the Invention
[0007] The accuracy of the optimization can be improved. [Brief description of the drawings]
[0008] [Figure 1] FIG. 1 illustrates an example of a system configuration of a task allocation system according to a first embodiment. [Diagram 2] FIG. 2 is a first diagram illustrating an overview of task allocation according to the first embodiment. [Diagram 3] FIG. 11 is a second diagram illustrating an overview of task allocation according to the first embodiment. [Figure 4] FIG. 11 is a third diagram illustrating an overview of task allocation according to the first embodiment. [Diagram 5] FIG. 2 illustrates an example of a hardware configuration of a task allocation device according to the first embodiment. [Figure 6] FIG. 4 illustrates an example of a worker skill database according to the first embodiment; [Figure 7] FIG. 4 is a diagram illustrating an example of a task difficulty level database according to the first embodiment. [Figure 8] FIG. 4 illustrates an example of a productivity database according to the first embodiment; [Figure 9] FIG. 2 is a diagram illustrating a functional configuration of an allocation processing unit according to the first embodiment. [Figure 10] 4 is a first flowchart illustrating a process of the task allocation device according to the first embodiment. [Figure 11] 11 is a second flowchart illustrating the process of the task allocation device of the first embodiment. [Figure 12] 10 is a flowchart illustrating a process of a task allocation device according to a second embodiment. [Figure 13] FIG. 11 is a diagram illustrating group creation according to the second embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0009] First Embodiment The first embodiment will be described below with reference to the drawings. Fig. 1 is a diagram showing an example of a system configuration of a task allocation system according to the first embodiment.
[0010] The task allocation system 1 of this embodiment includes a task allocation device 100 and a terminal device 300, both of which are connected via a network or the like.
[0011] The task allocation device 100 of this embodiment allocates optimal tasks to large-scale resources. In this embodiment, resources are tasks and workers who are responsible for the tasks.
[0012] The task allocation device 100 of this embodiment includes a worker proficiency database 110, a task difficulty database 120, a productivity database 130, and an allocation processing unit 140.
[0013] The worker proficiency database 110 stores proficiency information indicating the proficiency of each worker for a task. The task difficulty database 120 stores difficulty information indicating the difficulty of each task assigned to a worker. The productivity database 130 stores productivity information indicating the relationship between the worker's proficiency and the difficulty of a task.
[0014] Each piece of information stored in the worker proficiency database 110, the task difficulty database 120, and the productivity database 130 may be input in advance from the terminal device 300.
[0015] When proficiency information, difficulty information, and productivity information are input from the terminal device 300, the allocation processing unit 140 assigns optimal tasks to each worker taking into consideration the improvement of the worker's proficiency and productivity, and outputs the allocation results to the terminal device 300.
[0016] More specifically, the allocation processing unit 140 refers to the worker proficiency database 110 to create groups of a plurality of workers according to their proficiency, and assigns tasks to each group. At this time, the allocation processing unit 140 ensures that the distribution of the difficulty of the tasks assigned to the groups corresponds to the proficiency of the workers included in the group. In the following description, the process of assigning tasks to each group of workers is referred to as a first allocation process.
[0017] Next, the assignment processing unit 140 assigns the tasks assigned to each group to each worker included in the group. At this time, the assignment processing unit 140 assigns tasks to each worker so as to achieve an optimal assignment taking into consideration the viewpoints of productivity and improvement of the worker's proficiency. In the following description, the process of assigning tasks to each worker included in a group is referred to as a second assignment process.
[0018] In this embodiment, the allocation process for allocating a large number of tasks to a large number of workers is divided into a first allocation process in the front stage and a second allocation process in the back stage, which makes it possible to reduce the scale of the linear programming problem and shorten the time required for optimization calculations.
[0019] In addition, in this embodiment, the second allocation process is performed using the result of the first allocation process after the first allocation process, so the first allocation process and the second allocation process are linked processes. Therefore, according to this embodiment, it is possible to obtain an optimization result with the same degree of accuracy as when the allocation process is performed all at once without being divided into an earlier stage and a later stage.
[0020] 1, the task allocation device 100 is realized by one information processing device, but is not limited to this. The task allocation device 100 may be realized by multiple information processing devices. Also, in the example of Fig. 1, each database is provided in the task allocation device 100, but is not limited to this. Each database may be provided in part or in whole in an external device capable of communicating with the task allocation device 100.
[0021] An overview of the processing of the allocation processing unit 140 of this embodiment will be described below with reference to FIGS.
[0022] 2 is a first diagram illustrating an overview of task allocation according to the first embodiment. The allocation processing unit 140 refers to the worker proficiency database 110, creates multiple groups of workers so that workers with similar proficiency levels are grouped together, and allocates a task group (task group) 20 to each group (first allocation process).
[0023] In the example of FIG. 2, the allocation processing unit 140 allocates the task group 21 included in the task group 20 to the group 1, and allocates the task group 22 included in the task group 20 to the group 2 in the first allocation process.
[0024] Here, the distribution of the difficulty levels of the tasks included in the task group 21 corresponds to the proficiency levels of the workers included in the group 1.
[0025] Next, in a second allocation process, the allocation processing unit 140 allocates the tasks allocated to the group to each worker included in the group.
[0026] 2, group 1 includes workers A and B. Also in the example of Fig. 2, worker A is assigned task group 23 included in task group 21 assigned to group 1, and worker B is assigned task group 24 included in task group 21. Also in the example of Fig. 2, group 2 includes worker F, and worker F is assigned task group 25 included in task group 22 assigned to group 2.
[0027] Here, the distribution of difficulty levels of the individual tasks included in task group 23 corresponds to the proficiency level of worker A, the distribution of difficulty levels of the individual tasks included in task group 24 corresponds to the proficiency level of worker B, and the distribution of difficulty levels of task group 25 corresponds to the proficiency level of worker F. Note that in the example of Fig. 2, multiple tasks (task groups) are assigned to each of workers A, B, and F.
[0028] 3 is a second diagram illustrating the outline of task allocation according to the first embodiment, in which the first allocation process and the second allocation process are further described.
[0029] The allocation processing unit 140 executes a first allocation process (step S1), and then executes a second allocation process (step S2).
[0030] In the first allocation process, the allocation processing unit 140 refers to the worker proficiency database 110 to create groups of workers with similar proficiency levels (step S11). The allocation processing unit 140 also refers to the worker proficiency database 110 and the task difficulty database 120 to calculate a distribution of target task difficulty levels for each worker (step S12). In the following description, the distribution of task difficulty levels calculated in step S12 is referred to as a first target difficulty distribution. The calculation of the first target difficulty distribution will be described in detail later.
[0031] A graph 31 shown in FIG. 3 illustrates an example of the first target difficulty level distribution calculated for each of workers A, B, and C included in group 1 in step S12.
[0032] In the graph 31, the vertical axis indicates the number of tasks, and the horizontal axis indicates the difficulty of the tasks. In the first target difficulty distribution 31A of the worker A, there are more tasks with lower difficulty than in the first target difficulty distribution 31B of the worker B and the first target difficulty distribution 31C of the worker C. In addition, in the first target difficulty distribution 31C, there are more tasks with higher difficulty than in the first target difficulty distribution 31A and the first target difficulty distribution 31B. This shows that, among the workers A, B, and C, the worker A has the lowest proficiency level, and the worker C has the highest proficiency level. In the example of FIG. 3, the workers A, B, and C are assumed to be workers included in group 1.
[0033] Next, the allocation processing unit 140 calculates the distribution of the difficulty of the target task for each group using the first target difficulty distribution for each worker (step S13). In the following description, the distribution of the difficulty of the task for each group is called the group target difficulty distribution. The calculation of the group target difficulty distribution will be described in detail later.
[0034] 3, in graph 32, group target difficulty distribution 32-1 is the group target difficulty distribution of group 1. Group target difficulty distribution 32-1 is the sum of the first target difficulty distributions of each worker included in group 1. Specifically, group target difficulty distribution 32-1 is the sum of first target difficulty distribution 31A, first target difficulty distribution 31B, and first target difficulty distribution 31C.
[0035] Next, the allocation processing unit 140 allocates a task group to each group so as to approximate the group target difficulty distribution for each group (step S14).
[0036] Graph 33-1 shown in Fig. 3 is the result of assignment to group 1 so as to approximate group target difficulty distribution 32-1, and shows the distribution of the difficulty of the task group assigned to group 1. Graph 33-2 shown in Fig. 3 is the result of assignment to group 2 so as to approximate group target difficulty distribution of group 2, and shows the distribution of the difficulty of the tasks assigned to group 2.
[0037] In this embodiment, the distribution of the difficulty levels of the tasks assigned to each group in the above manner is called an assignment result difficulty distribution.
[0038] Next, the allocation processing unit 140 performs a second allocation process. The second allocation process is a process executed for each group.
[0039] The allocation processing unit 140 calculates a second target difficulty distribution for each worker based on the first target difficulty distribution for the worker and the allocation result difficulty distribution of the group to which the worker belongs (step S21).
[0040] Specifically, the allocation processing unit 140 calculates a distribution in which the number of tasks for each difficulty level is equally divided by the number of workers included in the group, from the group's allocation result difficulty distribution. The distribution for each worker calculated here is a target difficulty distribution for equally dividing the tasks among workers. In the following description, the target difficulty distribution for equally dividing the tasks among workers is referred to as the target difficulty distribution for equal division.
[0041] The allocation processing unit 140 adjusts the target difficulty distribution for equal division so that it becomes a distribution according to the worker's level of skill, and sets the adjusted target difficulty distribution for equal division as the second target difficulty distribution for the worker.
[0042] Here, the proficiency levels of workers A, B, and C are reflected in first target difficulty distribution 31A for worker A, first target difficulty distribution 31B for worker B, and first target difficulty distribution 31C for worker C, and it can be seen that the proficiency levels are highest for worker C, followed by worker B and finally worker A.
[0043] Therefore, the allocation processing unit 140 shifts the distribution obtained by equally dividing the group target difficulty distribution by the number of workers included in the group according to the proficiency of the workers. In other words, the allocation processing unit 140 creates a distribution in which the number of tasks for each difficulty level in the group target difficulty distribution is equally divided by the number of workers included in the group, and shifts the created distribution according to the proficiency of the workers.
[0044] As a result, as shown in graph 34, the difficulty level at which the number of tasks is maximum in worker A's second target difficulty distribution 34A is lower than the difficulty level at which the number of tasks is maximum in worker B's second target difficulty distribution 34B and worker C's second target difficulty distribution 34C.
[0045] Moreover, the difficulty level at which the number of tasks is maximum in the second target difficulty distribution 34B for worker B is lower than that in the second target difficulty distribution 34C for worker C.
[0046] In this way, the proficiency levels of workers A, B, and C are reflected in second target difficulty distributions 34A, 34B, and 34C.
[0047] 3. Second target difficulty distribution 34F and second target difficulty distribution 34G shown in graph 34-2 of FIG.
[0048] The difficulty level at which the number of tasks is maximum in the second target difficulty distribution 34F for worker F is lower than the difficulty level at which the number of tasks is maximum in the second target difficulty distribution 34G for worker G, indicating that in group 2, worker G has a higher level of proficiency than worker F.
[0049] Next, the allocation processing unit 140 allocates the assigned task group to the group based on the second target difficulty distribution for each worker included in the group (step S22).
[0050] An example of the result of task allocation as shown in Figures 2 and 3 will be shown below with reference to Figure 4. Figure 4 is a third diagram for explaining the outline of task allocation in the first embodiment.
[0051] Fig. 4 shows a case where 30 tasks are assigned to five workers. More specifically, the 30 tasks include 10 tasks with low difficulty, 10 tasks with medium difficulty, and 10 tasks with high difficulty. The five workers are grouped into group 1 for workers with low proficiency, group 2 for workers with medium proficiency, and group 3 for workers with high proficiency. Group 1 includes workers A, B, and C, group 2 includes worker F, and group 3 includes worker G.
[0052] An allocation result 41 shown in FIG. 4 indicates the result of allocating tasks to each group based on the group target difficulty distribution of each group calculated in the first allocation process by the allocation processing unit 140.
[0053] An allocation result 41 indicates the result of allocating tasks included in the task set 30 to groups 1 to 3 based on the group target difficulty distributions of groups 1 to 3 in the first allocation process.
[0054] In the allocation result 41, eight low difficulty tasks are assigned to group 1, two low difficulty tasks, two medium difficulty tasks, and one high difficulty task are assigned to group 2, and eight medium difficulty tasks and nine high difficulty tasks are assigned to group 3. Thus, in the allocation result 41, it can be seen that low difficulty tasks are assigned to groups of workers with low proficiency, and high difficulty tasks are assigned to groups of workers with high proficiency.
[0055] 4 shows a distribution in which the number of tasks for each difficulty level in the allocation result difficulty distribution obtained from the allocation result for each group is equally divided by the number of workers included in the group. The allocation processing unit 140 allocates the tasks allocated to each group to each worker based on a second target difficulty distribution for each worker obtained by shifting the target difficulty distribution for each worker 42 in accordance with the proficiency of each worker.
[0056] An allocation result 43 shown in FIG. 4 indicates the result of the allocation processing unit 140 allocating tasks to each worker in the second allocation process.
[0057] This result is similar to the result obtained when 30 tasks are assigned to five workers at once.
[0058] In this embodiment, the task allocation process is performed on a group-by-group basis, and then the tasks assigned to the group are assigned to each worker included in the group, thereby shortening the processing time of the allocation process while improving the accuracy of optimization.
[0059] Next, the task allocation device 100 of this embodiment will be described with reference to Figures 5 to 9. Figure 5 is a diagram showing an example of the hardware configuration of the task allocation device of the first embodiment.
[0060] The task allocation device 100 of this embodiment is a computer including an input device 11, an output device 12, a drive device 13, an auxiliary storage device 14, a memory device 15, an arithmetic processing device 16 and an interface device 17, all of which are interconnected via a bus B.
[0061] The input device 11 is a device for inputting various types of information and is realized, for example, by a keyboard, a pointing device, etc. The output device 12 is for outputting various types of information and is realized, for example, by a display, etc. The interface device 17 includes a LAN card, etc., and is used for connecting to a network.
[0062] The program that realizes the assignment processing unit 140 etc. of the task assignment device 100 is at least a part of various programs that control the task assignment device 100. The program is provided, for example, by distribution of a recording medium 18 or by downloading from a network. The recording medium 18 on which the program is recorded can be of various types, including recording media that optically, electrically or magnetically record information, such as a CD-ROM, a flexible disk, a magneto-optical disk, etc., and semiconductor memories that electrically record information, such as a ROM, a flash memory, etc.
[0063] When the recording medium 18 on which the program is recorded is set in the drive device 13, the program recorded on the recording medium 18 is installed in the auxiliary storage device 14 from the recording medium 18 via the drive device 13. A program downloaded from the network is installed in the auxiliary storage device 14 via the interface device 17.
[0064] The auxiliary storage device 14 realizes the worker proficiency database 110, the task difficulty database 120, the productivity database 130, etc., and stores the programs installed in the task allocation device 100 as well as various files, data, etc. required by the task allocation device 100. The memory device 15 reads out and stores the programs from the auxiliary storage device 14 when the task allocation device 100 is started. The arithmetic processing device 16 realizes various processes, which will be described later, in accordance with the programs stored in the memory device 15.
[0065] 6 is a diagram showing an example of the worker proficiency database of the first embodiment. The worker proficiency database 110 of this embodiment has worker IDs and proficiencies as information items, and stores proficiency information that associates the two. The value of the item "worker ID" is identification information that identifies the worker. The item "proficiency" is an index value that indicates the proficiency of the worker.
[0066] 7 is a diagram showing an example of the task difficulty database of the first embodiment. The task difficulty database 120 of this embodiment includes, as information items, a case group ID and a difficulty level, and stores difficulty information that associates the two.
[0067] The value of the item "case group ID" is identification information for identifying a group of tasks. In the following description, a group of tasks identified by a case group ID may be referred to as a case group.
[0068] The value of the item "Difficulty" indicates the difficulty of the group of tasks indicated by the case group ID. In this embodiment, a case group ID and a difficulty are assigned to a group of tasks, but this is not limited to this. In the task difficulty database 120, identification information for identifying each task may be associated with the difficulty of each task.
[0069] 8 is a diagram showing an example of the productivity database of the first embodiment. The productivity database 130 of this embodiment stores productivity information that associates the difficulty of a task, the proficiency of a worker, and a productivity index value. The productivity index value may be a value determined according to the content of the task, and is a value that serves as an index of the work efficiency of the worker.
[0070] Specifically, the productivity index value may be, for example, the number of inquiries made by a worker when executing a task.
[0071] 8, when the difficulty level of a case group identified by a case group ID is "1.0" and the worker has a low level of proficiency, the index value indicating productivity is "4." In contrast, when the difficulty level of a case group identified by a case group ID is "1.0" and the worker has a high level of proficiency, the index value indicating productivity is "2."
[0072] 9 is a diagram illustrating the functional configuration of an assignment processing unit of the first embodiment. The assignment processing unit 140 of the task assignment device 100 of the present embodiment includes an input receiving unit 150, a first processing unit 160, a second processing unit 170, and an output unit 180.
[0073] The input receiving unit 150 receives various inputs to the task allocation device 100. Specifically, for example, the input receiving unit 150 may receive inputs of skill information, difficulty level information, and productivity information from the terminal device 300.
[0074] The first processing unit 160 executes a first allocation process. The first processing unit 160 includes a group creation unit 161, a first distribution calculation unit 162, a group distribution calculation unit 163, and a group allocation unit 164.
[0075] The group creation unit 161 creates groups of workers with similar proficiency levels by referring to the worker proficiency database 110. The first distribution calculation unit 162 calculates a first target difficulty distribution for each worker based on the worker proficiency database 110. The group distribution calculation unit 163 calculates a group target difficulty distribution for each group of workers based on the first target difficulty distribution for each worker. The group allocation unit 164 allocates a case group identified by a case group ID in the task difficulty database 120 to each group according to the group target difficulty distribution for each group.
[0076] The second processing unit 170 executes the second allocation process. The second processing unit 170 includes a second distribution calculation unit 171 and a worker allocation unit 172.
[0077] The second distribution calculation unit 171 calculates a second target difficulty distribution from an allocation result difficulty distribution indicated by the result of the allocation of tasks to each group by the first processing unit 160 and the first target difficulty distribution.
[0078] The worker allocation unit 172 allocates the tasks allocated to each group to each worker included in the group based on the second target difficulty distribution.
[0079] The output unit 180 outputs the allocation result for each worker by the second processing unit 170 to the terminal device 300 or the like. Note that the output unit 180 may output the task allocation result for each group by the first processing unit 160. Furthermore, the output destination of the allocation result by the output unit 180 may be other than the terminal device 300, and the output destination may be, for example, an output device included in the task allocation device 100.
[0080] Next, the processing of the task allocation device 100 of this embodiment will be described with reference to Fig. 10. Fig. 10 is a first flowchart illustrating the processing of the task allocation device of the first embodiment.
[0081] The assignment processing unit 140 of the task assignment device 100 of this embodiment accepts input of proficiency information, difficulty information, and productivity information via the input accepting unit 150, and stores the information in the worker proficiency database 110, the task difficulty database 120, and the productivity database 130, respectively (step S1001).
[0082] In other words, the input receiving unit 150 receives input of the number of workers to whom tasks are assigned, the proficiency of the workers, the number of tasks to be assigned, the difficulty of the tasks, and the productivity index values corresponding to the proficiency of the workers and the difficulty of the tasks. Note that the process of step S1001 may be performed at a timing independent of the timing of the processes from step S1002 onward. In other words, the worker proficiency database 110, the task difficulty database 120, and the productivity database 130 may store proficiency information, difficulty information, and productivity information in advance.
[0083] Next, the allocation processing unit 140 causes the group creation unit 161 of the first processing unit 160 to refer to the worker proficiency database 110 to create groups of workers with similar proficiency levels, and obtains the number of groups created and the number of workers included in the groups (step S1002).
[0084] In the following description, the number of groups of workers created in the process of step S1002 is denoted by Dmax, and the number of workers included in the div-th group is denoted by Pnum(div). Details of step S1002 will be described later.
[0085] Next, the allocation processing unit 140 sets the mean μ and standard deviation σ of the probability density function of the normal distribution by the first distribution calculation unit 162 of the first processing unit 160, and calculates a first target difficulty level distribution for each worker (step S1003).
[0086] In this embodiment, the first target difficulty distribution is determined according to the proficiency of the worker from the viewpoint of improving productivity and proficiency.
[0087] When determining a target difficulty distribution of tasks to be assigned to a worker from the viewpoint of productivity, the difficulty of the task corresponding to the proficiency of the worker may be set as the median value of the task difficulty distribution.
[0088] On the other hand, recent research has shown that the degree of improvement in a worker's proficiency is maximized when the worker is given problems for which the correct answer rate is 85%.
[0089] Therefore, in this embodiment, a first target difficulty distribution for a worker is calculated so that a task that is slightly more difficult than the worker's proficiency level is given to the worker.
[0090] Specifically, the first distribution calculation unit 162 determines, as the first target difficulty distribution for the worker, a normal distribution whose central value is a value obtained by adding an appropriate value to the difficulty of the task corresponding to the worker's current proficiency.
[0091] In this embodiment, the difference between the maximum and minimum proficiency values in the proficiency information stored in the worker proficiency database 110 is about 2.0. Therefore, in this embodiment, an appropriate value is set to 0.2, which is 1 / 10 of the difference between the maximum and minimum proficiency values, and a normal distribution whose center value is the value obtained by adding 0.2 to the difficulty of the task corresponding to the worker's current proficiency is set as the first target difficulty distribution for the worker. Note that the center value and distribution shape of the normal distribution may be different values and distributions depending on the nature of the task.
[0092] The probability density function of the normal distribution, which is the distribution of the first target difficulty of the worker, is expressed as Equation 1. Here, α is a random variable, μ is the mean, and σ is the standard deviation.
number
number
[0093] Next, the first processing unit 160 calculates a group target difficulty distribution for each group by the group distribution calculation unit 163 (step S1004). Specifically, the group distribution calculation unit 163 obtains the group target difficulty distribution of the div-th worker group Ddiv from an accumulation of the first target difficulty distributions for each worker in the group.
[0094] The group target difficulty distribution for each group is given by the following formula 3 using the ratio NormrateP(p,r) of the first target difficulty distribution for worker p.
number
[0095] In this embodiment, the tasks assigned to the div-th group by linear programming are expressed as follows:
[0096] When the qth task of the case group r is assigned, x(div,q,r)=1 If the qth task in case group r is unassigned, then x(div,q,r)=0 In this case, the total number of tasks assigned to the div-th group is given by the following formula 4.
number
number
[0097] In this embodiment, if the difference between the target difficulty distribution of the number of tasks assigned to a group and the difficulty distribution of the actual number of tasks is zero, it can be considered that optimal tasks have been assigned from the two perspectives of improving productivity and proficiency.
[0098] Therefore, the group allocation unit 164 sets an objective function that minimizes the difference between the target distribution of difficulty of the number of tasks in the group and the distribution of difficulty of the actual number of tasks. If the variable to be optimized is z, the objective function is given by the following equation 6.
number
number
[0099] (1) One group will be responsible for one task (no multiple groups will be responsible for each task) (2) Productivity is to be above the target threshold.
[0100] (3) Divide the work hours according to the number of workers in each group (allocate the work hours evenly according to the number of workers) (4) Assign all tasks (the number of unassigned tasks will be zero) (5) Each group will be responsible for at least one case.
[0101] Constraint condition (1) is expressed by the following equation 8.
[0102] x(div,q,r)≦0,1 Equation 8 Constraint condition (2) is expressed by the following formula 9. Here, kth is the threshold value of the productivity index value. L(div, r) is the expected value of the productivity index value when the worker in the div-th group is in charge of project group r.
number
number
[0103] The constraint (4) is expressed by the following equation 11.
number
number
[0104] The first allocation process by the first processing unit 160 of the allocation processing unit 140 has been described above.
[0105] Next, the allocation processing unit 140 calculates a target difficulty distribution G for equally allocating the job groups to the workers included in each group, using the second distribution calculation unit 171 of the second processing unit 170 based on the result of the first allocation processing. div(p, r) is calculated (step S1008).
[0106] In other words, the worker allocation unit 172 calculates a target difficulty distribution G for equal division for equally allocating tasks to workers based on an allocation result difficulty distribution indicating the distribution of the difficulty of the tasks allocated to each group. div Calculate (p,r).
[0107] Target difficulty distribution G for equal division div (p, r) is calculated by the following formula 13. In formula 13, pnum div represents the number of workers in the div-th group.
number
[0108] In this embodiment, the shift amount sft(p) is calculated using μ in the probability density function f(α, μ, σ) of normal distribution set for each worker. When μ of a certain worker p is given as μ(p), the shift amount sft(p) is given by the following formula 14. In formula 14, μ ave (div) indicates the average μ of all workers in the div-th group.
number
[0109] Next, the worker allocation unit 172 of the second processing unit 170 sets an objective function and constraint conditions that express a linear programming problem for allocating tasks to workers included in each group (step S1010).
[0110] In step S1010, similar to the process in step S1006 in Fig. 10, the objective function of the linear programming is set so as to minimize the difference between the second target difficulty distribution for each worker and the distribution of the difficulty of the actual number of tasks. If the difference between the second target difficulty distribution for each worker and the distribution of the difficulty of the actual number of tasks is zero, it can be considered that the optimal tasks have been assigned from the two perspectives of improving productivity and proficiency.
[0111] If the variable to be optimized is denoted by z, the objective function is given by the following formula 15. In formula 15, Pmax is the number of workers in the group under consideration, R is the number of job groups, and p indicates the pth worker.
number
number
[0112] (1) One task is handled by one worker (not by multiple workers) (2) The average work hours of the workers in each group are made equal to the average work hours of all workers.
[0113] (3) The number of man-hours of each worker in each group is set to be equal to the average man-hours of the workers in the group. (4) Assign all tasks (the number of unassigned tasks will be zero) The constraint (1) is expressed by the following equation 17.
[0114] x(p,q,r)≦0,1 Equation 17
number
[0115] The constraint (3) is expressed by the following equation 19.
number
number
[0116] The above is the second allocation process by the second processing unit 170 of the allocation processing unit 140.
[0117] Next, the processing of the group creation unit 161 of the first processing unit 160 will be described with reference to Fig. 11. Fig. 11 is a second flowchart illustrating the processing of the task allocation device of the first embodiment. Fig. 11 shows details of step S1002 in Fig. 10.
[0118] In this embodiment, the group creation unit 161 of the first processing unit 160 refers to the worker skill database 110 (step S1101), and obtains the maximum and minimum skill values (step S1102).
[0119] Next, the group creating unit 161 sets div=2 (Step S1103). Div indicates the number of groups.
[0120] Next, the group creating unit 161 divides the difference between the maximum and minimum values of the proficiency level into div units, and creates groups of workers (step S1104).
[0121] Next, the group creating unit 161 determines whether the number of workers in the group is equal to or less than a predetermined number (step S1105). In the example of Fig. 11, the predetermined number is set to 10. The predetermined number may be set in advance.
[0122] In step S1105, if the number of workers in the group is not equal to or less than the predetermined number, that is, if the number of workers in the group is greater than the predetermined number, group creating section 161 sets div=div+1 (step S1106) and returns to step S1104.
[0123] In step S1105, if the number of workers in the group is equal to or less than the predetermined number, group creating section 161 ends the process.
[0124] In this embodiment, groups of workers are created so that the proficiency levels of the workers in each group are equal. Therefore, according to this embodiment, when tasks are assigned to each group, the proficiency levels of the workers in the group can be reflected, and a group target difficulty distribution suitable for the tasks can be generated.
[0125] Furthermore, in this embodiment, in the first allocation process, a group target difficulty distribution of the tasks to be assigned to the groups is calculated, and tasks are assigned to each group so that the difficulty distribution of the tasks actually assigned to the group is brought closer to the group target difficulty distribution.
[0126] Next, in this embodiment, in the second allocation process, a second target difficulty distribution for each worker that reflects the proficiency of each worker is calculated from the difficulty distribution of the tasks actually assigned to the group. Then, in this embodiment, tasks are assigned to each worker so that the difficulty distribution of the tasks actually assigned to each worker approaches the second target difficulty distribution.
[0127] In other words, in this embodiment, after tasks are assigned to each group based on the group target difficulty distribution for each group that takes into account the worker's proficiency and the difficulty of the tasks, a second target difficulty distribution that takes into account the worker's proficiency is re-generated for each worker included in each group.
[0128] Therefore, according to this embodiment, the second target difficulty distribution can be made closer to the distribution of task difficulty in the result of task allocation to workers. In other words, in this embodiment, the second target difficulty distribution can be made closer to the difficulty distribution indicated by the final allocation result. Therefore, according to this embodiment, the overall processing time for optimization can be shortened, and the accuracy of optimization can be improved.
[0129] Second Embodiment The second embodiment will be described below with reference to the drawings. The second embodiment of the present invention differs from the first embodiment in that a hierarchy is set for groups of workers, and the allocation process is divided according to the hierarchy of the groups. In the following description of the second embodiment, the differences from the first embodiment will be described, and the same reference numerals as those used in the description of the first embodiment will be given to components having the same functional configuration as the first embodiment, and the description thereof will be omitted.
[0130] FIG. 12 is a flowchart illustrating the process of the task allocation device of the second embodiment.
[0131] Steps S1201 and S1202 in FIG. 12 are similar to steps S1101 and S1102 in FIG. 11, and therefore will not be described.
[0132] Following step S1202 in FIG. 12, the group creating unit 161 of the first processing unit 160 in this embodiment determines whether the number of groups has exceeded a predetermined upper limit (step S1203).
[0133] In step S1203, if the total number of groups exceeds the upper limit, the group creating unit 161 creates a higher-level group with the same level of proficiency (step S1204), and the process returns to step S1203.
[0134] If the total number of groups does not exceed the upper limit in step S1203, group creating section 161 ends the process.
[0135] The creation of a group in this embodiment will be further described below with reference to Fig. 13. Fig. 13 is a diagram for explaining the creation of a group in the second embodiment.
[0136] 13 shows, for example, a case where 500 workers are grouped into groups of 10 workers each. In this case, the number of groups of workers is 50, and the number of upper groups is 5.
[0137] In this case, the allocation processing unit 140 first performs a process of allocating tasks to each group included in the higher-level group 131. Next, the allocation processing unit 140 performs a process of allocating tasks to each group included in the lower-level group 132 using the allocation results for each group included in the higher-level group 131.
[0138] Then, the allocation processing unit 140 uses the allocation results for each group included in the lower group 132 to perform a process of allocating tasks to workers included in each group included in the lower group 132 .
[0139] In the following description, the process of allocating a task to a higher-level group is referred to as a higher-level allocation process, and the process of allocating a task to a lower-level group is referred to as a lower-level allocation process. Both the higher-level allocation process and the lower-level allocation process are processes included in the first allocation process.
[0140] The process of the allocation processing unit 140 when the first allocation process is divided into two as described above will be described below.
[0141] First processing unit 160 calculates a top group target difficulty distribution for each top group in group distribution calculation unit 163. The group target difficulty distribution of the top group is obtained by accumulating the first target difficulty distributions of all workers included in groups subordinate to the top group.
[0142] Specifically, the group target difficulty distribution of the top group is given by the following formula 21 using the ratio NormrateP(p,r) of the first target difficulty distribution of the worker p.
number
[0143] In this embodiment, the total number of tasks assigned to the div-th group by linear programming is expressed by Equation 4.
[0144] Furthermore, the target difficulty distribution s(div,r) of the number of tasks in the div-th top group is given by the following formula 22 using the ratio NormrateH(div,r) of the top group target difficulty distribution.
number
[0145] Next, a description will be given of the lower-level allocation process by the first processing unit 160. In the lower-level allocation process, a lower-group target difficulty distribution for the lower groups is calculated using the result of the task allocation to the higher-level groups in the higher-level allocation process.
[0146] In the sub-allocation process, the sub-group target difficulty distribution S of the sub-groups included in the div-th supergroup Ddiv (p, r) is given by the following formula 23. In formula 23, pnum Hdiv represents the number of elements in the div-th upper group.
number
[0147] Next, the allocation processing unit 140 calculates a target difficulty distribution S for equal division for equally dividing the case groups among the workers included in each group, based on the result of the allocation of the case groups to the lower groups, by the second distribution calculation unit 171 of the second processing unit 170. pdiv Calculate (p,r). The target difficulty distribution S for equal division pdiv (p, r) is given by the following formula 24. In formula 24, pnum Ddiv represents a worker in the div-th subgroup.
number
[0148] Next, the worker allocation unit 172 allocates tasks to the workers using the second target difficulty distribution Sdiv(p,r) for each worker. The process of allocating tasks to workers is the same as in the first embodiment.
[0149] In this manner, in this embodiment, by providing hierarchical levels to the groups of workers, the number of divisions into which the allocation process is performed can be increased, and the processing time can be shortened while maintaining the precision of optimization. Note that, in this embodiment, the number of hierarchical levels of the groups may be any number. The disclosed technology may take the following forms as described below. (Appendix 1) 1. A method for computer-implemented task allocation, comprising: Group workers into multiple groups, generating a group target difficulty distribution by synthesizing the first target difficulty distributions of the workers included in each group for the plurality of groups; assigning a plurality of tasks to the group such that a distribution of task difficulty approaches a target difficulty distribution for the group; generating a second target difficulty distribution for the worker based on a distribution of the difficulty levels of the plurality of tasks assigned to the group and the first target difficulty distribution for the worker; A task allocation method, comprising: allocating the plurality of tasks to each worker included in the group such that a distribution of task difficulty levels approaches the second target difficulty distribution. (Appendix 2) 2. The task allocation method according to claim 1, wherein the plurality of groups are grouped according to the worker's level of proficiency with respect to the task based on proficiency information indicating the level of proficiency of each worker with respect to the task. (Appendix 3) The second target difficulty distribution is Evenly distributing the distribution of difficulty levels of the plurality of tasks assigned to the group among the workers included in the group; 3. A task allocation method according to claim 1 or 2, wherein the distributed distribution is generated by shifting the distributed distribution in accordance with the proficiency of the worker indicated by the first target difficulty distribution. (Appendix 4) A task allocation method described in any one of appendices 1 to 3, wherein the first target difficulty distribution is generated by referring to proficiency information indicating each worker's proficiency with the tasks and difficulty information indicating the difficulty of the tasks. (Appendix 5) the plurality of groups have a hierarchy of upper groups and lower groups, generating a higher-level group target difficulty distribution by synthesizing the first target difficulty distributions of the workers included in the higher-level group for each of the higher-level groups; assigning the plurality of tasks to the upper group such that a distribution of task difficulty levels approaches a target distribution of difficulty levels for the upper group; Using the allocation result of the upper group, generating a subgroup target difficulty distribution for each of the subgroups; 5. The task allocation method according to claim 1, further comprising allocating the plurality of tasks to the subgroup so that a distribution of task difficulty approaches a target difficulty distribution for the subgroup. (Appendix 6) Group workers into multiple groups, generating a group target difficulty distribution by synthesizing the first target difficulty distributions of the workers included in each group for the plurality of groups; assigning a plurality of tasks to the group such that a distribution of task difficulty approaches a target difficulty distribution for the group; generating a second target difficulty distribution for the worker based on a distribution of the difficulty levels of the plurality of tasks assigned to the group and the first target difficulty distribution for the worker; A task allocation program that causes a computer to execute a process of allocating the plurality of tasks to each worker included in the group such that a distribution of task difficulty levels approaches the second target difficulty distribution. The invention is not limited to the specifically disclosed embodiments, but various modifications and variations are possible without departing from the scope of the appended claims. [Explanation of symbols]
[0150] 100 Task Allocation Device 110 Worker Skills Database 120 Task Difficulty Database 130 Productivity Database 140 Allocation processing unit 160 First Processing Section 161 Group Creation Department 162 First distribution calculation part 163 Group Distribution Calculation Unit 164 Group Allocation Division 170 Second Processing Section 171 Second distribution calculation section 172 Worker Allocation Department
Claims
1. 1. A computer-implemented method for task allocation, comprising: Group workers into multiple groups, generating a group target difficulty distribution by synthesizing the first target difficulty distributions of the workers included in each group for the plurality of groups; assigning a plurality of tasks to the group such that a distribution of task difficulty approaches a target difficulty distribution for the group; generating a second target difficulty distribution for the worker based on a distribution of the difficulty levels of the plurality of tasks assigned to the group and the first target difficulty distribution for the worker; A task allocation method for allocating the plurality of tasks to each worker included in the group such that a distribution of task difficulty levels approaches the second target difficulty distribution.
2. 2. The task allocation method according to claim 1, wherein the plurality of groups are grouped according to the workers' levels of proficiency with respect to the tasks, based on proficiency information indicating the level of proficiency with respect to the tasks of each of the workers.
3. The second target difficulty distribution is Evenly distributing the distribution of difficulty levels of the plurality of tasks assigned to the group among the workers included in the group; 3. The task allocation method according to claim 1, wherein the distribution is generated by shifting the allocated distribution in accordance with the proficiency of the worker indicated by the first target difficulty distribution.
4. 2. The task allocation method according to claim 1, wherein the first target difficulty distribution is generated by referring to proficiency information indicating the proficiency of each worker with respect to the task and difficulty information indicating the difficulty of the task.
5. Group workers into multiple groups, generating a group target difficulty distribution by synthesizing the first target difficulty distributions of the workers included in each group for the plurality of groups; assigning a plurality of tasks to the group such that a distribution of task difficulty approaches a target difficulty distribution for the group; generating a second target difficulty distribution for the worker based on a distribution of the difficulty levels of the plurality of tasks assigned to the group and the first target difficulty distribution for the worker; A task allocation program that causes a computer to execute a process of allocating the plurality of tasks to each worker included in the group such that a distribution of task difficulty levels approaches the second target difficulty distribution.
Citation Information
Patent Citations
Personnel allocation planning device, personnel allocation planning method, and personnel allocation planning program
WO2019064379A1
Cited By
Dynamic prediction and resource allocation method for labeling task workload
CN121809996A
Method for investigating forest based on smart measurement technology and system using the same
KR103031239B1
