JP2017130059A - Program, information processing method and information processor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a program capable of properly assigning a worker.SOLUTION: The program causes a computer 1 to execute a series of processing including: acquiring a flow including a plurality of works; referring to a storage part storing available workers who can carrying out the processing of the works; extracting candidate workers for the respective works; calculating the degree of fatigue of the candidate workers based on the works to be processed by the extracted candidate workers and the available time; and when the calculated degree of fatigue is smaller than a threshold level, assigning the works to the candidate workers.SELECTED DRAWING: Figure 1

Description

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

  2. Description of the Related Art Conventionally, a production process efficiency support method and the like that perform optimal personnel assignment in consideration of worker fatigue levels and worker proficiency levels are known (see, for example, Patent Documents 1 to 6).

JP 2007-79768 A JP 2012-137931 A JP 2005-276003 A JP 2007-141039 A JP 2007-22671 A JP 2007-193620 A

  However, the conventional technique has a problem in that appropriate allocation cannot be performed in consideration of the fatigue level of the worker.

  An object of one aspect is to provide a program or the like capable of appropriately assigning workers.

  In one plan, a flow including a plurality of tasks is acquired by a computer, a storage unit storing workers capable of processing each task is referred to, and candidate workers for each task are extracted and extracted. The fatigue level of the candidate worker is calculated on the basis of the work to be processed by the candidate worker and the time during which the candidate worker is not working. If the calculated fatigue level is equal to or less than a threshold value, the task is assigned to the candidate worker.

  In one aspect, it is possible to assign workers appropriately.

It is explanatory drawing which shows the outline | summary of an information processing system. It is a block diagram which shows the hardware group of a computer. It is explanatory drawing which shows the record layout of flow DB. It is explanatory drawing which shows the flow of each operation | work. It is explanatory drawing which shows the flow of each work which abbreviate | omitted one part of work. It is explanatory drawing which shows the record layout of flow DB after compression. It is explanatory drawing which shows the record layout of worker DB. It is explanatory drawing which shows the record layout of required time DB. It is explanatory drawing which shows the record layout of candidate DB. It is explanatory drawing which shows the record layout of schedule DB. It is explanatory drawing which shows the record layout of setting DB. It is explanatory drawing which shows the time change of a fatigue degree. It is explanatory drawing which shows the time change of a fatigue degree. It is a flowchart which shows the procedure of determination processing of a candidate worker and required time. It is a flowchart which shows the calculation procedure of an average start time and an average end time. It is a flowchart which shows the allocation procedure of the first work. It is a flowchart which shows the allocation procedure of the work after the 2nd time. It is a flowchart which shows the allocation procedure of the work after the 2nd time. It is a flowchart which shows the calculation procedure of a fatigue degree. FIG. 6 is a block diagram illustrating a hardware group of a computer according to a second embodiment. It is explanatory drawing which shows the record layout of update DB. It is a flowchart which shows the procedure of an update process. It is a flowchart which shows the procedure of an update process. FIG. 10 is a block diagram illustrating a hardware group of a computer according to a third embodiment. It is explanatory drawing which shows the record layout of 2nd setting DB. It is a flowchart which shows the procedure of a 2nd setting process. It is a flowchart which shows the procedure of a 2nd setting process. It is explanatory drawing which shows the record layout of 2nd update DB. It is explanatory drawing which shows the record layout of 3rd setting DB. It is a flowchart which shows the procedure of a change process. It is a flowchart which shows the procedure of a change process. It is explanatory drawing which shows the record layout of 3rd update DB. It is explanatory drawing which shows an example of candidate data. It is a flowchart which shows the calculation procedure of an evaluation value. It is a flowchart which shows the calculation procedure of an evaluation value. It is a functional block diagram which shows operation | movement of the computer of the form mentioned above. FIG. 20 is a block diagram illustrating a hardware group of a computer according to a sixth embodiment.

