JP2014203359A - Process control system, method, and program - Google Patents

Abstract

The present invention provides a process management technique that supports the planning of the shortest process that is feasible while considering resource constraints. In a process management system, a task information DB for registering task information and a constraint defining a context between each task, and resource information for registering resource information necessary for performing this task DB 13, process information management unit 14 for acquiring and linking the task and resource information, task extraction processing unit 16 for extracting a set of tasks linked to the same resource for each resource, A task permutation deriving unit 17 for deriving permutations of tasks constituting the set for each set, a constraint collating unit 18 for collating the constraints against the permutations of the tasks and extracting matching permutations, and a pre-process Tasks for which constraints are defined starting from a task for which no constraints are defined for It was ligated in the order, and further comprising a task sequence forming unit 19 for forming a time series of tasks corresponding to said matched permutation. [Selection] Figure 1

Description

  The present invention relates to a process management technique that supports planning of work processes.

Creation of work processes such as periodic inspections in a nuclear power plant follows the following process. (1) Definition of task period, which is the minimum unit of work, (2) Definition of context between tasks, (3) Extraction of critical process, (4) Examination of processes in the order of resource collapse, (5) Check the validity of the entire process.
Furthermore, when a change occurs during the execution of the work process, re-planning and readjustment of the shortest process that can be solved is performed.

Against this background, when carrying out maintenance work for nuclear power plants, etc., a maintenance work plan is made in advance, and the progress of the maintenance work is recorded and managed during the work period, so that each work is performed without delay. There is a need to.
Such process management of maintenance work has been conventionally planned using a computer system.

  The process management system generally used includes a task period, task information linked to the task (for example, task name, resource name, resource usage), and constraints indicating the context between these tasks, etc. Input to the Gantt chart on the screen using an input device such as a keyboard or pointing device to create a process.

  In the conventional process management technology, when resource constraints are not considered, the required time of tasks and the context between tasks are expressed in an arrow diagram, and the critical path is derived by calculating PERT (Program Evaluation and Review Technique). An algorithm was used to calculate the total time required.

When considering resource constraints, a feasible process can be obtained by adjusting (climbing) resources.
Here, the resource restriction means that simultaneous execution of tasks becomes impossible or limited due to the quantitative limitation of available resources.

The following process management technology in the product manufacturing field is known as a prior art (see, for example, Patent Document 1).
First, an arbitrary resource number process in which work is executed with a predetermined number of resources between the minimum required resource and the maximum required resource is extracted.
Here, the arbitrary resource number step refers to a step in which the number of resources such as workers can be arbitrarily determined among the work steps of the product manufacturing flow.
In this arbitrary resource number step, the required number of resources is leveled per unit time, and the optimum number of resources is calculated.

JP 2006-106829 A

In recent nuclear power plants, there is a demand for optimization of the quantity of maintenance materials, efficiency of maintenance work, and optimization (shortening) of periodic inspection processes in order to achieve a high utilization factor of equipment.
For this reason, in the process management technology, it is important that tasks and resources to be used are formulated with high accuracy in the preliminary planning before starting the periodic inspection.

In particular, when planning a critical process, in order to shorten the periodic inspection, it is required that this process satisfies the resource constraints and can be realized and is the shortest process.
In addition, when trouble occurs during the work, it is required to quickly re-plan the shortest process in order to minimize the influence.

However, since the prior art only derives a process that can be realized by resource collapse after PERT calculation, there is a problem that the derived result is not guaranteed to be the shortest process.
In order to derive the shortest process in the prior art, it is necessary to extract all possible feasible processes using a human system and find the pattern of the shortest process.

  The present invention has been made in consideration of such circumstances, and an object of the present invention is to provide a process management technique that can be realized and can support the planning of the shortest process while considering resource constraints.

  In the process management system, a task information DB for registering task information and constraints defining the context between each task, a resource information DB for registering resource information necessary for performing the task, and the task And a process information management unit that acquires and links the resource information, a task extraction processing unit that extracts the set of tasks linked to the same resource for each resource, and the set A task permutation deriving unit for deriving permutations of tasks to be performed for each set, a constraint collating unit for matching the constraints against the task permutations and extracting the matched permutations, Starting with a task for which no constraint is defined, the tasks for which the constraint is defined are ordered. Linked to, further comprising, a task sequence forming unit for forming a time series of tasks corresponding to said matched permutation.

  According to the present invention, a process management technique is provided that supports the planning of the shortest process that can be realized while considering resource constraints.

