JP7563601B2 - Information processing device, information processing method, and information processing program - Google Patents

Description

The present invention relates to an information processing device, an information processing method, and an information processing program.

When allocating human resources, that is, assigning people to tasks, an allocation table may be created. Due to the nature of allocating people, various items must be taken into consideration when creating an allocation table.

In recent years, in order to assist in the creation of allocation tables, technologies have been proposed for quantifying items such as worker skills, or for automating the creation of allocation tables using solvers or the like that use such quantification. For example, Patent Document 1 discloses a technology for finding an optimal solution for human resource allocation that satisfies conditions including minimizing the time it takes from the start to the end of a task, minimizing the number of people assigned, and minimizing the variance of processing time.

Japanese Patent Application Publication No. 2017-211921

However, when two or more people are to handle a task, automation using optimization calculations does not create a good allocation table. For example, the more people there are, the greater the number of possible combinations of workers becomes, and the solver's constraints cannot write them all, or even if they can, the calculation time increases, making it impossible to find a solution in a realistic time frame. Furthermore, with conventional technology, there were cases where tasks were assigned to workers overlapped, meaning that one worker was assigned multiple tasks at the same time.

The object of this invention is to address the above-mentioned issues and to provide a technique that makes it possible to assign workers to a task assignment table without incorporating the relationships (relationship values) between workers into the assignment cost value and without the need to write a huge number of solver constraints. In addition, the object of this invention is to provide a technique that realizes solver calculations that can be performed whether one or multiple workers are assigned to a task.

In order to solve the above problem, one aspect of the present invention is an information processing device comprising: an acquisition unit that acquires a task assignment table for assigning multiple workers to tasks; a relationship value indicating the quality of the relationship between the multiple workers; and a per-worker assignment cost value indicating the assignment cost value when each of the multiple workers is assigned to the task; a calculation unit that calculates a total value when the multiple workers are assigned to the task based on the relationship value and the per-worker assignment cost value; and a solver calculation unit that runs a solver using the total value as an objective function and assigns the multiple workers to each of the tasks in the task assignment table.

According to one aspect of the present invention, it is possible to provide a technology that enables workers to be assigned to a task assignment table without incorporating the relationships between workers into the assignment cost value and without the need to write a large number of solver constraint equations, and to provide a solver calculation that can be performed whether one or multiple workers are assigned to a task.

FIG. 1 is a block diagram showing an example of a hardware configuration of an information processing apparatus according to the first embodiment. FIG. 2 is a block diagram showing the software configuration of the information processing apparatus according to the first embodiment in relation to the hardware configuration shown in FIG. FIG. 3 is a flowchart showing an example of an information processing operation of the information processing device. FIG. 4 is a diagram showing an example of a task assignment table acquired by the task assignment table acquisition unit. FIG. 5 is a diagram showing an example of the relationship value acquired by the relationship value acquisition unit. FIG. 6 is a diagram showing an example of the worker-specific allocation cost value acquired by the worker-specific allocation cost value acquisition unit. FIG. 7 is a diagram showing an example of assigned cost values for a plurality of workers including relation values. FIG. 8 is a diagram showing the relationship values between workers after being corrected by the relationship value correction unit. FIG. 9 is a diagram showing an example of a case where workers are assigned to a task assignment table. FIG. 10 is a block diagram showing the software configuration of an information processing apparatus according to the second embodiment in relation to the hardware configuration shown in FIG. FIG. 11 is a flowchart showing an example of the information processing operation of the information processing device according to the second embodiment. FIG. 12 is a diagram showing an example of worker attribute information. FIG. 13 is a diagram showing an example of work attribute information. FIG. 14 is a diagram showing whether a combination of worker A and worker C can handle tasks (1) to (3). FIG. 15 is a diagram showing an example of the assigned cost value for each worker. FIG. 16 is a diagram showing an example of cost values assigned to a plurality of workers.

Hereinafter, an embodiment of the present invention will be described with reference to the drawings. In addition, hereinafter, elements that are the same as or similar to elements already described will be given the same or similar reference numerals, and duplicate explanations will basically be omitted.

[First embodiment]
(composition)
FIG. 1 is a block diagram showing an example of a hardware configuration of an information processing device 1 according to the first embodiment.
The information processing device 1 is realized by a computer such as a PC (Personal Computer). The information processing device 1 includes a control unit 11, an input/output interface 12, and a storage unit 13. The control unit 11, the input/output interface 12, and the storage unit 13 are connected to each other via a bus so as to be able to communicate with each other.

The control unit 11 controls the information processing device 1. The control unit 11 is equipped with a hardware processor such as a central processing unit (CPU).