Embodiment 1
Hereinafter, embodiments will be described with reference to the drawings. FIG. 1 is an explanatory diagram showing an outline of an information processing system. The information processing system includes an information processing device 1, an information processing device 2, and the like. The information processing apparatuses 1 and 2 are a personal computer, a server computer, a smartphone, a mobile phone, a PDA (Personal Digital Assistant), a control panel, or the like. Hereinafter, the information processing apparatus 1 is referred to as a computer 1, and the information processing apparatus 2 is referred to as a computer 2. The computer 1 and the computer 2 transmit / receive information to / from each other via a communication network N such as the Internet or a public line network.

  The computer 1 receives a flow including a plurality of operations transmitted from the computer 2 via the communication network N. In the present embodiment, an example in which a flow is downloaded from another computer 2 is shown, but the present invention is not limited to this. For example, the flow may be acquired through a recording medium such as a USB (Universal Serial Bus) memory. The flow shows a plurality of work flows to be processed in time series. Note that the flow may include work that branches in time series and is processed in the same time zone. In the flow shown in FIG. 1, the flow branches after the operation 1, and the operations 2, 4 and 6 and the operations 3, 5 and 7 are processed in a partially overlapping time zone.

  Further, the flow may include an operation in which branched operations merge. In the flow shown in FIG. 1, the work 8 is processed on condition that both the work 6 and the work 7 are completed. The example shown in FIG. 1 is an example, and the present invention is not limited to this. After receiving the flow, the computer 1 assigns workers (workers A to Q in the example of FIG. 1) to perform each work by executing the processes described below. Details will be described below.

  FIG. 2 is a block diagram showing a hardware group of the computer 1. The computer 1 includes a CPU (Central Processing Unit) 11 as a control unit, a RAM (Random Access Memory) 12, an input unit 13, a display unit 14, a storage unit 15, a clock unit 18, a communication unit 16, and the like. The CPU 11 is connected to each part of the hardware via the bus 17. The CPU 11 controls each part of the hardware according to the control program 15P stored in the storage unit 15. The RAM 12 is, for example, SRAM (Static RAM), DRAM (Dynamic RAM), flash memory, or the like. The RAM 12 also functions as a storage unit, and temporarily stores various data generated when the CPU 11 executes various programs.

  The input unit 13 is an input device such as a touch panel or a button, and outputs received operation information to the CPU 11. The display unit 14 is a liquid crystal display, an organic EL (electroluminescence) display, or the like, and displays various information according to instructions from the CPU 11. The communication unit 16 is a communication module, and transmits and receives information to and from the computer 2 and the like. The clock unit 18 outputs date information to the CPU 11.

  The storage unit 15 is a large-capacity memory, and includes a control program 15P, a flow database (hereinafter referred to as DB) 151, a worker DB 152, a required time DB 153, a candidate DB 154, a schedule DB 155, a setting DB 156, and the like. In the embodiment, the flow DB 151 and the like are stored in the storage unit 15. However, the present invention is not limited to this, and the flow DB 151 and the like may be stored in the RAM 12 or the like in addition to being stored in another DB server (not shown).

  FIG. 3 is an explanatory diagram showing a record layout of the flow DB 151. The CPU 11 receives the flow received from the computer 2 and identification information for specifying the flow (hereinafter referred to as flow ID) via the communication unit 16. The CPU 11 stores the received flow in the flow DB 151 in association with the flow ID. The example of FIG. 3 shows an example of the flow ID 001. In the following description, only the flow with the flow ID 001 is taken up and described for ease of explanation. The flow DB 151 includes a work ID field, a work name field, an activation condition field, a node field, an execution authority field, and the like.

  In the work ID field, identification information (hereinafter, work ID) for specifying the work of the flow is stored. In the example of FIG. 3, work IDs 1 to 10 are stored. In the following description, the work with work ID 1 is read as work 1 in some cases. In the work name field, specific names of work such as “operation check” and “work start approval” are stored. Information for controlling the work order is stored in the activation condition field. For example, OR indicates that the work (work 3 in the example of FIG. 3) is entered when the previous work (work 1 in the example of FIG. 3) is completed. AND indicates that the work (work 8 in the example of FIG. 3) is entered after all the previous work (work 6 and 7 in the example of FIG. 3) is completed.

  The node field stores a work ID to be transferred after the work is finished. For example, in operation 1, it can be understood that the operation moves to operation 2 and operation 3, and after operation 2, the operation moves to operation 4. In operation 3, if the determination in operation 3 is true, the operation proceeds to operation 7, and if the determination in operation 3 is fail, the operation proceeds to operation 5. Since work 10 is the last work, END is stored. In the execution authority field, execution authority for specifying an operator who can execute each work in association with the work ID is stored. For example, the execution authority “admin01” can process the operation 1 only by a specific worker to whom the execution authority “admin01” is granted. The execution authority “AUTO” indicates that the processing is performed by the computer 1, not the worker.

  FIG. 4 is an explanatory view showing the flow of each work, and FIG. 5 is an explanatory view showing the flow of each work with some work omitted. In the present embodiment, for ease of explanation, an example in which the immediately following work is omitted when the immediately following work has the same effect as the immediately preceding work will be described. In the present embodiment, since the effects of the work 3 and the work 5 immediately after the work overlap, the work 5 is omitted as shown in FIG.

  FIG. 6 is an explanatory diagram showing the record layout of the flow DB 151 after compression. Work 5 is deleted, and the node of work 3 is set to work 7. Below, in order to demonstrate easily, it demonstrates based on the flow as described in FIG.

  FIG. 7 is an explanatory diagram showing a record layout of the worker DB 152. The worker DB 152 includes a work name field, an execution authority field, a worker management level field, and the like. In the execution authority field, execution authority is stored in association with the work name. The worker management level field stores the name of the worker who can execute the work according to the level in association with the work name and the execution authority. Although the worker name is used in the present embodiment, the worker ID may be stored.

  The lower the level, the higher the processing capacity for each task. In the present embodiment, a processing speed will be described as an example of processing capacity. In the example of FIG. 7, for the work name “MW3 update”, the level 1 worker is B, the level 2 worker is P, and the level 3 worker is Q. In this case, worker B has the highest processing capability, worker P has the highest processing capability, and worker Q has the lowest processing capability. Based on past work results and the like, the user inputs an operator according to the execution authority and the worker management level to the worker DB 152 through the input unit 13. The CPU 11 stores the worker name corresponding to the input execution authority and worker management level in the worker DB 152.

  FIG. 8 is an explanatory diagram showing a record layout of the required time DB 153. The required time DB 153 stores a processing time (hereinafter referred to as a required time) required for processing by the worker in association with each work name. The required time stores the average required time, the required time for the level 1 worker, the required time for the level 2 worker, and the required time for the level 3 worker. For example, for the work name “completion confirmation”, the average required time is 10 minutes, the fastest time required for level 1 is 7 minutes, the next time required for level 2 is 15 minutes, and the time required for level 3 is the longest. The time is 16 minutes. The user obtains the average processing time and the required time for each level based on the required time of each worker in the past, and inputs the required time through the input unit 13. The CPU 11 stores the input required time in the required time DB 153.

  FIG. 9 is an explanatory diagram showing a record layout of the candidate DB 154. The candidate DB 154 stores a candidate worker who can perform the work and the required time of each candidate worker in association with the work ID and the execution authority. For example, for the work name “examine application”, the candidate workers are A and R. The time required for the worker A is 7 minutes, and the work time for the worker R is 15 minutes. When the execution authority is “AUTO” (operation 4), the candidate operator is not stored because the computer 1 executes the operation authority.

  The candidate workers with the work name “MW3 update” are the worker A, the worker D, the worker E, the worker F, and the worker G. In this embodiment, in order to facilitate the explanation, the candidate workers are selected. There are three workers, worker A, worker D, and worker E. The CPU 11 reads the worker and level corresponding to the execution authority with reference to the worker DB 152. The CPU 11 stores the candidate worker in the candidate DB 154 in association with the execution authority. The CPU 11 refers to the worker DB 152 and reads the worker corresponding to the work name and execution authority and the level of each worker. The CPU 11 refers to the required time DB 153 and reads the required time at each level corresponding to the work name and execution authority. The CPU 11 refers to the level of each candidate worker and stores the required time corresponding to the level in the candidate DB 154.

  FIG. 10 is an explanatory diagram showing a record layout of the schedule DB 155. As shown in FIG. The schedule DB 155 stores an average required time, an average start time, and an average end time in association with the work ID. The average required time stores the average required time required to process each work. The average end time stores the time when each work is completed. The average start time is a start time when a new work is started. The first time is 0, and the second and subsequent times are the same as the previous average end time. In the embodiment, for ease of explanation, the average start time and the average end time are not the actual time but the elapsed time.

  The CPU 11 refers to the required time DB 153 and reads the average required time corresponding to each work name. The CPU 11 stores the read average required time in the schedule DB 155 in association with the work name. The CPU 11 refers to the node information, adds the previous average end time to the previous average required time, and calculates the average end time. The CPU 11 stores the calculated average end time in association with the work ID. The first average end time is 10 minutes, which is the average required time for work 1, since there is no previous average required time.

  The CPU 11 refers to the node information, and stores it in the schedule DB 155 with the average end time of the immediately preceding work as the average start time. When AND is stored in the activation condition, the CPU 11 stores the latest average end time among the previous average end times in the schedule DB 155 as the average start time. For example, the work immediately before the work 8 is performed in parallel with the work 6 and the work 7. Since the average end time of the work 6 is 100 and the average end time of the work 7 is 90, the CPU 11 sets the average work end time 100 of the work 6 as the average work start time of the work 8.

  FIG. 11 is an explanatory diagram showing a record layout of the setting DB 156. The setting DB 156 includes an operator field, a required time field, a start time field, an end time field, and the like in addition to the above-described work ID field. In the worker field, among the candidate workers, workers assigned according to conditions described later are stored. The required time field stores the required time required for the operator's work. The start time field stores the time at which the work starts, and the end time field stores the time at which the work ends.

  In the example of FIG. 11, work 1 is worker A, work 2 is worker A, work 3 is worker A, work 7 is worker B, work 6 is worker C, work 8 is worker D, work 9 is Worker E and worker 10 are assigned worker F, respectively. The CPU 11 refers to the worker DB 152 and the required time DB 153 and stores the required time corresponding to the level of each person in charge in the setting DB 156. The CPU 11 calculates the start time and end time of each worker by the method described above, and stores it in the setting DB 156.

  Next, allocation conditions will be described. As the allocation condition C1-1, the CPU 11 refers to the candidate DB 154 and extracts the worker with the shortest required time from the candidate workers. At this time, the CPU 11 sets the extracted worker as user_this. As the allocation condition C1-2, the CPU 11 determines whether the worker of the previous work in time series matches the worker of the target work. If the CPU 11 determines that they match, user_p is set in user_this.

  As the allocation condition C1-2-a, the CPU 11 determines that the previous worker in time series and the candidate worker of the target task are the same, and the addition time obtained by adding the required time to the accumulated required time is the second set time (for example, 80 Min). When the addition time does not exceed the second set time, the CPU 11 assigns the same worker to the target work. The second set time is stored in advance in the storage unit 15 in association with the work. When the addition time exceeds the second set time, the CPU 11 assigns another candidate worker to the target work. For example, consider a continuous operation of operation 1-operation 2-operation 3. Here, it is assumed that worker 1 has been assigned to work 1 (worker A required time 20 minutes) −work 2 (worker A required time 30 minutes), and the worker of work 3 is set.

  It is assumed that the worker user_this is the worker A according to the allocation conditions, C1-1 and C1-2. Worker A processes work 1 and work 2. Since worker A is assigned a work prior to work 3, the total required time is 50 minutes (20 minutes + 30 minutes). Since the time required for user_this (worker A) of work 3 is 20 minutes, when work 3 is assigned to worker A, the addition time is 70 minutes. Here, when the second set time is 80 minutes, the worker A is reassigned to the work 3. When the addition time is 90 minutes, among the other candidate workers, the worker with the shortest required time is assigned to the operation 3.

  As the allocation condition 2-1, the CPU 11 determines whether or not the continuous work time (user_this == user_p) exceeds a first set time (for example, 60 minutes). When the continuous work time does not exceed the first set time, the CPU 11 assigns the same worker. When the continuous work time exceeds the first set time, the CPU 11 assigns the worker having the shortest required time among other candidate workers.

  As the allocation condition 2-2, the CPU 11 determines whether or not the worker's fatigue level is equal to or less than a threshold value. CPU11 allocates the same worker, when a worker's fatigue degree is below a threshold. When the worker's fatigue level exceeds the threshold, the CPU 11 assigns the worker having the shortest required time among other candidate workers.

  FIG. 12 is an explanatory diagram showing the temporal change in the degree of fatigue. The horizontal axis of the graph shown in FIG. 12 indicates time, and the vertical axis indicates the degree of fatigue. When the same worker processes continuously assigned tasks, the fatigue level becomes 1 when the consecutive tasks are finished. In the following, a work that is continuously processed by the same worker and a single work that is not continuous are referred to as a work lump. In the example of FIGS. 11 and 12, the worker A continuously performs the operations 1 to 3. In this case, work 1 to work 3 become a work lump. Further, when the worker A performs the work 1 and the worker B performs the work 2, each of the work 1 and the work 2 becomes a work lump. The CPU 11 has a unit fatigue level at the end time t = 21 when the work piece is finished. In the present embodiment, the unit fatigue degree associated with working one work lump is assumed to be 1. When the work has not been performed since the end of the work, the CPU 11 calculates the degree of fatigue by multiplying a constant coefficient by a time during which the work is not performed (hereinafter referred to as a non-work time). The degree of fatigue after completion of the work lump can be expressed by the following formula 1.

  Fatigue after completion of work lump = Fatigue at end of work lump-factor x non-working time (1)

  The calculation formula for the fatigue level is stored in the storage unit 15. In the embodiment, an example using 0.25 / 60 minutes as a coefficient will be described. At the time t = 21, the work block is at the end stage, and the fatigue level is unit fatigue level 1. When the end time of the work 6 is t = 94, the CPU 11 subtracts a value obtained by multiplying the coefficient 1 by the non-work time 73 minutes (94 minutes-21 minutes) from the fatigue level 1 at the end of the work chunk, and ends the work chunk. The later fatigue level of 0.69 is calculated. The CPU 11 reads a threshold value (for example, 0.5) from the storage unit 15. The CPU 11 has a fatigue level of 0.69 and is larger than the threshold value 0.5. Therefore, the CPU 11 refers to the candidate DB 154 and extracts a worker with a short work time from other candidate workers in order to rest the worker A.

  In the example of FIG. 11, the candidate workers are worker A, worker D, and worker E. The CPU 11 selects the worker D or the worker E because the worker A has a fatigue level exceeding the threshold value according to the allocation condition 2-2. In this embodiment, the worker D is finally assigned to the work 8. On the other hand, when the fatigue level of the worker A is equal to or less than the threshold value, the CPU 11 reassigns the worker A with a fast required time. In this case, the fatigue level of the worker A is further incremented by the unit fatigue level 1 when the work lump related to the work 8 is finished.

  FIG. 13 is an explanatory diagram showing a temporal change in the fatigue level. For example, when the worker A processes the work 8 at the time t = 100, the CPU 11 adds the unit fatigue degree 1 to the fatigue degree at the time t = 100. The CPU 11 calculates the fatigue level that decreases from the time when the work 8 that is a work lump is completed until the work 9 and the work 10 start based on the formula 1. CPU11 judges whether the fatigue degree at the time of performing work 9 and 10 exceeds a threshold (for example, 3). When the CPU 11 determines that the fatigue level is equal to or less than the threshold value, the CPU 11 assigns the work 9 and 10 that are new work blocks to the worker A. The CPU 11 adds the unit fatigue level 1 to the calculated fatigue level to calculate the fatigue levels at the end times of the work 9 and the work 10.

  Next, the assignment of workers to each work in FIG. 11 will be described. The CPU 11 refers to the candidate DB 154 and reads the candidate worker and the required time for the work 1. In the example of FIG. 9, candidate worker A, required time 7 minutes, candidate worker R, and required time 15 minutes are read out. The CPU 11 assigns the worker A having a short required time based on the assignment condition C1-1. The CPU 11 stores worker A in association with work 1 in the setting DB 156 shown in FIG. Note that since this is the first determination, the CPU 11 does not determine other allocation conditions.

  The CPU 11 stores a required time of 7 minutes and an end time of 7 minutes in the setting DB 156 in association with the work 1. The CPU 11 calculates the end time 7 minutes by adding the required time 7 minutes to the start time 0 minutes. The CPU 11 reads the candidate worker and the required time for the work 2 with reference to the candidate DB 154. In the example of FIG. 9, candidate worker A, required time 7 minutes, candidate worker R, and required time 15 minutes are read out. The CPU 11 assigns the worker A having a short required time based on the assignment condition C1-1.

  The CPU 11 sets the worker A (user_this) to user_p because it is the same as the worker of the work 1 according to the assignment condition C1-2. In the CPU 11, the previous worker in time series and the candidate worker of the target work are the same, and the addition time obtained by adding the required time 7 minutes of the worker A to the accumulated required time 7 minutes is the second set time (for example, 80 Min). The CPU 11 determines that the second set time has not been exceeded. The CPU 11 maintains worker A as a candidate worker. As the assignment condition 2-1, the CPU 11 determines whether or not the continuous work time (14 minutes, user_this == user_p) when a work is newly assigned exceeds a first set time (for example, 60 minutes). The CPU 11 determines that the first set time has not been exceeded.

  Since the CPU 11 is in the middle of a work lump with respect to the allocation condition 2-2, the fatigue level of the worker A is 0 and is determined to be equal to or less than the threshold. As described above, the CPU 11 stores the candidate worker as the worker A in association with the work 2 in the setting DB 156. The CPU 11 stores the required time of 7 minutes, the start time of 7 minutes, and the end time of 14 minutes in the setting DB 156 in association with the work 2. The CPU 11 sets the start time to the same value as the previous end time in time series. The CPU 11 calculates the end time 14 minutes by adding the required time 7 minutes to the start time 7 minutes.

  The CPU 11 reads the candidate worker and the required time for the work 3 with reference to the candidate DB 154. In the example of FIG. 9, candidate worker A, required time 7 minutes, candidate worker R, and required time 15 minutes are read out. The CPU 11 assigns the worker A having a short required time based on the assignment condition C1-1.

  The CPU 11 sets the worker A (user_this) to user_p because it is the same as the worker A of the task 2 according to the allocation condition C1-2. In the CPU 11, the previous worker and the candidate worker of the target work are the same in time series, and the addition time obtained by adding the required time 7 minutes of the worker A to the accumulated required time 14 minutes is the second set time (for example, 80 Min). The CPU 11 determines that the second set time has not been exceeded. The CPU 11 maintains worker A as a candidate worker. As the assignment condition 2-1, the CPU 11 determines whether or not the continuous work time (21 minutes, user_this == user_p) when work is newly assigned exceeds a first set time (for example, 60 minutes). The CPU 11 determines that the first set time has not been exceeded.

  Since the CPU 11 is in the middle of a work lump with respect to the allocation condition 2-2, the fatigue level of the worker A is 0 and is determined to be equal to or less than the threshold. As described above, the CPU 11 stores the candidate worker as the worker A in association with the work 3 in the setting DB 156. The CPU 11 stores a required time of 7 minutes, a start time of 14 minutes, and an end time of 21 minutes in the setting DB 156 in association with the work 3.

  The CPU 11 refers to the candidate DB 154 and the required time DB 153 to read out the worker and the required time of the work 4. In the example of FIGS. 8 and 9, AUTO indicating automatic execution of the computer 1 is stored, and the required time is stored as 40 minutes. The CPU 11 does not store information related to the assignment of workers corresponding to the work 4 in the setting DB 156 for the automatic processing of the computer 1. The CPU 11 stores the required time 40 minutes, the start time 14 minutes, and the end time 54 minutes in the setting DB 156 in association with the work 4.

  Subsequently, the operation 7 processed after the operation 3 will be considered. The CPU 11 reads the candidate worker and the required time for the work 7 with reference to the candidate DB 154. In the example of FIG. 9, candidate worker B, required time 70 minutes, candidate worker P, required time 80 minutes, worker Q, and required time 170 minutes are read. The CPU 11 assigns the worker B having a short required time based on the assignment condition C1-1. If the required time is long like the worker Q, it may be deleted from the candidate workers. For example, the CPU 11 refers to the required time DB 153 shown in FIG. 8, and if the required time 170 minutes of the worker Q exceeds twice the average processing time 70 minutes (140 minutes), the worker Q is selected as the candidate worker. Delete from.

  Since the CPU 11 is not the same as the worker A of the work 3 regarding the assignment conditions C1-2, C1-2-a, 2-1, the CPU 11 shifts to the next assignment condition. With respect to the allocation condition 2-2, the CPU 11 determines that the worker B is the first work and the fatigue level is 0, which is equal to or less than the threshold value. In addition, the worker A finishes the processing of the work chunks of the work 1 to 3, and the unit fatigue degree 1 is added. The CPU 11 stores the fatigue level of the worker A in association with the work 3 in the RAM 12.

  As described above, the CPU 11 stores the candidate worker as the worker B in association with the work 7 in the setting DB 156. The CPU 11 stores the required time of 70 minutes, the start time of 21 minutes (end time of the work 3), and the end time of 91 minutes in association with the work 7 in the setting DB 156.

  The CPU 11 reads the candidate worker and the required time for the work 6 with reference to the candidate DB 154. In the example of FIG. 9, candidate worker B, required time 30 minutes, candidate worker C, required time 40 minutes are read out. The CPU 11 assigns the worker B having a short required time based on the assignment condition C1-1. The CPU 11 sets the worker B (user_this) to user_p because the start time is the same as the worker B of the previous task 7 according to the allocation condition C1-2. In the CPU 11, the previous worker in time series and the candidate worker of the target work are the same, and the addition time obtained by adding the required time of the worker B to the cumulative required time of 91 minutes is the second set time (for example, 80 Min).

  Since the addition time exceeds the second set time, the CPU 11 assigns the work 6 to the worker C who is another candidate worker. Since the worker C is the first assignment, the CPU 11 assigns the work 6 to the worker C without determining other assignment conditions. Note that the worker B finishes the processing of the work lump of the work 7, and the unit fatigue level 1 is added. The CPU 11 stores the fatigue level of the worker B in association with the work 7 in the RAM 12.

  As described above, the CPU 11 stores the candidate worker as the worker C in association with the work 6 in the setting DB 156. The CPU 11 stores the required time 40 minutes, the start time 54 minutes (the end time of the work 4), and the end time 94 minutes in the setting DB 156 in association with the work 6. As for the work 8, as described above, the worker D is assigned because the degree of fatigue exceeds the threshold value under the assignment condition 2-2. The CPU 11 stores the required time 15 minutes, the start time 94 minutes (end time of the work 7), and the end time 109 minutes of the worker D in association with the work 8 in the setting DB 156.

  Next, the CPU 11 considers the work 9. The CPU 11 refers to the candidate DB 154 and reads out the candidate worker and the required time for the work 9. In the example of FIG. 9, candidate worker E, required time 15 minutes, candidate worker B, required time 16 minutes are read out. The CPU 11 assigns the worker E having a short required time based on the assignment condition C1-1. Since the average start time is not assigned to the previous work for the worker E, the CPU 11 assigns the work 9 to the worker E without determining other assignment conditions. In addition, the worker D finishes the processing of the work lump of the work 8, and the unit fatigue degree 1 is added. The CPU 11 stores the fatigue level of the worker D in association with the work 8 in the RAM 12.

  As described above, the CPU 11 stores the candidate worker as the worker E in the setting DB 156 in association with the work 9. The CPU 11 stores the required time 15 minutes, the start time 109 minutes (end time of the work 8), and the end time 124 minutes in association with the work 9 in the setting DB 156.

  Next, the CPU 11 considers the work 10. The CPU 11 refers to the candidate DB 154 and reads the candidate worker and the required time for the work 10. In the example of FIG. 9, candidate worker F, required time 15 minutes, candidate worker C, required time 16 minutes are read out. The CPU 11 assigns the worker F having a short required time based on the assignment condition C1-1. Since the average start time is not assigned to the previous work for the worker F, the CPU 11 assigns the work 10 to the worker F without determining other assignment conditions. Note that the worker E finishes the processing of the work chunk of the work 9, and the unit fatigue level 1 is added. The CPU 11 stores the fatigue level of the worker E in the RAM 12 in association with the work 9.

  As described above, the CPU 11 stores the candidate worker as the worker F in association with the work 10 in the setting DB 156. The CPU 11 stores the required time of 15 minutes, the start time of 124 minutes (end time of the work 9), and the end time of 139 minutes in association with the work 10 in the setting DB 156. With the above processing, the first worker assignment setting is completed.

  Each software process in the above hardware group will be described using a flowchart. FIG. 14 is a flowchart showing a procedure for determining candidate workers and required time. For example, the CPU 11 acquires a flow from another computer 2 (step S141). The CPU 11 stores the work name in the candidate DB 154 in association with the work ID (step S142). The CPU 11 refers to the worker DB 152 and the required time DB 153, and reads out candidate workers corresponding to each work name and the required time of each candidate worker (step S143). The CPU 11 stores the read candidate worker and the required time of each candidate worker in the candidate DB 154 in association with the work ID (step S144).

  FIG. 15 is a flowchart showing a procedure for calculating the average start time and the average end time. The CPU 11 reads the acquired flow (step S151). The CPU 11 reads out the average required time corresponding to the work name from the required time DB 153 (step S152). The CPU 11 stores the read average required time in the schedule DB 155 in association with the work name (step S153). The CPU 11 stores the average start time of the first work as 0 in the schedule DB 155 (step S154). The CPU 11 stores the first average required time in the schedule DB 155 at the first average end time (step S155).

  The CPU 11 stores the average end time of the previous work in the read flow as the average start time (step S156). The CPU 11 stores the time obtained by adding the average required time to the average start time in the schedule DB 155 as the average end time (step S157).

  FIG. 16 is a flowchart showing the first work assignment procedure. CPU11 reads schedule DB155 (step S161). The CPU 11 stores the read contents of the schedule DB 155 in the setting DB 156 (step S162). The CPU 11 refers to the candidate DB 154 and reads out the candidate worker for the first work and the time required for each candidate worker (step S163). The CPU 11 extracts candidate workers with the shortest required time (step S164).

  The CPU 11 stores the extracted candidate worker in the setting DB 156 in association with the work ID (step S165). The CPU 11 stores the extracted time required for the candidate worker in the setting DB 156 in association with the work ID (step S166). The CPU 11 stores the start time as 0 in the setting DB 156 (step S167). The CPU 11 stores the required time as the end time in the setting DB 156 (step S168).

  FIG. 17 and FIG. 18 are flowcharts showing a procedure for assigning work after the second time. The CPU 11 reads out the candidate worker corresponding to the work name and the time required for each candidate worker from the candidate DB 154 (step S171). The CPU 11 extracts candidate workers with the shortest required time (step S172). The CPU 11 refers to the setting DB 156 to determine whether the candidate worker extracted in step S172 is the same as the candidate worker for the previous work (step S173).

  If the CPU 11 determines that they are not the same (NO in step S173), the process proceeds to step S183. If the CPU 11 determines that they are the same (YES in step S173), the process proceeds to step S174. The CPU 11 reads the end time of the previous work (step S174). The CPU 11 calculates the end time of the current work by adding the required time of the candidate worker to the end time of the previous work (step S175). The CPU 11 reads the second set time from the storage unit 15 and reads the average end time of the current work with reference to the setting DB 156 (step S176). The CPU 11 determines whether or not a value obtained by subtracting the average end time from the end time exceeds the second set time (step S177).

  If the CPU 11 determines that the second set time is exceeded (YES in step S177), the process proceeds to step S182. If the CPU 11 determines that the second set time is not exceeded (NO in step S177), the process proceeds to step S178. The CPU 11 calculates the total time required for the candidate workers to continue with reference to the setting DB 156 (step S178).

  The CPU 11 reads the first set time from the storage unit 15 (step S179). The CPU 11 determines whether or not the total time exceeds the first set time (step S181). If the CPU 11 determines that the set time is exceeded (YES in step S181), the process proceeds to step S182. In the case of YES in step S177 and in the case of YES in step S181, the CPU 11 extracts candidate workers with the next shortest required time from the plurality of candidate workers read out in step S171 (step S182). If the CPU 11 determines that the total time does not exceed the first set time after step S182 (NO in step S181), the process proceeds to step S183. Further, after step S182, if NO in step S173, the CPU 11 executes the process of step S183.

  The fatigue level of the candidate worker is calculated (step S183). The fatigue level calculation process will be described later. The CPU 11 determines whether or not the calculated fatigue level is equal to or less than a threshold value (step S184). If the CPU 11 determines that it is not equal to or less than the threshold (NO in step S184), the process proceeds to step S186. The CPU 11 refers to the candidate DB 154 and extracts candidate workers with the next shortest required time (step S186). After that, the CPU 11 returns the process to step S183.

  If the CPU 11 determines that the value is equal to or smaller than the threshold value (YES in step S184), the process proceeds to step S185. The CPU 11 stores candidate workers to be finally assigned in the setting DB 156 (step S185). The CPU 11 stores the required time of the candidate worker in the setting DB 156 in association with the work ID (step S187). The CPU 11 stores the previous work end time in the setting DB 156 as a start time (step S188). The CPU 11 stores the time obtained by adding the start time and the required time as the end time in the setting DB 156 (step S189).

  FIG. 19 is a flowchart showing a procedure for calculating the degree of fatigue. The CPU 11 determines whether the candidate worker is the same as the previous worker (step S191). If the CPU 11 determines that they are not the same (NO in step S191), the process proceeds to step S192. The CPU 11 counts the number of work groups (work chunks) that are consecutive in the previous work assigned to the candidate worker (step S192). The CPU 11 counts the number of work (work chunks) that are not consecutive in the previous work assigned to the candidate worker (step S193).

  The CPU 11 calculates the total value of the values counted in steps S192 and S193 (step S194). Note that the CPU 11 may multiply the total value by a coefficient. The CPU 11 reads the start time of the current work (step S195). The CPU 11 calculates the total non-working time of the non-working time during which the work from the end time to the start time of the previous worker is not performed and the non-working time during which no work is performed between the plurality of work of the worker Calculate (step S196).

  The CPU 11 calculates a fatigue level by subtracting a value obtained by multiplying the total non-working time by a coefficient smaller than 1 from the total value calculated in step S194 (step S197). If the CPU 11 determines that the candidate worker is the same as the previous worker (YES in step S191), the CPU 11 proceeds to step S198. Since the CPU 11 is a continuous operation in this case, the fatigue level at the previous calculation is read in order to keep the fatigue level unchanged (step S198). As a result, it is possible to perform work continuously by the same person in charge and to improve work efficiency. Further, since the fatigue level based on the non-working time during which no work is performed is utilized, it becomes possible to assign workers more appropriately.

  It is also possible to assign different workers as appropriate in order to prevent fatigue due to continuous work. Furthermore, it is possible to prevent the overall processing time from being delayed as the same worker performs the work.