1 is a block diagram showing an embodiment of a process management system according to the present invention. The Gantt chart showing the work process which the process management system concerning a 1st embodiment plans. Functional explanatory drawing of a task extraction process part. Functional explanatory drawing of a task permutation deriving unit. Functional explanatory drawing of a constraint collation part. Functional explanatory drawing of a constraint collation part. Functional explanatory drawing of a task arrangement | sequence formation part. The table | surface which shows the constraint of the task defined in the process management system which concerns on 2nd Embodiment, and the linked resource. The Gantt chart showing the work process which the process management system concerning a 2nd embodiment plans. The time series pattern of the task for creating the work process in 1st Embodiment. The time series pattern of the task for creating the work process in 2nd Embodiment. The flowchart explaining operation | movement of the process management system which concerns on each embodiment. The flowchart explaining the subroutine of the process management system which concerns on 2nd Embodiment.

(First embodiment)
Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings.
As shown in FIG. 1, the process management system 10 includes a process information DB 11 that stores process information, a task information DB 12 that registers task information and constraints defining the context between each task, and the task information DB 12. A resource information DB 13 for registering resource information necessary for the implementation of the process, a process information management unit 14 for acquiring and linking the task and resource information, and a set of tasks linked to the same resource. A task extraction processing unit 16 for extracting each resource, a task permutation deriving unit 17 for deriving permutations of tasks constituting the set for each set, and matching and matching the constraints against the permutations of the tasks Constraint matching unit 18 that extracts the permutation that has been performed, and a task for which no constraint is defined in the previous process The tasks as a starting point is defined for the constraint linked sequentially, further comprising a, a task sequence forming unit 19 for forming a time series of tasks corresponding to said matched permutation.

By configuring the process management system 10 in this way, it is possible to plan work processes that can be realized while considering resource constraints.
In addition, the limitation of task arrangement due to resource constraints can be added by automatic calculation based on defined constraints without relying on human systems.

Further, the process management system 10 is linked to the required time analysis unit 20 that analyzes the required time of the process in which the tasks are arranged in time series and selects the process that indicates the shortest time, and the process that indicates the shortest time. And a process information processing unit 15 for displaying information of resources and tasks on the Gantt chart.
The process management system 10 includes a display unit (not shown) for displaying search results, processing results, evaluation results, and analysis results in each functional unit described above, and an input unit (not shown) for inputting various information to a DB or the like. Abbreviation) is provided.
Note that DB in the description means a database.

By configuring the process management system 10 in this way, it is possible to plan a work process with the shortest period.
Furthermore, by using the Gantt chart, it becomes possible to create a recovery process in a short time even if the initial plan is forced to change due to the occurrence of a trouble or the like.

Process information DB11 inputs process information, such as a periodic inspection of a plant, and registers these so that search is possible.
Here, the processes are managed hierarchically for each item, such as plant, unit, system, equipment, consignment name, and work content.
Examples of the process information include process start date / time, end date / time, holiday, work prohibition date, position information, number of periodic inspections, company department information of a construction contractor, and the like.
Here, the position information refers to a place where work is carried out, such as a plant type or a unit.

The task information DB 12 inputs task information and constraints defining the context between each task, and these are registered so as to be freely searchable.
Here, the task indicates a minimum unit of work, and one work process is created by connecting a plurality of tasks in series or in parallel and arranging them in time series.
The task information includes an identification number of each task, an execution period, and attribute information (name, responsible company, responsible department, responsible person, target system, target device, target consignment name, work area, etc.).

  Furthermore, resource information and usage amount linked in the process information management unit 14 can be included as task information, and further updated by the process information processing unit 15 and initial values of the start date and end date of the task period. These updated values can also be included.

A constraint associates (restrains) a target task with another task and defines the context between the tasks. In each embodiment, the constraint is linked immediately before the target task. A task is defined (see FIG. 3).
By connecting the tasks (tasks 2 to 6) in which the constraints are defined in order, starting from the task (task 1) in which the constraints are not defined in the previous process among the plurality of tasks, These multiple tasks are connected in series or in parallel.

The resource information DB 13 inputs resource information necessary for performing this task, and these are registered so as to be searchable.
Here, the resource is an article or a human resource applied to the corresponding task.
The resource information includes an identification number of each resource, attribute information (name, use, holding qualification), and supplyable amount.
As a resource, when a human resource is identified by an individual, the supplyable amount is 1, and when it is identified by an article or possession qualification (for example, a welding engineer, non-destructive testing engineer, etc.), the supplyable amount has a value of 1 or more. I can take it.