The input/output interface 12 is an interface that enables the transmission and reception of information between the input device 2 and the output device 3. The input/output interface 12 may be equipped with a wired or wireless communication interface. In other words, the information processing device 1 and the input device 2 and output device 3 may transmit and receive information via a network such as a LAN or the Internet.

The storage unit 13 is a storage medium. The storage unit 13 is configured by combining a non-volatile memory that can be written and read at any time, such as a hard disk drive (HDD) or a solid state drive (SSD), a non-volatile memory such as a read only memory (ROM), and a volatile memory such as a random access memory (RAM). The storage unit 13 has a program storage area and a data storage area in its storage area. The program storage area stores application programs necessary for executing various processes, in addition to the operating system (OS) and middleware.

The input device 2 includes, for example, a keyboard, a pointing device, etc., for a user of the information processing device 1 (for example, an assigner, an administrator, or a supervisor, etc.) to input instructions to the information processing device 1. The input device 2 may also include a reader for reading data to be stored in the memory unit 13 from a memory medium such as a USB memory, or a disk device for reading such data from a disk medium. The input device 2 may further include an image scanner.

The output device 3 includes a display that displays output data to be presented to the user from the information processing device 1, a printer that prints the output data, and the like. The output device 3 may also include a writer for writing data to be input to another information processing device 1 such as a PC or smartphone onto a memory medium such as a USB memory, and a disk device for writing such data onto a disk medium.

FIG. 2 is a block diagram showing the software configuration of the information processing device 1 according to the first embodiment in relation to the hardware configuration shown in FIG.
The storage unit 13 includes an acquired data storage unit 131 , a correction value storage unit 132 , and an assignment table storage unit 133 .

The acquired data storage unit 131 stores various data acquired by the acquisition unit 111 of the control unit 11, which will be described later. The data stored in the acquired data storage unit 131 is a work assignment table, relationship values, and allocation cost values per worker. Each of these work assignment tables, relationship values, and allocation cost values per worker may be acquired by importing pre-created data from the outside via the input device 2, or may include data generated by the control unit 11. The work assignment table, relationship values, and allocation cost values per worker will be described later.

The modification value memory unit 132 stores the relationship value modified by the relationship value modification unit 112 of the control unit 11 described later.

The allocation table memory unit 133 stores an allocation table in which workers are assigned to tasks by the solver calculation unit 117 of the control unit 11 described later.

The control unit 11 includes an acquisition unit 111, a relationship value correction unit 112, a total allocation cost value calculation unit 115, a total evaluation value calculation unit 116, a solver calculation unit 117, and an output control unit 118. These functional units are realized by the hardware processor executing an application program stored in the memory unit 13.

The acquisition unit 111 acquires the necessary data and stores it in the acquired data storage unit 131. The acquisition unit 111 includes a work assignment table acquisition unit 1111, a relationship value acquisition unit 1112, and an allocation cost value acquisition unit for each worker 1113.

The work assignment table acquisition unit 1111 acquires a work assignment table for assigning workers to tasks. The work assignment table includes an assignment of a combination of multiple workers to one task. Here, the work assignment table means a table in which no workers are assigned to tasks, and the assignment table means a table in which workers are assigned to tasks. The work assignment table may also include, for example, an assignment table (allocation proposal) previously created by a user. The work assignment table may also include simulation data. The work assignment table includes, for example, information identifying a task and information identifying a worker to be assigned to the task.

The relationship value acquisition unit 1112 stores a relationship value that numerically represents the quality of the relationship between the workers. The relationship value acquisition unit 1112 can acquire the set relationship value as matrix data between the workers.

The per-worker allocation cost value acquisition unit 1113 acquires per-worker allocation cost values that indicate an index of the degree of performance that each worker can achieve for a task. The per-worker allocation cost value acquisition unit 1113 can acquire the acquired per-worker allocation cost values as matrix data of workers and tasks.

The relationship value correction unit 112 reads out the relationship values stored in the acquired data storage unit 131 and corrects them so that calculations can be performed by the solver. The read relationship values have no values for cells where the workers are the same. Therefore, for example, the relationship value correction unit 112 corrects the cells where the workers are the same by substituting 0 for them. The relationship value correction unit 112 also stores the corrected relationship values in the correction value storage unit 132.

The total allocation cost calculation unit 115 calculates a total value that can be calculated using a solver based on the relationship value and the allocation cost value for each worker. The method for calculating the total value will be described later.

The total evaluation value calculation unit 116 calculates a total evaluation value that can be calculated using a solver based on the relationship value and the assigned cost value for each worker. The total evaluation value may take into account the intention of the manager. The method for calculating the total evaluation value will be described later.