Embodiment 2
The second embodiment relates to a mode in which the contents of the setting DB 156 are updated. FIG. 20 is a block diagram illustrating a hardware group of the computer 1 according to the second embodiment. The storage unit 15 is further provided with an update DB 157. FIG. 21 is an explanatory diagram showing a record layout of the update DB 157. The CPU 11 refers to the stored contents of the setting DB 156 shown in FIG.

  The CPU 11 determines whether or not the worker assigned the subsequent work in time series is different from the worker assigned the work before the work. When the CPU 11 determines that they are different, the CPU 11 refers to the candidate DB 154 and determines whether or not the worker of the subsequent work can process the work of the previous work. When the CPU 11 determines that processing is possible, the CPU 11 performs processing for changing the worker of the previous work to the worker of the subsequent work. In the example of FIG. 21, the worker of the later work ID 10 in time series is F, and the worker of the previous work ID 9 in time series is E, so they are different from each other. The CPU 11 determines whether or not the worker F who processes the subsequent work can process the previous work (work ID 9). The CPU 11 refers to the candidate DB 154 and determines that the worker F cannot process the previous work (work ID 9).

  In this case, the CPU 11 does not match the update condition, and therefore does not perform the worker update process. Subsequently, the CPU 11 performs the same processing for the combination of the work ID 9 and the work ID 8. The CPU 11 judges that the worker with the later work ID 9 in the time series is E, and the worker with the previous work ID 8 in the time series is D, so that they are different from each other. The CPU 11 determines whether or not the worker E who processes the later work can process the previous work (work ID 8). The CPU 11 refers to the candidate DB 154 and determines that the worker E can process the previous work (work ID 8).

  Since the worker E can process the work with the work ID 8, the CPU 11 updates the worker with the work ID 8 from D to E. The CPU 11 stores the updated information in the update DB 157. The CPU 11 updates the required time, start time, and end time with reference to the required time of the worker stored in the candidate DB 154 with the update of the worker. In the example of FIG. 21, since the required time for both the worker D and the worker E is 15 minutes, the required time, the start time, and the end time are not updated. The CPU 11 refers to the updated update DB 157 and repeats the process described above.

  The CPU 11 performs the same processing for the combination of work ID 8 and work ID 6. The CPU 11 judges that the worker with the later work ID 8 in the time series is E and the worker with the previous work ID 6 in the time series is C, so that they are different from each other. The CPU 11 determines whether or not the worker E who processes the later work can process the previous work (work ID 6). The CPU 11 refers to the candidate DB 154 and determines that the worker E cannot process the previous work (work ID 6). The CPU 11 repeatedly executes the above processing in the same manner.

  22 and 23 are flowcharts showing the procedure of the update process. CPU11 reads setting DB156 (step S221). The CPU 11 copies the stored contents of the setting DB 156 to the update DB 157 (step S222). The CPU 11 reads the worker of the last work in time series (step S223). The CPU 11 reads out a further previous worker in time series (step S224). The CPU 11 determines whether or not the workers before and after are different (step S225).

  If the CPU 11 determines that they are different (YES in step S225), the process proceeds to step S226. The CPU 11 refers to the candidate DB 154 and determines whether or not the worker of the subsequent work can process the work of the previous work (step S226). If the CPU 11 determines that the process can be performed (YES in step S226), the process proceeds to step S227. The CPU 11 changes the worker of the previous work to the worker of the subsequent work (step S227). The CPU 11 reads out the time required for the updated worker by referring to the candidate DB 154 (step S228).

  The CPU 11 changes the required time and the work end time updated based on the read required time (step S229). The CPU 11 changes the start time and end time of the subsequent work in accordance with the change of the end time of the previous work (step S231). When the CPU 11 determines that the preceding and following workers are not different (NO in step S225), the CPU 11 determines that the rear worker cannot process the previous task (NO in step S226), and step S231. After the process, the process proceeds to step S232.

  The CPU 11 refers to the update DB 157 and determines whether or not the subsequent work is the first work (work ID 1) (step S232). If the CPU 11 determines that it is not the first work (NO in step S232), the process proceeds to step S233. Next, the CPU 11 reads out workers of subsequent work in time series (step S233). The CPU 11 then returns the process to step S224. By repeating the above processing, the operator is updated for each combination of tasks in order from the later work in time series. If the CPU 11 determines that the subsequent work is the first work (YES in step S232), the process proceeds to step S234.

  The CPU 11 determines whether or not the changed worker satisfies the allocation condition described in steps S173 to S186 (step S234). Specifically, the CPU 11 determines whether YES is determined in step S177, YES in step S181, and NO in step S186 based on the changed worker, required time, start time, end time, and the like.

  If the CPU 11 determines that the allocation condition is not satisfied (NO in step S234), that is, if it is necessary to extract another candidate worker, the process proceeds to step S235. The CPU 11 restores the contents changed in steps S227, 229, and 231 (step S235). That is, the CPU 11 stores data having the same contents as the stored contents of the setting DB 156 in the update DB 157. On the other hand, when determining that the allocation condition is satisfied (YES in step S234), the CPU 11 stores the changed worker in the update DB 157 (step S236). Similarly, the CPU 11 stores the changed required time, start time, and end time in the update DB 157. By updating so that continuous work can be performed in this way, it is possible to propose worker assignments of different aspects.

  The second embodiment is as described above, and the other parts are the same as those of the first embodiment. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 3