The process information management unit 14 acquires task and resource information from the task information DB 12 and the resource information DB 13 and links them to each other.
In addition to the case where the operator performs information such as task and resource names as keys, this linking is performed automatically when the common information included in both task information and resource information is performed using the keys. In some cases, it is automatically performed based on information.

The process information processing unit 15 displays resource and task information linked to each other in the process information management unit 14 on the Gantt chart (FIG. 2).
Further, the process information processing unit 15 displays the Gantt chart (FIG. 2) reflecting the process information registered in the process information DB 11 (for example, the start date / time, end date / time, work prohibition date, etc. of all processes).

Furthermore, the process information processing unit 15 performs task information (name, execution period, start date, end date, etc.), resource information (name, supplyable amount), process information (all processes) on the Gantt chart (FIG. 2). The start date / time, end date / time, work prohibition date, etc.) can be edited.
Then, in synchronization with the edited task information and resource information, the registration information of the process information DB 11, the task information DB 12, and the resource information DB 13 is updated.
Such an editing operation is performed by an operator using the display unit (not shown) and the input unit (not shown).

The Gantt chart shown in FIG. 2 employs the initial values registered in the task information DB 12 as the task start date and end date, and sets the suppliable amount of all resources to 1.
It is assumed that resource A is linked to tasks 2, 3, and 4, resource B is linked to tasks 2, 3, and 5, and resource C is linked to tasks 2 and 5.

In this Gantt chart, the time series of task 2 and task 4 are overloaded on the 10th (Wednesday) of resource A, and the time series of Task 3 and Task 5 are overloaded on the 14th (Sunday) of Resource B. .
For this reason, during a period in which overload occurs, a plurality of tasks cannot be performed simultaneously due to resource constraints, so the task execution timing needs to be shifted.
As described above, when the task execution timing is shifted, it is necessary to derive a feasible and shortest process.

  As shown in FIG. 3, the task extraction processing unit 16 extracts a set of tasks linked with the same resource for each resource.

As shown in FIG. 4, the task permutation deriving unit 17 derives all permutations of the tasks to be configured for each set of tasks extracted for each resource.
For example, a plurality of tasks linked to resources whose supplyable amount is 1, such as a specific worker, cannot be performed simultaneously.
As described above, for a plurality of tasks that need to have a context in time series, a permutation indicating this context is derived in advance, and the optimal process is found by shifting the task execution timing. To help.

The constraint collation unit 18 collates a defined constraint (see FIG. 3) against the task permutation extracted by the task permutation deriving unit 17 and extracts a suitable permutation.
As shown in FIG. 5, there are six permutations of tasks 2, 3, and 4 linked to resource A (1) to (6). Of these, (3), (4), (6 ) Contradicts the constraint that task 2 defined before task 3.

Therefore, as shown in FIG. 6, among the permutations of tasks linked to resource A, the permutations extracted from the constraint matching unit 18 are (1), (2), and (5). .
Similarly, the constraint matching unit 18 also extracts a permutation that matches the constraint for a set of tasks linked to the resource B and the resource C.

  The task array forming unit 19 sequentially connects the tasks with the defined constraints starting from the task with no defined constraint, and further, the task corresponding to the permutation adapted by the constraint matching unit 18 The time series is formed.

More specifically, based on the constraints defined as shown in FIG. 3, task 1 is the starting point, task 1 → task 2 → task 3 → task 6 are connected in series, task 1 → task 4 → Task 5 → task 6 are connected in series, and task 2 → task 3 and task 4 → task 5 are connected in parallel.
The time series of tasks connected in parallel is formed so as to be a permutation (marked with a circle in FIG. 5) suitable for the constraint as shown in FIG.

Based on FIG. 7, an example of processing in which the task array forming unit 19 forms a time series of tasks that can be realized under the constraints of the resource A, the resource B, and the resource C will be described.
The permutation of tasks linked to resource A is changed from (1) to (6), and it is detected whether or not there is a contradiction with the constraint.
Next, the permutations (1) ′ to (6) of the tasks linked to the resource B with respect to the permutations (1), (2), (5) having no contradiction among the permutations (1) to (6). Include 'in chronological order to detect whether there is any contradiction to the constraint.