The solver calculation unit 117 performs a solver calculation using the total value calculated by the total allocation cost value calculation unit 115 or the total evaluation value calculation unit 116 as an objective function, and assigns workers to the work assignment table. The solver calculation unit 117 also stores the assignment table in which workers are assigned to the work assignment table in the assignment table storage unit 133.

In response to operation by a user of the information processing device 1, the output control unit 118 outputs the allocation table stored in the allocation table memory unit 133 to the output device 3 via the input/output interface 12.

(Operation)
For the sake of convenience, the following description will be given of an example in which two workers are combined and assigned to one task, but it is of course possible to assign one or more workers to one task.

As a prerequisite for the operation, the relationship values between workers and the cost values for each worker are assumed to be determined in advance. The method of determination will be described later.

Figure 3 is a flowchart showing an example of the information processing operation of the information processing device 1. The operation of this flowchart is realized by the control unit 11 of the information processing device 1 reading and executing a program stored in the memory unit 13.

The operation begins when a user of the information processing device 1 (e.g., an administrator, etc.) inputs specified information into the information processing device 1.

The work assignment table acquisition unit 1111 of the information processing device 1 acquires the work assignment table input to the input device 2 via the input/output interface 12 (step ST11). Here, the work assignment table includes the tasks and the number of people to be assigned to the tasks. The work assignment table may also include information on the workers to be assigned. The work assignment table acquisition unit 1111 also stores the acquired work assignment table in the acquired data storage unit 131.

FIG. 4 is a diagram showing an example of a task assignment table acquired by the task assignment table acquisition unit 1111. As shown in FIG.
In the example shown in FIG. 4, the task assignment table indicates that two workers must be assigned to each of tasks (1) to (3).

The relationship value acquisition unit 1112 acquires the relationship value input to the input device 2 via the input/output interface 12 (step ST12). Here, the relationship value is a numerical representation of the quality of the relationship between the currently assigned workers. For example, the larger the relationship value, the better the relationship between the workers. The relationship value acquisition unit 1112 also stores the acquired relationship value in the acquired data storage unit 131.

FIG. 5 is a diagram showing an example of the relationship value acquired by the relationship value acquisition unit 1112. As shown in FIG.
In the example shown in FIG. 5, it is indicated that workers C and E have a good relationship, whereas workers A and B have a bad relationship.

Here, (1) the relationship value may be a value manually input by a user or the like, taking into consideration the closeness between the workers. (2) The relationship value may be manually or automatically created by a user or the like based on the amount of work performed by workers who have worked together in the past. Alternatively, (3) the number of times they have been combined in the past may be taken into consideration. For example, the average value of the relationship values used in past work may be used as the relationship value to be used this time. That is, in the case of (3), the relationship value is created as (relationship value between the specified workers in the first allocation table + relationship value between the specified workers in the second allocation table + ... + relationship value between the specified workers in the Nth allocation table) / number of input allocation tables (N). In this case, the more the number of input allocation tables, the higher the accuracy of the relationship value between the two. In addition, the relationship value between workers who have never been combined in the past may be "0", "1", or a specified logarithm. In the example shown in FIG. 5, it is set to "0".

The per-worker allocation cost value acquisition unit 1113 acquires the per-worker allocation cost value input to the input device 2 via the input/output interface 12 (step ST13). Here, the per-worker allocation cost value is a numerical index showing the degree of work suitability of each worker for the work shown in the assigned work table. The per-worker allocation cost value acquisition unit 1113 also stores the acquired per-worker allocation cost value in the acquired data storage unit 131.

FIG. 6 is a diagram showing an example of the worker-specific allocation cost value acquired by the worker-specific allocation cost value acquisition unit 1113. As shown in FIG.
The example shown in FIG. 6 indicates that Worker F has the highest work aptitude for every task, while Worker A has the lowest work aptitude for every task.

Here, steps ST11 to ST13 may be performed in a different order or in parallel. That is, this information may be obtained by a single information input from the administrator. Also, steps ST11 to ST13 may be obtained before the flowchart of FIG. 3 is started. In this case, the flowchart shown in FIG. 3 starts, for example, from step ST14 described below, in accordance with the administrator's input.

Now consider an example of how relationship values can be incorporated into an assigned cost value to create assigned cost values for multiple workers.

FIG. 7 is a diagram showing an example of assigned cost values for a plurality of workers including relation values.
7A shows the assigned cost values acquired by the worker assigned cost value acquisition unit 1113 in step ST12. That is, the table (a) is the same as the diagram shown in FIG.