The third embodiment relates to a mode for changing worker assignment. FIG. 24 is a block diagram illustrating a hardware group of the computer 1 according to the third embodiment. The storage unit 15 further includes a second setting DB 158, a second update DB 159, a third setting DB 1510, and a third update DB 1511. FIG. 25 is an explanatory diagram showing a record layout of the second setting DB 158. The CPU 11 copies the allocated data stored in the update DB 157 to the second setting DB 158.

  CPU11 extracts the operator judged to exceed 2nd setting time in step S177. That is, the CPU 11 extracts workers who meet the allocation condition C1-2-a. In the embodiment described above, the worker B in the operation 6 exceeds the second set time. The CPU 11 refers to the start time, and assigns a worker different from the worker to the previous work that continues in time series when the extracted worker is assigned the work before the time series. In the example of FIG. 25, when the work 6 is assigned, it is the worker B that exceeds the second set time.

  The CPU 11 assigns a worker P that is different from the worker B with reference to the candidate DB 154 because the worker B is assigned the previous work (work ID 7) that continues in time series. The CPU 11 may further assign the worker B to the work 6.

  26 and 27 are flowcharts showing the procedure of the second setting process. The CPU 11 reads the stored contents of the update DB 157 (step S261). The CPU 11 copies the stored contents of the update DB 157 read to the second setting DB 158 (step S262). CPU11 extracts the operation | work and operator judged that it exceeded 2nd setting time in step S177 (step S263). The CPU 11 extracts the worker of the previous work that continues in time series with respect to the extracted work (step S264).

  The CPU 11 determines whether or not the worker extracted in step S263 is the same as the worker extracted in step S264 (step S265). If the CPU 11 determines that they are not identical (NO in step S265), the process ends. If the CPU 11 determines that they are the same (YES in step S265), the process proceeds to step S266. The CPU 11 refers to the candidate DB 154 and reads out a candidate worker different from the worker of the previous work (step S266). The CPU 11 changes the worker of the previous work to the read candidate worker (step S267). The CPU 11 similarly refers to the candidate DB 154, and changes the worker who is determined to exceed it to another candidate worker (step S268). In step S267 and step S268, candidate workers with a short required time may be read out. Moreover, CPU11 complete | finishes a process, when there are no other candidates.

  The CPU 11 refers to the candidate DB 154 and reads the required time of the worker after the change (step S269). The CPU 11 changes the required time and the end time based on the read required time (step S271). The CPU 11 changes the start time and end time of the subsequent work (step S272). The CPU 11 determines whether the candidate worker after the change satisfies the allocation condition described in steps S173 to S186 (step S273). Specifically, the CPU 11 determines whether YES is determined in step S177, YES in step S181, and NO in step S186 based on the changed worker, required time, start time, end time, and the like.

  If the CPU 11 determines that the allocation condition is not satisfied (NO in step S273), that is, if it is necessary to extract another candidate worker, the process proceeds to step S275. The CPU 11 restores the contents changed in steps S267, 268, 271 and 272 (step S275). That is, the CPU 11 stores data having the same content as the content stored in the update DB 157 in the second setting DB 158. On the other hand, when determining that the allocation condition is satisfied (YES in step S273), the CPU 11 stores the changed candidate worker in the second setting DB 158 (step S274). Similarly, the CPU 11 stores the required time, the start time, and the end time after the change in the second setting DB 158. In the present embodiment, an example in which the second setting process is performed based on the update DB 157 after the update process has been described. The second setting process may be performed based on the setting DB 156 that has not been updated.

  Subsequently, the CPU 11 performs a second update process. FIG. 28 is an explanatory diagram showing a record layout of the second update DB 159. The CPU 11 copies the stored contents of the second setting DB 158 to the second update DB 159. CPU11 performs the process of FIGS. 22-23 described in Embodiment 2 with respect to the data memorize | stored in 2nd update DB159. In the example of FIG. 28, the worker of the work 7 is P, and other candidates B can process the work 7. However, when both the work 7 and the work 6 are the worker B, the assignment condition C-1-2-a is not satisfied, so the worker is not updated, and the second update DB 159 and the second setting DB 158 are stored. The contents are the same. This makes it possible to easily obtain different worker assignments.

  The third embodiment is as described above, and the others are the same as in the first and second embodiments. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 4