Further, subsequently, the permutations (1) "to (2)" of the tasks linked to the resource C are incorporated in time series to detect whether or not there is a contradiction with the constraint.
In this way, the plurality of steps formed by connecting the tasks 1 to 6 include all the time-series patterns having no contradiction to the constraint.

The required time analysis unit 20 analyzes the required time of a plurality of processes formed by the task array forming unit 19 and selects a process showing the shortest time among them. In addition, when it is necessary to simultaneously input a plurality of different resources for a certain task, the task permutation of one resource and the task permutation of other resources among the task permutations that do not contradict the above-described constraints. The required time shall be analyzed for matching combinations.
Then, the process selected by the required time analysis unit 20 is sent to the process information processing unit 15 and displayed on the Gantt chart.

The operation of the first embodiment will be described based on the flowchart of FIG.
Information of each task (identification number, execution period, initial value of start date and end date, attribute information, etc.) and constraints of each task are registered in the task information DB 12 (S11, S12).
Then, information (identification number, attribute information, suppliable amount) of each resource is registered in the resource information DB 13 (S13).
The task and the resource are linked to each other, and a Gantt chart is created based on the initial value of the task information (S14). If no resource overload occurs (No in S15), the process is terminated (S16).

If resource overload occurs (S15 Yes), a set of tasks Ti _k {Ti ₁ ... Ti _Ni } linked to each of the resources i (1, 2,... M) is extracted (S17, S18).
Here, M indicates the total number of registered resources i, and Ni indicates the total number of tasks linked to the resource i.

Next, the permutations Qij {Qi ₁ ,..., Qi _Pi } of the respective tasks constituting the obtained set Ti _k {Ti ₁ ... Ti _Ni } are all resources i (= 1, 2,... M ) And a permutation suitable for the constraint is extracted (S19 to S22). Here, Pi indicates the total number of permutations of tasks linked to resource i.

Next, tasks with defined constraints (tasks 2, 3, 4...) Are sequentially linked starting from a task with no defined constraints (task 1) (S23). Further, a time series of tasks corresponding to the adapted permutation is formed (S24 to S27).
The time series time thus formed is analyzed to select a process showing the shortest time (S28) and displayed on the Gantt chart (S29).

(Second Embodiment)
Next, a second embodiment of the present invention will be described.
In the second embodiment, when there are a plurality of resources that can be supplied, the resources are redistributed and the common link task is simultaneously performed. The process management system according to the second embodiment is realized by the configuration shown in FIG.
In the second embodiment, the description of the same configuration or function as in the first embodiment is omitted.

Here, the process information management unit 14 further acquires information on the suppliable amount of the resource registered in the resource information DB 13 and information on the usage amount of the resource linked to each task.
The task array forming unit 19 allows overloading in time series even when the same resource is linked to the task if the total amount of use is equal to or less than the supplyable amount.
The process information management unit 14 can display information on the Gantt chart that a task whose usage exceeds the supplyable amount cannot be performed simultaneously in advance.

FIG. 8 shows task constraints and linked resources defined in the second embodiment.
In the table of FIG. 8, the supplyable amount of each resource and the usage amount in the linked task are appended.
FIG. 9 is a Gantt chart created based on the initial values (not shown) of the constraint and task information.
According to the Gantt chart of FIG. 9, overload occurs for resources A, B, and C in tasks 2, 3, and 4.

First, a permutation of tasks 2, 3, and 4 linked to resource A is derived, and a time series suitable for the constraint is formed as shown in FIG. 10 (the processing up to this point is the first embodiment). Is not different).
Of the formed time series, the tasks that are not defined in the context and are continuous can form a pattern of simultaneous execution as shown in FIG.

In the pattern shown in FIG. 11, the time series including the simultaneous execution tasks (tasks 3 and 4) in which the total amount of the resource usage does not exceed the suppliable amount (enclosed by a broken line) is allowed to be overloaded. Extracted as a time series.
Here, when the tasks 3 and 4 are performed simultaneously, the resource A becomes the usage amount 4 (= 3 + 1) out of the suppliable amount 5, the resource B becomes the usage amount 5 out of the suppliable amount 10, and the resource C becomes Of the suppliable amount 3, the amount is 3 (= 2 + 1).

  Of the patterns shown in FIG. 11, the time series including the simultaneous execution tasks (tasks 2 and 3 or tasks 2 and 4) in which the total amount of resource usage exceeds the suppliable amount displays the shortage of resources. May be.