For example, the allocation cost value is calculated according to the following formula.
Allocation cost value _{(i, j, z)} = (X _{(i, j)} + Y _{(i, z)} ) * α _{(j, z)}
Here, X _(i,j) represents the allocation cost value of worker j for task i, Y _(i,z) represents the allocation cost value of worker z for task i, and α _(j,z) represents the relationship value between worker j and worker z.

Table (b) in Figure 7 shows an example of calculation when the above formula is applied between each worker, and table (c) in Figure 7 shows the calculation results using the above formula. Here, the relationship values are assumed to be the values shown in Figure 6. Referring to table (c), it is shown that the allocation cost value when worker A and worker C perform task (1) is 8, and the allocation cost value when worker A and worker D perform task (2) is 18.

Table (d) in FIG. 7 shows allocation cost values including the allocation cost values of multiple workers including relational values. Table (d) shows the allocation cost values when workers A, B, and C work alone, and the allocation cost values when two workers work together as shown in table (c) above. For example, if you try to perform a solver calculation on the allocation cost values shown in table (d), the calculation cannot be performed. This is because the solver cannot determine whether the allocation cost value is a value for multiple workers or an individual value, and because the conventional technology cannot perform a solver calculation when there is overlap in the tasks assigned to each worker (two or more tasks cannot be assigned to one worker).

Therefore, instead of assigning multiple tasks to one worker, we assign multiple workers to one task (or set of tasks).

Referring again to FIG. 3, the relationship value correction unit 112 corrects the relationship value stored in the acquired data storage unit 131 (step ST14). In the relationship value shown in FIG. 5, if the worker is the same, it is shown as "-", i.e., there is no value, but the relationship value correction unit 112 corrects this relationship value to "0". Then, the relationship value correction unit 112 stores the corrected relationship value in the correction value storage unit 132.

Figure 8 is a diagram showing the relationship values between workers after they have been corrected by the relationship value correction unit 112. As shown in Figure 8, the relationship value correction unit 112 corrects the relationship values between the same workers to be "0".

The total allocation cost value calculation unit 115 or the total evaluation value calculation unit 116 calculates the total value (step ST15). Here, the total value may be calculated by either the total allocation cost value calculation unit 115 or the total evaluation value calculation unit 116.

When the total allocation cost value calculation unit 115 calculates the total value, the total allocation cost value calculation unit 115 reads the allocation cost value for each worker from the acquired data storage unit 131, and reads the corrected relation value from the correction value storage unit 132. Then, the total allocation cost value calculation unit 115 calculates the total allocation cost value of each task using the following formula.
Total allocation cost value of activity i = (X(i,j,t) + Y(i,z,t)) * α(j,z)
Here, X(i,j,t) indicates the allocation cost value of worker j for task i in time frame t, Y(i,z,t) indicates the allocation cost value of worker z for task i in time frame t, and α(j,z) indicates the relationship value between worker j and worker z. The time frame t represents a unit into which the working time of one day is divided. For example, t=1 indicates the morning time frame from 9:00 to 12:00, and t=2 indicates the afternoon time frame from 13:00 to 17:30. It is of course possible for the time frame t to indicate a time frame into which the working time of one day is arbitrarily divided. From the above, the total allocation cost value calculation unit 115 calculates the total allocation cost value of each task based on the relationship value and the allocation cost value for each worker. The total allocation cost value of each task is the sum of the allocation cost values of each of the multiple workers corresponding to the relationship value multiplied by the relationship value. Furthermore, the total allocation cost value calculation unit 115 calculates a total value, which is a value obtained by adding up the total allocation cost values of each task calculated for each task for all tasks. Furthermore, by using the time frame t, the total percentage cost value can inform the solver calculation unit 117 of which time period the worker is to be assigned to the task. The total allocation cost value calculation unit 115 outputs the calculated total value to the solver calculation unit 117.

When the total evaluation value calculation unit 116 calculates a total value for performing the solver, the total evaluation value calculation unit 116 reads the worker-specific allocation cost value from the acquired data storage unit 131, and reads the corrected relationship value from the corrected value storage unit 132. Then, the total evaluation value calculation unit 116 calculates the total evaluation value using the following formula.

Total evaluation value = α * total allocation cost (of all workers) + β * total relationship value (of all workers)
Here, α is a weighting coefficient for the allocation cost value, and β is a weighting coefficient for the relationship value. Of course, α and β can be set to any value. Of course, if there are other items (values) to be considered, those values can be incorporated into the total evaluation value. Then, the total evaluation value calculation unit 116 outputs the calculated total evaluation value to the solver calculation unit 117 as a total value.