The fourth embodiment relates to a form in which worker assignment is changed according to the degree of fatigue. FIG. 29 is an explanatory diagram showing a record layout of the third setting DB 1510. CPU11 extracts the operation | work and operator judged that it exceeds the threshold value of fatigue degree by step S184. The CPU 11 determines whether or not the extracted worker is assigned the previous work in time series. When the CPU 11 determines that the previous work is assigned in time series, the CPU 11 changes the worker of the previous work to another candidate worker. In the example of FIG. 29, it is determined that the worker A having the shortest required time in the work ID 8 has a fatigue level exceeding the threshold value. The worker A has already been assigned tasks in the previous tasks 1 to 3 in time series. In this case, the CPU 11 changes the workers of operations 1 to 3 from A to R. Further, the CPU 11 changes the worker of the work 8 to A. The CPU 11 stores the changed worker in the third setting DB 1510.

  30 and 31 are flowcharts showing the procedure of the change process. CPU11 reads the memory content of 2nd update DB159 (step S301). The CPU 11 copies the stored contents of the second update DB 159 read to the third setting DB 1510 (step S302). CPU11 extracts the operation | work and operator judged that the fatigue degree exceeds a threshold value in step S184 (step S303). The CPU 11 extracts workers of the previous work in time series with respect to the extracted work (step S304).

  The CPU 11 extracts the work assigned to the same worker as the worker extracted in step S303 (step S305). Note that if the work to which the same worker is assigned cannot be extracted in step S305, the process ends. The CPU 11 refers to the candidate DB 154 and reads a candidate worker different from the worker assigned to the work extracted in step S305 (step S306). The CPU 11 changes the worker of the previous work to the read candidate worker (step S307). The CPU 11 similarly refers to the candidate DB 154, and changes the worker who is determined to exceed it to another candidate worker (step S308). In step S307 and step S308, candidate workers having a short required time may be read out. Moreover, CPU11 complete | finishes a process, when there are no other candidates.

  The CPU 11 refers to the candidate DB 154 and reads the required time after the change (step S309). The CPU 11 changes the required time and the end time based on the read required time (step S311). The CPU 11 changes the start time and end time of the subsequent work (step S312). The CPU 11 determines whether the candidate worker after the change satisfies the allocation condition described in steps S173 to S186 (step S313). Specifically, the CPU 11 determines whether YES is determined in step S177, YES in step S181, and NO in step S186 based on the changed worker, required time, start time, end time, and the like.

  If the CPU 11 determines that the allocation condition is not satisfied (NO in step S313), that is, if it is necessary to extract another candidate worker, the process proceeds to step S315. The CPU 11 restores the contents changed in steps S307, 308, 311 and 312 (step S315). That is, the CPU 11 stores data having the same content as the content stored in the second update DB 159 in the third setting DB 1510. On the other hand, when determining that the allocation condition is satisfied (YES in step S313), the CPU 11 stores the changed candidate worker in the third setting DB 1510 (step S314). Similarly, the CPU 11 stores the changed required time, start time, and end time in the third setting DB 1510.

  Subsequently, the CPU 11 performs a third update process. FIG. 32 is an explanatory diagram showing a record layout of the third update DB 1511. The CPU 11 copies the stored contents of the third setting DB 1510 to the third update DB 1511. CPU11 performs the process of FIGS. 22-23 described in Embodiment 2 with respect to the data memorize | stored in 3rd update DB1511. In the example of FIG. 32, the worker of the work 8 is A, but since there is another candidate worker E that is the same as the worker E of the work 9, the worker E is assigned to the work 8. In addition, although it decided to perform Embodiment 4 which considered the fatigue degree after the process of Embodiment 3 which considered 2nd setting time, it does not restrict to this. The processing of the fourth embodiment in consideration of the degree of fatigue may be performed first, and then the processing of the third embodiment in consideration of the second set time may be executed. This makes it possible to easily obtain different worker assignments.

  The fourth embodiment is as described above, and the others are the same as those of the first to third embodiments. Therefore, the corresponding parts are denoted by the same reference numerals and detailed description thereof is omitted.