If the resource shortage can be resolved by extending the task period, the required time of the process in the required time analysis unit 20 is analyzed after adjusting the period.
As a result, tasks linked to the same resource can be performed simultaneously within the limits of the constraints, the optimum process that is feasible and shortest can be derived, and the accuracy of process pre-planning can be improved, and the process planning work can be saved. Achieved.

The operation of the second embodiment will be described based on the flowcharts of FIGS.
Since the task time series (see FIG. 10) formation flow (S11 to S27 in FIG. 12) in the second embodiment is the same as in the case of the first embodiment, redundant description is omitted.
In the second embodiment, after the time series of such tasks is formed, the process proceeds to a resource redistribution flow (S30).
In this resource redistribution flow, as shown in FIG. 13, a simultaneous execution pattern is created for tasks linked to the same resource (S31; refer to FIG. 11 as appropriate).

Then, the supplyable amount of each resource is acquired (S32), and further, the usage amount of the resource linked to the task to be performed simultaneously is acquired (S33).
Then, for a pattern in which the total amount of resources used is the same as or less than the supplyable amount (S34), the shortest process option is selected (FIG. 12, S28), and overload display in the Gantt chart is allowed (S29). .

  According to the process management system of at least one embodiment described above, the permutation of tasks linked to resources is reflected in the time series of processes, so that the shortest process can be realized while considering resource constraints. It is possible to provide support.

Although several embodiments of the present invention have been described, these embodiments are presented by way of example and are not intended to limit the scope of the invention. These embodiments can be implemented in various other forms, and various omissions, replacements, changes, and combinations can be made without departing from the scope of the invention. These embodiments and their modifications are included in the scope and gist of the invention, and are also included in the invention described in the claims and the equivalents thereof.
Further, the components of the process management system can be realized by a processor of a computer and can be operated by a process management program.

  DESCRIPTION OF SYMBOLS 10 ... Process management system, 11 ... Process information DB, 12 ... Task information DB, 13 ... Resource information DB, 14 ... Process information management part, 15 ... Process information processing part, 16 ... Task extraction process part, 17 ... Derivation of task permutation , 18 ... Constraint comparison part, 19 ... Task arrangement formation part, 20 ... Time required analysis part.

Claims (5)

A task information DB for registering task information and constraints defining the context between each task;
A resource information DB for registering resource information necessary for performing the task;
A process information management unit for acquiring and linking each of the task and the resource information;
A task extraction processing unit that extracts the set of tasks linked to the same resource for each resource;
A task permutation derivation unit for deriving permutations of tasks constituting the set for each set;
A constraint matching unit for matching the constraint against the permutation of the task and extracting the matched permutation;
A task array that sequentially connects the tasks in which the constraint is defined starting from a task in which the constraint is not defined in the previous process, and further forms a time series of tasks corresponding to the adapted permutation And a forming unit. In the process management system according to claim 1,
A time analysis unit for analyzing a time required for the process in which the tasks are arranged in the time series and selecting a process showing the shortest time;
The process management system further comprising: a process information processing unit that displays information of the resource and task linked to each other on the Gantt chart for the process indicating the shortest time. In the process management system according to claim 1 or claim 2,
The resource information DB further registers the suppliable amount of the resource as the information,
The process information management unit further acquires the usage amount of the resource linked to the task,
The task array forming unit may allow overloading in the time series even when the same resource is linked to the task if the total amount of use is equal to or less than the supplyable amount. A characteristic process management system. Registering task information and constraints defining the context between each task;
Registering information of resources necessary for performing the task;
Obtaining and linking each of the task and resource information; and
Extracting the set of tasks linked to the same resource for each resource;
Deriving permutations of tasks constituting the set for each set;
Matching the constraints against the permutation of the task to extract the matched permutation;
Connecting the tasks in which the constraints are defined in order starting from a task in which the constraints are not defined in the previous process;
Forming a time series of tasks corresponding to the adapted permutation. On the computer,
Registering task information and constraints defining the context between each task;
Registering information of resources necessary for performing the task;
Obtaining and linking each of the task and resource information; and
Extracting the set of tasks linked to the same resource for each resource;
Deriving permutations of tasks constituting the set for each set;
Collating the constraints against the permutation of the task and extracting the matched permutation;
Connecting tasks in which the constraints are defined in order starting from a task in which the constraints are not defined in the previous process;
A step of forming a time series of tasks corresponding to the adapted permutation.

Images