The solver calculation unit 117 calculates an allocation table by the solver based on the total value calculated in step ST15 (step ST16). For example, the solver calculation unit 117 calculates the combination that has the highest allocation cost value when two workers are assigned to each of three tasks, as in the task allocation table shown in FIG. 3. The solver calculation unit 117 then stores the calculated allocation table in the allocation table storage unit 133.

For example, when a total value is received from the total allocation cost value calculation unit 115, the solver calculation unit 117 performs a solver to maximize the objective function f(x) using two constraint equations, "one person must be assigned to one task" and "a worker cannot perform multiple tasks," and the received total value as the objective function f(x).

For example, when a total evaluation value is received as a total value from the total evaluation value calculation unit 116, the solver calculation unit 117 performs a solver to maximize the objective function f(x) using two constraint equations, "one person must be assigned to one task" and "a worker cannot perform multiple tasks", and the received total value as the objective function. As a result, the solver calculation unit 117 assigns workers to the task assignment table. The solver calculation unit 117 stores the assignment table to which the workers have been assigned in the assignment table storage unit 133.

FIG. 9 is a diagram showing an example of a case where workers are assigned to a task assignment table.
As shown in FIG. 9 , the solver calculation unit 117 executes the solver to calculate the result that the objective function f(x) is maximized when worker A and worker D are assigned to task (1), worker B and worker E are assigned to task (2), and worker C and worker F are assigned to task (3).

The output control unit 118 outputs the allocation table to the output device 3 via the input/output interface 12 (step ST17). The output control unit 118 reads out the allocation table stored in the allocation table storage unit 133 and outputs it to the output device 3 via the input/output interface 12, so that if the output device 3 is a display, for example, the allocation table is displayed on the display. Based on the displayed allocation table, the manager can determine the allocation of workers to each task.

(Action and Effect)
According to the first embodiment, it is possible to perform a solver calculation that can assign one or more workers to a task without incorporating the relationships between workers into the assignment cost value and without increasing the number of constraint equations when running the solver.

In addition, because the combination of workers and other workers is taken into consideration, the allocation table calculated by the solver becomes closer to the allocation table actually used. This reduces the frequency with which the user of the information processing device 1, who is the allocator, manually modifies the allocation table. In addition, workers who have a strong relationship with each other are often assigned to the same work, which improves worker satisfaction.

Second Embodiment
(composition)
The hardware configuration of the information processing device 1 in the second embodiment is the same as that in the first embodiment, and therefore a description thereof will be omitted here.

Figure 10 is a block diagram showing the software configuration of the information processing device 1 in the second embodiment in relation to the hardware configuration shown in Figure 1.

The difference from the first embodiment is that the acquisition unit 111 is equipped with an attribute information acquisition unit 1114, and the control unit 11 is equipped with a work feasibility determination unit 113 and a worker-specific allocation cost value correction unit 114.

The acquired data storage unit 131 includes attribute information in addition to the information stored in the first embodiment. The attribute information may be acquired by importing created data from the outside via the input device 2, or may include data generated by the control unit 11. The attribute information will be described later.

The modified value memory unit 132 stores the relationship value modified by the relationship value modification unit 112 as well as the per-worker allocation cost value modified by the per-worker allocation cost value modification unit 114 of the control unit 11 described later.

The attribute information acquisition unit 1114 acquires attribute information including worker attribute information (first attribute information) indicating what attributes a worker has and task attribute information (second attribute information) indicating what attributes a task has. Attributes are, for example, tasks such as "working at height" and "working inside the home", age, whether a vehicle is used, whether tools are used, etc. In other words, attributes may be any attributes required for a task. In addition, whether each worker corresponds to each attribute is represented by a bit value. For example, if the attribute corresponds, the bit value is set to "1", and if the attribute does not correspond, the bit value is set to "0" or blank. Similarly, whether each task corresponds to each attribute is represented by a bit value. The attribute information acquisition unit 1114 can acquire worker attribute information as matrix data of each worker and attribute, and can acquire task attribute information as matrix data of each task and attribute.

The work feasibility determination unit 113 determines whether a specific task can be performed by a specific worker (one or more workers) based on the worker attribute information and task attribute information stored in the acquired data storage unit 131. For example, it determines whether task (1) can be performed by worker A and worker B. A specific example of the determination process of the work feasibility determination unit 113 will be described later.

The per-worker allocation cost value correction unit 114 corrects the per-worker allocation cost value based on the result of the determination by the work feasibility determination unit 113 as to whether the work can be performed. For example, the per-worker allocation cost value correction unit 114 corrects the allocation cost value of the cell corresponding to the work and worker determined to be possible by the work feasibility determination unit 113 so as to increase it. A specific example of the per-worker allocation cost value correction unit 114 will be described later. The per-worker allocation cost value correction unit 114 also stores the corrected per-worker allocation cost value in the correction value memory unit 132.