Embodiment 5
The fifth embodiment relates to a mode in which one candidate data is selected from a plurality of candidate data. The CPU 11 reads candidate data stored in the setting DB 156, the update DB 157, the second setting DB 158, the second update DB 159, the third setting DB 1510, and the third update DB 1511. The CPU 11 calculates an evaluation value based on the processing time of candidate data stored in each DB, the number of operations, the number of continuous operations, and the degree of fatigue. The CPU 11 selects one candidate data according to the calculated evaluation value.

  The CPU 11 multiplies the first parameter by the coefficient A, multiplies the second parameter by the coefficient B, and multiplies the third parameter by the coefficient C. The CPU 11 uses a total value obtained by multiplying each parameter by a coefficient as an evaluation value. The coefficients A to C are assumed to be 1 for ease of explanation, but appropriate values may be adopted. FIG. 33 is an explanatory diagram showing an example of candidate data. The first parameter is a value obtained by subtracting a division value obtained by dividing the end time by the average end time from 1. In the example of FIG. 33, the division value is a value obtained by dividing the end time 136 by the average end time 130. The CPU 11 calculates the first parameter by subtracting the division value from 1.

  In calculating the second parameter, the CPU 11 calculates the average of the work lump, the number of works, and the number of work lumps per worker. In the example of FIG. 33, the number of work blocks is 4 (three consecutive Rs, one B, one C, three consecutive As), and the number of works is 9, including AUTO. Since there are four workers, the average is 1 for the work mass 4 ÷ four workers. The CPU 11 obtains a first value obtained by subtracting a division value obtained by dividing a value obtained by subtracting 1 from the number of work chunks by the number of work from 1 and a second value obtained by dividing 1 by an average. The second parameter is calculated by adding the value and multiplying the added value by a coefficient of 0.5. The coefficient 0.5 is an example, and the present invention is not limited to this. In the example of FIG. 33, the first value is 1− (work lump number 4-1) ÷ work number 9. The second value is 0.5 × 1 ÷ average 1.

  The CPU 11 calculates the total value of the worker's fatigue level at the start of work and a subtracted value obtained by subtracting 1 from the worker's fatigue level at the end of work for each work block. In the embodiment, since the degree of fatigue increases by 1 at the end of the work, the above-described subtraction value becomes 0. The CPU 11 calculates the fatigue level of the worker at the start of work on the work lump by the method shown in FIG. CPU11 calculates the total value of the fatigue degree of each work lump. The CPU 11 subtracts the value obtained by dividing the total value of the fatigue levels by the number of work blocks from 1, and obtains the third parameter. In the example of FIG. 33, the fatigue level at the start of each work block is 0, so the third parameter is 1-0 and becomes 1.

  The CPU 11 calculates a total value of the first parameter to the third parameter as an evaluation value. The CPU 11 selects candidate data having the maximum evaluation value of candidate data stored in the setting DB 156, the update DB 157, the second setting DB 158, the second update DB 159, the third setting DB 1510, and the third update DB 1511. The CPU 11 displays the selected candidate data on the display unit 14 or transmits it to another computer 2.

  34 and 35 are flowcharts showing the evaluation value calculation procedure. The CPU 11 reads the candidate data stored in the setting DB 156, the update DB 157, the second setting DB 158, the second update DB 159, the third setting DB 1510, and the third update DB 1511 (step S341). CPU11 reads the numerical formula of the 1st parameter-3rd parameter memorize | stored in the memory | storage part 15 (step S342). The CPU 11 calculates a division value obtained by dividing the end time by the average end time (step S343). The CPU 11 calculates the first parameter by subtracting the division value from 1 (step S344).

  The CPU 11 stores the calculated first parameter in the RAM 12 (step S345). The CPU 11 counts the number of work that the worker is continuous and the number of work that the worker is not continuous as the number of work blocks (step S346). The CPU 11 counts the number of work (step S347). The CPU 11 counts assigned workers (step S348). The CPU 11 calculates the average by dividing the number of work chunks by the number of workers (step S349). The CPU 11 divides the value obtained by subtracting 1 from the work lump number by the work number to calculate a division value (step S351).

  The CPU 11 calculates the first value by subtracting the division value from 1 (step S352). The CPU 11 calculates the second value by dividing 1 by the average (step S353). The CPU 11 calculates a second parameter by multiplying the value obtained by adding the first value and the second value by 0.5 (step S354). The CPU 11 stores the second parameter in the RAM 12 (step S355). The CPU 11 calculates the fatigue level at the start of each work block (step S356). CPU11 calculates the total value of the fatigue degree of each calculated work lump (step S357).

  The CPU 11 calculates a division value by dividing the total value by the number of work chunks (step S358). The CPU 11 calculates the third parameter by subtracting the division value from 1 (step S359). The CPU 11 calculates the total value of the first parameter, the second parameter, and the third parameter as an evaluation value (step S3510). The CPU 11 stores any DB name read in step S341 in association with the evaluation value in the RAM 12 (step S3511). The CPU 11 determines whether or not the processing for calculating the evaluation values for all the DBs read in step S341 has been completed (step S3512).

  If the CPU 11 determines that the process has not ended (NO in step S3512), the process proceeds to step S3513. The CPU 11 reads out candidate data of an unprocessed DB (step S3513). After that, the CPU 11 shifts the process to step S343. By repeating the above processing, the evaluation value of each DB is calculated. If the CPU 11 determines that the process has been completed for all the DBs (YES in step S3512), the process proceeds to step S3514.

  The CPU 11 extracts the DB having the maximum evaluation value from the RAM 12 (step S3514). The CPU 11 outputs the extracted DB candidate data to the display unit 14 (step S3515). Thereby, it is possible to assign appropriate workers with a small amount of calculation without calculating all combinations.

  The fifth embodiment is as described above, and the other parts are the same as those of the first to fourth embodiments. Therefore, the corresponding parts are denoted by the same reference numerals and detailed description thereof is omitted.

Embodiment 6
FIG. 36 is a functional block diagram showing the operation of the computer 1 having the above-described form. When the CPU 11 executes the control program 15P, the computer 1 operates as follows. The acquisition unit 361 acquires a flow including a plurality of operations. The extraction unit 362 refers to the storage unit 15 that stores workers capable of processing each work, and extracts candidate workers for each work. The calculation unit 363 calculates the fatigue level of the candidate worker based on the extracted work performed by the candidate worker and the time when the candidate worker is not working. The assigning unit 364 assigns work to the candidate worker when the calculated fatigue level is equal to or less than a threshold value.

  FIG. 37 is a block diagram illustrating a hardware group of the computer 1 according to the sixth embodiment. A program for operating the computer 1 is a portable recording device such as a CD-ROM, a DVD (Digital Versatile Disc) disk, a memory card, or a USB (Universal Serial Bus) memory in a reading unit 10A such as a disk drive or a memory card slot. The medium 1A may be read and stored in the storage unit 15. Further, a semiconductor memory 1B such as a flash memory storing the program may be mounted in the computer 1. Further, the program can be downloaded from another server computer (not shown) connected via a communication network N such as the Internet. The contents will be described below.

  The computer 1 shown in FIG. 37 reads a program for executing the above-described various software processes from the portable recording medium 1A or the semiconductor memory 1B or downloads it from another server computer (not shown) via the communication network N. To do. The program is installed as the control program 15P, loaded into the RAM 12, and executed. Thereby, it functions as the computer 1 described above.

  The sixth embodiment is as described above, and the other parts are the same as those of the first to fifth embodiments. Accordingly, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

  With respect to the embodiments including the above first to sixth embodiments, the following additional notes are further disclosed.