(Operation)
11 is a flowchart showing an example of the information processing operation of the information processing device 1. The control unit 11 of the information processing device 1 reads out and executes a program stored in the storage unit 13, thereby realizing the operation of this flowchart.

First, as a prerequisite for operation, it is assumed that the relationship values between workers, the cost values for each worker, and the attribute information have been determined in advance.

Steps ST11 to ST13 shown in Figure 11 are the same as steps ST11 to ST13 described with reference to Figure 3, so they will not be explained again.

The attribute information acquisition unit 1114 of the information processing device 1 acquires the attribute information input to the input device 2 via the input/output interface 12 (step ST21). Here, the attribute information includes worker attribute information (first attribute information) for each worker and task attribute information (second attribute information) for each task. In addition, the attribute information acquisition unit 1114 stores the acquired attribute information in the acquired data storage unit 131.

FIG. 12 is a diagram showing an example of worker attribute information, and FIG. 13 is a diagram showing an example of work attribute information.
As shown in FIG. 12, for example, the attributes of the workers indicate that they are "capable of working at heights,""capable of working inside the home,""holds a fiber connector,""capable of working with an aerial work vehicle," and "capable of setting up a network (in FIG. 12, indicated as NW)." As shown in FIG. 12, the attribute information of worker A indicates that they are "capable of working at heights,""capable of working inside the home," and "capable of working with an aerial work vehicle." The attribute information of worker B indicates that they are "capable of working inside the home" and "capable of setting up a network." Similarly, the attribute information of worker C indicates that they are "capable of working inside the home" and "holds a fiber connector."

As shown in FIG. 13, the attributes for the work are "work at high altitude," "work inside the home," "work requiring a fiber connector," "work requiring an aerial work vehicle," and "work to set up a network (referred to as NW in FIG. 13)." And as shown in FIG. 13, the attribute information for work (1) is "work at high altitude," "work inside the home," "work requiring a fiber connector," and "work requiring an aerial work vehicle." The attribute information for work (2) is "work inside the home," "work requiring a fiber connector," and "work to set up a network." Similarly, the attribute information for work (3) is "work inside the home" and "work requiring a fiber connector."

Step ST14 shown in Figure 11 is the same as step ST14 described with reference to Figure 3, so we will not explain it again.

The work possibility determination unit 113 determines whether the work can be performed when the workers are combined (step ST22). The work possibility determination unit 113 reads out the attribute information stored in the acquired data storage unit 131. Then, the work possibility determination unit 113 determines that the work can be performed when the attribute information of the combination of each worker satisfies the attribute information of the work. For example, when the attribute information of the combination of worker A and worker B satisfies the attribute information of work (1), that is, when the bit value of the attribute information of the combination of worker A and worker B is 1 in all the places where the bit value of the attribute information of work (1) is 1, the work possibility determination unit 113 determines that the combination of worker A and worker B can perform work (1). Furthermore, if the result of combining each worker does not satisfy the task attribute information, that is, if the location where the bit value of the attribute information of the combination of worker A and worker B is 1 does not include any location where the bit value of the attribute information of task (1) is 1, the task capability determination unit 113 determines that task (1) cannot be handled when worker A and worker B are combined. Furthermore, the task capability determination unit 113 outputs the determination result to the per-worker assigned cost value correction unit 114.

Figure 14 is a diagram showing whether a combination of worker A and worker C can handle tasks (1) to (3). In Figure 14, only the combination of worker A and worker C is explained, but the work capability determination unit 113 naturally makes determinations for all combinations of workers.

12 and 13, the attributes that can be handled when worker A and worker C are combined are "work at high altitudes," "work inside the home," and "network setting work." Therefore, as shown in FIG. 14, the work capability determination unit 113 determines that work (1) and (3) can be handled by worker A and worker C, and determines that work (2) cannot be handled by worker A and worker C.

The per-worker allocation cost value correction unit 114 corrects the per-worker allocation cost value (step ST23). The per-worker allocation cost value correction unit 114 reads out the per-worker allocation cost value stored in the acquired data storage unit 131. The per-worker allocation cost value correction unit 114 then corrects the per-worker allocation cost value based on the result received from the work feasibility determination unit 113. The per-worker allocation cost value correction unit 114 then stores the corrected per-worker allocation cost value in the correction value storage unit 132.