(Appendix 1)
On the computer,
Get a flow that contains multiple tasks,
Refer to the storage unit storing the workers capable of processing each work, extract candidate workers for each work,
Calculate the fatigue level of the candidate worker based on the work that the candidate worker extracted and the time when the candidate worker is not working,
A program for executing a process of assigning work to the candidate worker when the calculated fatigue level is equal to or less than a threshold value.
(Appendix 2)
The program according to claim 1, wherein the storage unit stores a processing time required for processing each work for each worker, and extracts candidate workers for each work based on the processing time.
(Appendix 3)
When assigning the same candidate worker to time-sequential work, refer to the storage unit to determine whether the processing time required for the continuous work exceeds a predetermined time,
The program according to claim 2, wherein when it is determined that the predetermined time is exceeded, another candidate worker different from the candidate worker is assigned.
(Appendix 4)
The program according to Supplementary Note 2 or 3, wherein the degree of fatigue is calculated based on a continuous work assigned to the candidate worker, a single non-continuous work, and a time during which no work has been performed since the work was completed.
(Appendix 5)
The program according to any one of appendices 2 to 4, wherein an average end time of each work is calculated based on an average processing time of processing times stored in the storage unit.
(Appendix 6)
When assigning the same candidate worker to time-sequential work, calculate the end time of the continuous work, determine whether the difference obtained by subtracting the average end time from the calculated end time is a predetermined time or more,
The program according to appendix 5, wherein when it is determined that the time is equal to or longer than the predetermined time, another candidate worker different from the candidate worker is assigned.
(Appendix 7)
After assigning workers for each work, if the workers of the previous and subsequent work are different in time series, the worker of the subsequent work processes the work of the previous work based on the extracted candidate workers of each work Determine whether it is possible,
The program according to any one of appendices 2 to 6, wherein when it is determined to be possible, the worker of the previous work is changed to the worker of the subsequent work.
(Appendix 8)
Extract workers who are determined that the calculated fatigue level exceeds the threshold,
The program according to any one of appendices 1 to 7, wherein when the worker is assigned a previous task in time series, the worker is changed to another candidate worker different from the worker.
(Appendix 9)
Extracting workers determined to be at least the predetermined time,
The program according to any one of appendices 6 to 8, wherein when the worker is assigned a previous work in time series, the worker is changed to another candidate worker different from the worker.
(Appendix 10)
After assigning workers for each work, calculate the evaluation value based on the processing time, the number of work, the number of times the same worker continues, and the fatigue level,
The program according to any one of appendices 7 to 9, wherein assignment of workers for each work is determined according to the calculated evaluation value.
(Appendix 11)
On the computer,
Get a flow that contains multiple tasks,
Refer to the storage unit storing the workers capable of processing each work, extract candidate workers for each work,
Calculate the fatigue level of the candidate worker based on the work that the candidate worker extracted and the time when the candidate worker is not working,
An information processing method for executing a process of allocating work to the candidate worker when the calculated fatigue level is equal to or less than a threshold value.
(Appendix 12)
An acquisition unit for acquiring a flow including a plurality of operations;
An extraction unit that extracts a candidate worker for each work with reference to a storage unit that stores workers capable of processing each work;
A calculation unit that calculates the fatigue level of the candidate worker based on the time that the extracted candidate worker processes and the time when the candidate worker is not working;
An information processing apparatus comprising: an assigning unit that assigns work to the candidate worker when the calculated fatigue level is equal to or less than a threshold value.

1, 2 Computer 1A Portable recording medium 1B Semiconductor memory 10A Reading unit 11 CPU
12 RAM
13 Input unit 14 Display unit 15 Storage unit 15P Control program 16 Communication unit 18 Clock unit 151 Flow DB
152 worker DB
153 Time required DB
154 Candidate DB
155 Schedule DB
156 Setting DB
157 Update DB
158 Second setting DB
159 Second update DB
1510 Third setting DB
1511 Third update DB
361 Acquisition Unit 362 Extraction Unit 363 Calculation Unit 364 Allocation Unit N Communication Network

Claims (6)

On the computer,
Get a flow that contains multiple tasks,
Refer to the storage unit storing the workers capable of processing each work, extract candidate workers for each work,
Calculate the fatigue level of the candidate worker based on the work that the candidate worker extracted and the time when the candidate worker is not working,
A program for executing a process of assigning work to the candidate worker when the calculated fatigue level is equal to or less than a threshold value. The program according to claim 1, wherein the storage unit stores a processing time required for processing each work for each worker, and extracts a candidate worker for each work based on the processing time. When assigning the same candidate worker to time-sequential work, refer to the storage unit to determine whether the processing time required for the continuous work exceeds a predetermined time,
The program according to claim 2, wherein when it is determined that the predetermined time is exceeded, another candidate worker different from the candidate worker is assigned. The program according to claim 2 or 3, wherein the degree of fatigue is calculated based on a continuous work assigned to the candidate worker, a single non-continuous work, and a time during which no work has been performed since the end of the work. On the computer,
Get a flow that contains multiple tasks,
Refer to the storage unit storing the workers capable of processing each work, extract candidate workers for each work,
Calculate the fatigue level of the candidate worker based on the work that the candidate worker extracted and the time when the candidate worker is not working,
An information processing method for executing a process of allocating work to the candidate worker when the calculated fatigue level is equal to or less than a threshold value. An acquisition unit for acquiring a flow including a plurality of operations;
An extraction unit that extracts a candidate worker for each work with reference to a storage unit that stores workers capable of processing each work;
A calculation unit that calculates the fatigue level of the candidate worker based on the time that the extracted candidate worker processes and the time when the candidate worker is not working;
An information processing apparatus comprising: an assigning unit that assigns work to the candidate worker when the calculated fatigue level is equal to or less than a threshold value.

Images