For example, if the judgment result for a combination of workers indicates that the task is "capable," and the assigned cost value per worker is "0" for both of the combined workers, it is assumed that the task can only be completed by two workers working together. The assigned cost value per worker correction unit 114 then sets the assigned cost value for each of the combined workers to half the assigned cost value of the worker with the smallest assigned cost value among the workers with assigned cost values greater than "0" for the task. If any of the assigned cost values is not "0," the assigned cost value is not corrected, as it is assumed that the task can be completed by one worker. If it is determined that the task cannot be completed, the assigned cost value of the worker determined to be unable to complete the task is corrected to "0." Note that if the assigned cost value was "0" from the beginning, the assigned cost value is not corrected.

FIG. 15 is a diagram showing an example of the assigned cost value for each worker.
Table (a) in FIG. 15 shows an example of the per-worker allocation cost value read by the per-worker allocation cost value correction unit 114 from the acquired data storage unit 131, that is, before correction. For example, as shown in FIG. 14, the work possibility determination unit 113 determines that the work (1) can be performed when the workers A and C are combined. As shown in table (a), the allocation cost value of the work (1) for the workers A and C is "0". Furthermore, the worker having the smallest value among the allocation cost values other than "0" is the worker B, and the allocation cost is "4". Therefore, the per-worker allocation cost value correction unit 114 corrects the per-worker allocation cost value so that "2", which is half the value of "4", becomes the per-worker allocation cost value for the workers A and C, as shown in table (b) in FIG. 15.

It is also output that task (2) cannot be handled for the combination of worker A and worker C shown in Figure 14. Here, since the allocation cost values of worker A and worker C are "0", the per-worker allocation cost value correction unit 114 does not correct the per-worker allocation cost value.

Furthermore, it is output that task (3) for the combination of worker A and worker C shown in Figure 14 is possible. However, since the assigned cost values of worker A and worker C are not "0", the assigned cost value correction unit 114 for each worker does not correct the assigned cost values of worker A and worker C in task (3).

In addition, the worker-specific allocation cost value correction unit 114 can also calculate the allocation cost value for multiple workers. If the judgment result is compatible, the allocation cost value for multiple workers is calculated using the following formula.

Allocation cost value _{(i, j, z)} = average value of allocation cost values of workers excluding those with an allocation cost value of "0" for task i) × α _{(j, z)}
If the determination result indicates that the request cannot be accommodated, the allocation cost value _{(i, j, z)} =0 is set.

FIG. 16 is a diagram showing an example of cost values assigned to a plurality of workers.
Table (a) of Fig. 16 shows the same allocation cost values for each worker as Table (a) of Fig. 15. Table (b) of Fig. 16 shows the allocation cost values between each worker when the above formula is applied, and Table (c) of Fig. 16 shows the allocation cost values as a result of applying the above formula. Each value shown in Table (c) is the allocation cost value between multiple workers.

Furthermore, steps ST15 to ST17 shown in Figure 11 are the same as steps ST15 to ST17 described with reference to Figure 3, and therefore will not be described again. However, in step ST15, the total allocation cost value calculation unit 115 or the total evaluation value calculation unit 116 does not read out the per-worker allocation cost value stored in the acquired data storage unit 131, but reads out the per-worker allocation cost value corrected in step ST23 from the corrected value storage unit 132 and uses it.

(Action and Effect)
According to the second embodiment, it is possible to output an allocation table that takes attribute information into consideration by reflecting the determination result of attribute information in the allocation cost value for each worker.

[Other embodiments]
The present invention is not limited to the above embodiment. For example, the present invention can be applied to a case where a plurality of workers are assigned to a plurality of tasks. For example, the present invention can be applied by combining tasks by optimization calculations and treating the combined tasks as one task.

The method described in the above embodiment can be stored as a program (software means) that can be executed by a calculator (computer) on a storage medium such as a magnetic disk (floppy disk, hard disk, etc.), optical disk (CD-ROM, DVD, MO, etc.), semiconductor memory (ROM, RAM, flash memory, etc.), and can also be distributed by transmitting it via a communication medium. The program stored on the medium also includes a setting program that configures the software means (including not only execution programs but also tables and data structures) that the computer executes. The computer that realizes this device reads the program stored in the storage medium, and in some cases, constructs the software means using the setting program, and executes the above-mentioned processing by controlling the operation of this software means. Note that the storage medium referred to in this specification is not limited to a storage medium for distribution, but also includes storage media such as a magnetic disk and semiconductor memory installed inside the computer or in a device connected via a network.

In short, this invention is not limited to the above-described embodiments, and various modifications can be made in the implementation stage without departing from the gist of the invention. Furthermore, the embodiments may be implemented in appropriate combinations as far as possible, in which case the combined effects can be obtained. Furthermore, the above-described embodiments include inventions at various stages, and various inventions can be extracted by appropriate combinations of the multiple constituent elements disclosed.

LIST OF SYMBOLS 1... Information processing device 11... Control unit 111... Acquisition unit 1111... Work allocation table acquisition unit 1112... Relationship value acquisition unit 1113... Per-worker allocation cost value acquisition unit 1114... Attribute information acquisition unit 112... Relationship value correction unit 113... Work feasibility determination unit 114... Per-worker allocation cost value correction unit 115... Total allocation cost value calculation unit 116... Total evaluation value calculation unit 117... Solver calculation unit 118... Output control unit 131... Acquired data storage unit 132... Correction value storage unit 133... Allocation table storage unit 12... Input/output interface 13... Storage unit 2... Input device 3... Output device

Claims (8)

an acquisition unit that acquires a task assignment table for assigning a plurality of workers to tasks, a relationship value indicating the quality of a relationship between the plurality of workers, and an assignment cost value for each worker indicating an assignment cost value when each of the plurality of workers is assigned to the task;
a calculation unit that calculates a total value when the plurality of workers are assigned to the task based on the relationship value and the assigned cost value for each worker;
a solver calculation unit that executes a solver using the total value as an objective function and assigns the plurality of workers to each of the tasks in the task assignment table;
wherein the total value is a value obtained by adding up total allocation cost values of each task of all tasks, and the total allocation cost value of each task is a value obtained by multiplying the relationship value by a value obtained by adding up the allocation cost values of each of the multiple workers corresponding to the relationship value . an acquisition unit that acquires a task assignment table for assigning a plurality of workers to tasks, a relationship value indicating the quality of a relationship between the plurality of workers, and an assignment cost value for each worker indicating an assignment cost value when each of the plurality of workers is assigned to the task;
a calculation unit that calculates a total value when the plurality of workers are assigned to the task based on the relationship value and the assigned cost value for each worker;
a solver calculation unit that executes a solver using the total value as an objective function and assigns the plurality of workers to each of the tasks in the task assignment table;
wherein the total value is a sum of a total of assigned cost values of all of the plurality of workers multiplied by a first coefficient and a total of relationship values of the plurality of workers multiplied by a second coefficient . The information processing apparatus according to claim 1 , further comprising a relationship value correction unit that corrects a relationship value of a same worker among the plurality of workers to 0. The acquisition unit further acquires first attribute information representing attributes of the plurality of workers and second attribute information representing attributes of the work,
The information processing apparatus according to claim 1 , further comprising a determination unit configured to output a determination result of whether or not an attribute obtained by combining the first attribute information satisfies an attribute of the second attribute information. The information processing apparatus according to claim 4 , further comprising a correction unit that corrects the worker-specific assigned cost value based on the determination result. An information processing method executed by an information processing device having a processor and a memory,
the processor acquires a task assignment table for assigning a plurality of workers to tasks, a relationship value indicating the quality of relationships between the plurality of workers, and a worker-specific assignment cost value indicating an assignment cost value when each of the plurality of workers is assigned to the task, and stores the acquired table in the memory;
the processor calculates a total value when the plurality of workers are assigned to the work based on the relationship value and the assigned cost value for each worker stored in the memory;
The processor executes a solver using the total value as an objective function for each of the tasks in the task assignment table stored in the memory, and assigns the plurality of workers to each of the tasks in the task assignment table;
wherein the total value is a value obtained by adding up total allocation cost values of each task of all the tasks, and the total allocation cost value of each task is a value obtained by multiplying the relationship value by a value obtained by adding up the allocation cost values of each of the plurality of workers corresponding to the relationship value . An information processing method executed by an information processing device having a processor and a memory,
the processor acquires a task assignment table for assigning a plurality of workers to tasks, a relationship value indicating the quality of relationships between the plurality of workers, and a worker-specific assignment cost value indicating an assignment cost value when each of the plurality of workers is assigned to the task, and stores the acquired table in the memory;
the processor calculates a total value when the plurality of workers are assigned to the work based on the relationship value and the assigned cost value for each worker stored in the memory;
The processor executes a solver using the total value as an objective function for each of the tasks in the task assignment table stored in the memory, and assigns the plurality of workers to each of the tasks in the task assignment table;
wherein the total value is a sum of a total of the assigned cost values of all of the plurality of workers multiplied by a first coefficient and a total of the relationship values of the plurality of workers multiplied by a second coefficient . An information processing program that causes a processor to function as each of the units of the information processing device according to claim 1 .

Images