JP2009184028A - Process planning support device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a process planning support device, with which the optimal process flow design solution is designed in a short period of time. <P>SOLUTION: The process planning support device is provided with: a process grouping section 104; a process group flow generation section 105; and a process flow generation section 106. The process grouping section 104 executes grouping processing for a plurality of processes s10 so as to attribute high relevancy ranked processes s10 to a given group, based on a relevance degree 40 which shows the relevancy rank among the processes s10. The process group flow generation section 105 generates a process group flow in which each group generated as a result of the grouping processing is sequenced, based on design information. The process flow generation section 106 sequences each process s10 attributed to the group, based on the design information. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a process design support apparatus capable of designing a process sequence of a predetermined process.

  A conventional process design support apparatus has a knowledge base. Then, attribute data such as work, work priority, tact time of each work, constraint conditions, additional time required for tool change, and the like are input to the apparatus. As a result, the process design support apparatus sets priorities based on the input attribute data and knowledge base information, and determines the execution order of processes based on the priorities (for example, Patent Document 1).

  In the process design support apparatus according to Patent Document 1, when generating a process flow solution that is optimal when a plurality of given processes are arranged in a row, the process is sequentially performed from the previous process to the subsequent process. Determine process candidates. At that time, if there are a plurality of process candidates that satisfy the preceding constraints, the candidates are narrowed down to only one based on the condition given in the knowledge base and the weight value defined for each process.

JP-A-5-181873

  However, since the process design support apparatus according to Patent Document 1 determines the processes one by one from the previous process to the subsequent process, the design solution candidates are deleted from the initial stage. Therefore, the optimal final design solution is not always generated. For example, even if the design process is not very good as the first process, the process is assumed to be the first process. This can shorten the tact time by parallelizing the subsequent processes, and may provide a good design solution as a whole.

  Moreover, in the process design support apparatus according to Patent Document 1, only one resource (equipment such as a robot, a processing machine, and other dedicated machines, tools such as a hand and a drill, a jig, a work table, etc.) is used in each process. And multiple resources cannot be defined. In addition, since the number of resources that can be used as a whole is not managed, only processes that are sequentially arranged in a line can be generated. Therefore, in the process design support device, the process flow cannot be determined when the process includes a cooperative operation by a plurality of facilities or when a plurality of processes are executed in parallel.

  Therefore, an object of the present invention is to provide a process design support apparatus that can design a more optimal process flow design solution in a short time. Furthermore, it is an object of the present invention to provide a process design support device that can automatically design a good design solution even when a process includes a coordinated operation by a plurality of facilities or when a plurality of processes are executed in parallel. .

  In order to achieve the above object, the process design support apparatus according to claim 1 according to the present invention is a process of determining a process flow indicating an execution order of processing steps obtained by arranging a plurality of process blocks. In the design support apparatus, a process grouping unit that performs a grouping process for causing the process blocks to belong to a predetermined group based on a degree of association indicating a high degree of relation between the process blocks. And generating a process group flow in which the groups generated as a result of the grouping process are arranged in series or in parallel based on design information that is a design condition defined for each of the process blocks. Based on the group flow generation unit and the design information, the process blocks belonging to the group are serially or in parallel. A bell process flow generator includes.

  The process design support apparatus according to claim 1 of the present invention performs grouping processing for assigning a process block to a predetermined group based on a degree of association indicating a high degree of relation between process blocks to a plurality of process blocks. A process group flow in which the groups generated as a result of the grouping process are arranged in series or in parallel based on the process grouping unit to be executed and design information which is a design condition defined for each process block. And a process flow generation unit that arranges the process blocks belonging to the group in series or in parallel based on the design information.

  Therefore, a more optimal process flow design solution can be designed in a shorter time. In addition, a solution (process flow) can be generated so that related process blocks are easily continuous. In addition, the process design processing time can be greatly shortened, and a good process design solution can be generated efficiently (in a shorter time). In addition, a good design solution can be designed even when a process includes a cooperative operation by a plurality of facilities, or even when a plurality of processes are executed in parallel.

  Hereinafter, the present invention will be specifically described with reference to the drawings showing embodiments thereof.

<Embodiment 1>
<Parts-process information>
FIG. 1 is a diagram showing information representing the relationship between the process s10 and the component p11, which is handled in the process design support apparatus according to the first embodiment of the present invention. In the present invention, it can be grasped that process s10 is a process block which constitutes a process flow.

  By connecting from the step s10 to the part p11 by an arrow, information representing the relationship between the process and the part handled in the process is configured. With this information, it is possible to specify a part to be handled in a certain process. When a certain process is a process of combining a part with another part, for example, as shown in FIG. 1, it can be expressed as a relation between the process 1, the part a, and the part b.

<Process information>
FIG. 2 is a diagram showing the contents of the process information 20 representing details of the process s10.

  In the process s10, in addition to the process name, a work type, a component configuration, a process standard time, a work accuracy, a work direction, and a resource requirement specification can be defined.

  The work type is the type of work in step s10. For example, in the assembly process, there are work types such as conveyance, assembly, fitting, screw tightening, gripping, hand exchange, etc. In the process for machining, cutting, chamfering, drilling, roughing, chamfering, tapping There are work types such as finishing.

  The component configuration is a component configuration handled in step s10. For example, in the case of the step s10 of fastening the M2 screw to the cover, the step s10 called screw fastening is composed of a part called M2 screw and a part called cover. Further, in the case of the step s10 for making a hole in the cover, the step s10 for making a hole is composed of a part called a cover.

  The process standard time is a time estimated to be required to perform the work in the process s10. The unit of time may be, for example, seconds, or any other unit as long as it is a unit of time.

  The work accuracy is the accuracy required for work in step s10. For example, the positional accuracy (within 5 mm or the like) in the case of the step s10 for gripping a part by a robot, or the tolerance (within 2 mm or the like) in the case of the step s10 for performing a drilling process. The work accuracy is represented by expressions such as within 5 mm and within 2 mm, along with the types of accuracy such as position accuracy and tolerance. If the type of accuracy is not required, it may be omitted.

  The work direction is the work direction when work is performed in step s10. For example, it is the assembling direction in the case of the step s10 for assembling parts by a robot. For example, the work direction may be represented by a vector direction in an orthogonal coordinate system, or may be any other information indicating the direction.

  The resource requirement specification is the type and number of resources (equipment such as robots, processing machines, other dedicated machines, tools such as hands and drills, jigs, work tables, etc.) required for the work in the process s10. It is a variety of information that can be used to identify resources required for work. For example, in the case of the step s10 in which a plurality of robots are used to support parts while being fitted, the resource requirement specification is that one supporting robot and one fitting robot are required.

  In the example of FIG. 2, the information described above is defined as the process information 20, but besides that, the maximum time (work time requirement specification) that can be spent in performing the work in the process s 10, Detailed requirement specifications (portable size, loadable weight, gripping force, conveyance speed, screw diameter, screw length, tightening torque, pressure input, etc.) of resources (equipment) that handle parts to be assembled and processed in step s10 Information useful for process design may be defined and used for process design processing.

  By referring to the process information 20 described above, conditions necessary for realizing the process can be recognized.

<Process precedence constraint graph>
FIG. 3 is a diagram showing a process precedence constraint graph representing the order constraint of the process s10.

  By connecting each step s10 with the step precedence constraint relationship 30, an order constraint between the steps s10 is expressed. This indicates that it is necessary to execute the processes in the order from the original process s10 indicated by the arrow of the process precedence constraint 30 to the process s10 indicated by the arrow. For example, in the case of FIG. 3, step 2, step 3 and step 4 need to be executed after step 1. Step 7 and step 9 need to be executed after step 2, step 3 and step 6.

  Further, the degree of association 40 between the steps s10 connected by the step precedence constraint relationship 30 can be defined in the step precedence constraint relationship 30.

<Process precedence constraint graph with relevance>
FIG. 4 is a diagram showing a process precedence constraint graph with a degree of association in which the degree of association 40 is added to the process precedence constraint relationship 30 of the process precedence constraint graph.

  The degree of relevance 40 is a numerical value indicating the degree of relevance between the processes s10 connected by the process advance restriction relation 30. For example, a larger value represents higher relevance. By referring to the degree of relevance 40 of the process leading constraint relation 30, it is possible to recognize the high degree of relation between the processes s10 connected by the process leading constraint relation 30.

<Process group precedence restriction (process grouping)>
FIG. 5 is a diagram showing a process group precedence constraint graph representing the order constraints of the process group 50.

  The process group 50 is a unit that handles the highly related processes s10 as one group based on the degree of association 40 between the processes s10. As shown in FIG. 5, the process group 50 includes a single or a plurality of processes s10 and is handled as one group. By connecting each process group 50 by the process group preceding constraint relation 51, the order constraint between the process groups 50 is expressed. This indicates that it is necessary to execute the process group 50 in the order from the original process group indicated by the arrow of the process group precedence constraint 51 to the process group indicated by the arrow.

  For example, in the case of FIG. 5, the process group 2, the process group 3, and the process group 4 need to be executed after the process group 1. The process group 5 needs to be executed after the process group 2, the process group 3, and the process group 4. Further, in the process group preceding constraint relationship 51, the group relevance level 52 between the process groups 50 connected by the process group preceding constraint relationship 51 can be defined similarly to the relevance level 40 between the processes s10.

<Process group information>
FIG. 6 is a diagram showing the contents of the process group information 60 representing the details of the process group 50.

  In the process group information 60, in addition to the process group name, process information within the process group, process group standard time, and process group resource requirement specification can be defined.

  The process group internal process information is information on the process s10 included in the process group 50. All process information 20 included in the process group 50 can be defined. In addition, the process group intra-process information includes information on the process leading constraint relationship 30 between the processes s10 included in the process group 50.

  The process group standard time is an estimated time required to execute the operation (single or plural processes s10) in the process group 50.

  The process group resource requirement specification is a specification of resources required for work (single or plural processes s10) in the process group 50. Define the type of resource required and the maximum number required.

  In the example of FIG. 6, the information described above is defined as the process group information 60. However, if there is any other information useful for process design, it may be defined and used for the process design process. Good.

  By referring to the process group information 60 described above, conditions necessary for realizing the process group 50 can be recognized.

<Process group flow (reordering process groups)>
FIG. 7 is a diagram showing a flow of the process group 50 (process group flow).

  A process group flow is generated by rearranging the process groups 50 so as to satisfy design conditions (conditions defined by design information) such as given order constraints and the number of available resources (based on design information). . Here, the design information is a design condition required for each process block defined for each process block. By connecting each process group 50 with the process group execution order relation 70, the execution order between the process groups 50 is represented. The process group 50 is executed in the order from the original process group 50 indicated by the arrow in the process group execution order relation 70 to the process group 50 indicated by the arrow.

  For example, in the case of FIG. 7, after the process group 1, the process group 2 and the process group 4 are executed. After process group 2, process group 3 is executed. In addition, after the process group 3 and the process group 4, the process group 5 is executed.

<Example of process flow 1 (expansion of process group)>
FIG. 8 is a diagram illustrating an example of a flow (step flow) of step s10.

  The process flow is generated by rearranging the process s10 so as to satisfy the design conditions such as the given order restrictions and the number of available resources (based on the design information). By connecting each process s10 with the process execution order relation 80, the execution order between the processes s10 is represented. The process execution order relation 80 represents that the processes are executed in the order from the original process s10 indicated by the arrow to the process s10 indicated by the arrow.

  For example, in the case of FIG. 8, Step 2 and Step 4 are executed after Step 1. After step 2, step 3 is performed. After step 4, step 5 is performed. After step 5, step 6 is performed. Further, after step 3 and step 6, step 7 and step 9 are executed. After step 7, step 8 is performed. After step 9, step 10 is performed. Furthermore, the process 11 is performed after the process 8 and the process 10.

<Example 2 of process flow (expansion of process group)>
FIG. 9 shows an example of a process flow generated when a process precedence constraint graph is input when the process flow shown in FIG. 8 is generated and different conditions are input as the number of usable resources. FIG.

  When the design conditions such as the number of usable resources are different, there is a possibility that a process flow different from the process flow shown in FIG. For example, when there is not a sufficient number of resources necessary for the work after the process 3 and the process 6 to be able to work in parallel, there is a possibility that such a process flow is obtained. In other words, the steps s10 can be arranged in parallel within the range of available resources. Note that, in addition to conditions such as the number of resources that can be used and the like, when the order restriction of the step s10 is different, the generated process flow may be different.

<Configuration of process design support device>
FIG. 10 is a diagram showing an example of the configuration of the process design support apparatus according to Embodiment 1 of the present invention.

  The process design support device processes the data handled by the process design support device and generates a process flow as a final output, and the data input / output for inputting / outputting data handled by the process design support device. Part 102.

  The data input / output unit 102 inputs and outputs various data of the design information 101 necessary for process design.

  The process design processing unit 100 includes a design information storage unit 101, a process related definition unit 103, a process grouping unit 104, a process group flow generation unit 105, and a process flow generation unit 106.

  The design information storage unit 101 stores design information which is data such as process information 20 and constraint information handled by the process design support apparatus. Here, the design information includes, for example, constraint information such as process information 20, a process precedence constraint graph, the number of usable resources, and a tact time.

  In the process relation definition unit 103, the degree of relevance 40 is defined in the process precedence constraint relation 30 that connects the processes s10.

  The process grouping unit 104 groups the process s10 in the process precedence constraint graph into the process group 50 based on the design information stored in the design information storage unit 101, and generates a process group precedence constraint graph.

  The process group flow generation unit 105 generates an executable process group flow from the process group precedence constraint graph and design conditions such as available resources. That is, the process group flow generation unit 105 arranges the process groups 50 based on the design information stored in the design information storage unit 101.

  The process flow generator 106 generates an executable process flow from the process group flow and design conditions such as available resources. That is, the process flow generation unit 106 arranges the processes s10 for each process group 50 based on the design information stored in the design information storage unit 101.

  A process flow for performing process design by the process design support apparatus having the configuration shown in FIG. 10 will be described below with reference to FIG.

<Hardware configuration>
FIG. 11 is a hardware configuration diagram of the process design support apparatus according to the first embodiment.

  The hardware is a computer such as a personal computer or an electronic device such as a portable terminal. As illustrated in FIG. 11, the hardware includes an input unit 220, a storage unit 221, a processing unit 222, and a display unit 223.

  The input unit 220 is a keyboard, numeric keys, cursor keys, mouse, joystick, or the like, and information such as setting information is input by operating the input unit from the outside. The storage unit 221 stores the information. The processing unit 222 performs arithmetic processing based on information stored in the storage unit 221. The processing unit 222 may be configured to exchange information with the outside using a communication unit that communicates with the outside through a transmission line, a network, or wireless communication. The display unit 223 displays the calculation processing result in the processing unit 222 on the liquid crystal display or CRT as display information such as characters and images.

  In the comparison between FIG. 10 and FIG. 11, a portion for inputting data of the data input / output unit 102 is realized by the input unit 220. Further, the display unit 223 realizes a part for outputting data of the data input / output unit 102. The design information storage unit 101 is realized in the storage unit 221. The storage unit 221 stores a program for causing an electronic device to be executed as a design information storage unit. The storage unit reads the program and executes the unit. The remaining processing units, the process relation definition unit 103, the process tool looping unit 104, the process group flow generation unit 105, and the process flow generation unit 106 are realized in the processing unit 222.

<Flowchart (process design)>
FIG. 12 is a flowchart showing an outline of a processing flow for performing process design by the process design support apparatus having the configuration shown in FIGS. In the process design process in the process design support apparatus, steps S1 to S4 are executed.

  In step S1, the degree of relevance 40 is defined in the process leading constraint relation 30 between the processes s10 in the process leading constraint graph. The process of step S1 is executed by the process related definition unit 103. The definition of the degree of association 40 with respect to the process precedence constraint 30 may be manually defined by the user of the process design support apparatus, or may be automatically defined by the process design support apparatus. When the process design support apparatus automatically defines, the design information in the design information storage unit 101 is referred to, the degree of association 40 between the steps s10 is calculated based on the information, and the calculated degree of association 40 is used as the process. It is defined in the preceding constraint relationship 30.

  In step S2, the step s10 in the process precedence constraint graph is grouped into a process group 50 based on the design information and the degree of association 40 defined in the process precedence constraint relationship 30 of the process precedence constraint graph. Generate. The process of step S2 is executed by the process grouping unit 104.

  In step S3, the design information is referred to, and the process group 50 in the process group precedence constraint graph is rearranged based on the design information to generate a process group flow. The process of step S3 is executed by the process group flow generation unit 105.

  In step S4, the design information 101 is referred to, and a process flow is generated from the process group flow based on the design information. The process of step S4 is executed by the process flow generation unit 106.

  By executing the processes from step S1 to step S4, a process flow that satisfies conditions such as resources and tact time can be generated based on the input design information including the process precedence constraint graph. It should be noted that conditions such as resources and tact time are given in advance as part of the design information.

<Flowchart (relationship definition)>
FIG. 13 is a flowchart showing a processing flow for defining the relevance 40 in the process design in the process design support apparatus. In the degree-of-association definition process in the process design support apparatus, steps S11 to S15 are executed.

  In step S11, one unprocessed process precedence constraint relation 30 is extracted from the process precedence constraint graph.

  In step S12, the process 10 connected before and after the extracted process precedence constraint relation 30 is acquired.

  In step S13, the degree of relevance 40 for the extracted process precedence constraint relation 30 is calculated. Here, the calculation of the degree of association 40 may be performed based on some condition from the user who is input from the outside by the process design support apparatus. The calculation of the degree of association 40 may be automatically performed based on the acquired design information such as how the processes 10 are connected and the contents of the process information 20. When calculating automatically, for example, the degree of relevance 40 can be calculated under each condition as shown in the following “relationship degree calculation condition”.

  In step S <b> 14, the degree of association 40 calculated in step S <b> 13 is set in the process preceding constraint relation 30 that is the calculation target of the degree of association 40.

  In step S15, it is determined whether or not the definition (setting) of the degree of association 40 has been completed for all process precedence constraint relationships 30. In step S15, if the definition of the relevance 40 is completed, the process returns. If not, the process returns to step S11.

  By executing the above processing, the degree of relevance 40 can be defined for all the process leading constraint relationships 30 in the input process leading constraint graph.

<Conditions for calculating relevance>
Condition (1): When the process s10 connected before and after the extracted process precedence constraint 30 is connected in series at 1: 1 and not connected to another process s10, a high degree of relevance 40 is given (others There is no preceding constraint relationship 30 to the step s10, and it is easy to work continuously).

  Condition (2): When the process s10 connected before and after the extracted process precedence constraint relation 30 is the same or similar work type, a high degree of association 40 is given. For example, when the work types are the same, the highest degree of relevance 40 is given, and when they are similar, the degree of relevance 40 is lower than in the same case. Regarding the similar determination, for example, work types may be classified into categories in advance, and it may be determined that work types belonging to the same category are similar.

  Condition (3): A high degree of relevance 40 is given when the component configurations of the process s10 connected before and after the extracted process precedence constraint relation 30 are the same or similar. For example, when the component configurations are the same, the highest degree of relevance 40 is given, and when they are similar, a lower degree of relevance 40 is given than in the same case. About similarity determination, what is necessary is just to determine with similarity, for example, when the same components are partially contained in the components to comprise. Moreover, you may change the relevance 40 given according to the ratio in which the same components are contained.

  Condition (4): When the accuracy of the process s10 connected before and after the extracted process precedence constraint relation 30 is the same or similar, a high degree of association 40 is given. For example, when the work accuracy is the same, the highest degree of relevance 40 is given, and when they are similar, a lower degree of relevance 40 is given than in the same case. For the similar determination, for example, a threshold value (5 mm or the like) for the difference in work accuracy may be defined in advance, and if the difference in work accuracy does not exceed the threshold value, it may be determined that they are similar. Further, the degree of relevance 40 given according to the amount of difference in work accuracy may be changed (a high value if there is no difference, a medium value if it is less than 2 mm, a low value if it is 2 mm or more and less than 5 mm, etc. ).

  Condition (5): When the work directions of the process s10 connected before and after the extracted process precedence constraint relation 30 are the same or similar, a high degree of association 40 is given. For example, when the work directions are the same, the highest degree of relevance 40 is given, and when they are similar, a lower degree of relevance 40 is given than in the same case. For similar determination, for example, when the work direction is represented by the vector direction in the Cartesian coordinate system, a threshold value for the angle difference in the work direction is defined in advance, and the difference in the work direction angle does not exceed the threshold value. What is necessary is just to determine with it being similar. In addition, the degree of relevance 40 given according to the magnitude of the angle difference in the working direction may be changed (a high value if there is no difference, a medium value if it is less than 20 degrees, a value greater than 20 degrees and less than 45 degrees) In the case of low value etc.).

  Condition (6): When the resource requirement specifications of the process s10 connected before and after the extracted process precedence constraint relation 30 are the same or similar, a high degree of association 40 is given. For example, when the same resource is partially included in the resource requirement specification, it may be determined that they are similar. Moreover, you may change the relevance 40 given according to the ratio in which the same resource is contained.

  When the degree of association 40 is given based on the above conditions (1) to (6) for calculating the degree of association, the degree of association 40 may be given by an addition method or may be given by an absolute numerical value depending on the condition. In addition to the examples given above, if there is a condition based on information affecting the relevance between steps s10, the relevance 40 may be calculated according to the condition.

<Flowchart (Process grouping)>
FIG. 14 is a flowchart showing a process flow for grouping the process s10 in the process design in the process design support apparatus. In the process grouping process in the process design support apparatus, steps S21 to S26 are executed.

  In step S21, a process group preceding constraint graph is created with all the processes s10 in the process leading constraint graph as one process group 50, respectively. That is, first, 1 process = 1 process group is set, and these process groups 50 are aggregated in later processing. The process group preceding constraint graph is created by connecting the process groups 50 with the process group preceding constraint relation 51 so as to correspond to the process leading constraint relation 30 between the processes s10. Also, the same value as the degree of association 40 of the process precedence constraint relationship 30 is set as the group association degree 52 of the corresponding process group precedence constraint relationship 51.

  In step S22, one unprocessed process group preceding constraint relation 51 is extracted from the process group preceding constraint graph.

  In step S23, the process group 50 connected before and after the extracted process group preceding constraint relation 51 is acquired.

  In step S <b> 24, based on the group relevance level 52 defined in the extracted process group preceding constraint relation 51, it is determined whether or not the process groups 50 connected to the front and rear can be grouped. For example, when the group relevance level 52 is greater than a predetermined value, it is determined that the relevance between the process groups 50 is high and it is determined that grouping is possible. On the other hand, when the group relevance level 52 is equal to or less than a specified value, it is determined that the relevance between the process groups 50 is low and it is determined that the grouping is not possible. Furthermore, the maximum number that can be grouped (the maximum number that can be grouped) is also defined. If the current number of groupings is within the maximum groupable number, grouping is possible. On the other hand, if the current number of groupings exceeds the maximum groupable number, it may be determined that grouping is not possible. Moreover, as long as it is a condition for performing the grouping process in step s10, the determination may be performed under other conditions.

  In step S <b> 25, the process group 50 preceding and following the process group preceding constraint relation 51 connected to the process group preceding constraint relation 51 determined to be groupable in step S <b> 24 is combined as one process group 50. A case is assumed in which there are a plurality of process group preceding constraint relationships 51 each connected from one process group 50 to each of the process groups 50 before and after joining. Specifically, for example, there are two process group precedence constraint relations 51 from the process 2 connected to the process group 5 in FIG. 5, and there are also two process group precedence constraint relations 51 from the process 3 and the process 6. Is assumed. In this case, for example, it is possible to combine one process group preceding constraint relationship 51 that takes the average value of the group relevance level 52 of the process group preceding constraint relationship 51 and sets the average value as the group relevance level 52. One process group 50 is connected. In the above example, the newly added group relevance value 52 is an average value, but may be a minimum value or a maximum value other than the average value.

  A case is assumed in which there is a single process group preceding constraint relationship 51 connected from one process group 50 to each of the process groups 50 before and after joining. Specifically, for example, the case of the process group preceding constraint relation 51 that leads to the process group 4 in FIG. 5 is assumed. In this case, the process group preceding constraint relationship 51 connected to the process groups 50 before and after the combination is directly connected to one process group 50 that can be combined.

  Also, an estimate of the time required to execute all the operations of the process group 50 that can be combined is calculated as the process group standard time. Furthermore, the resources required to execute all the operations of the process group 50 that can be combined are set as the process group resource requirement specifications. The process group standard time is calculated by tracing from the first process s10 of the process group 50 to the last process s10 and integrating the process standard times of these processes s10.

  When the process s10 arranged in parallel as in the process group 5 of FIG. 5 is included, the processes are parallelized within the range of available resources. And about the part parallelized, after integrating | accumulating the process standard time of process s10 of those parts, they are compared and the larger one is integrated | accumulated as the time which is required for the part parallelized. When there are a plurality of parallel methods, the process group standard time is calculated for each of them, and the largest value (worst value) is set as the process group standard time.

  Regarding the process group resource requirement specification, first, similarly to the process group standard time, the process starts from the first process s10 of the process group 50 to the last process s10. Then, the maximum number (worst value) required for each resource is set as the process group resource requirement specification based on the resource requirement specification of the step s10.

  In the above example, the grouping process is performed even when the process s10 can be parallelized in the process group. However, if parallelization is possible, grouping may be performed only in the case of step s10 arranged in series without performing grouping processing. In such a case, complicated processing such as determination of the possibility of parallelization in consideration of the number of available resources as described above and calculation of a process group standard time in consideration of parallelization can be omitted.

  As the process information of the process group information 60 (FIG. 6) of the process group 50 that can be combined, a process information that includes information on the process s10 included in the process group 50 before and after the combination is defined. Moreover, what was calculated above is defined as process group standard time. Further, the process group resource requirement specifications defined above are defined. The process group information 60 of the process group 50 formed by combining the process preceding constraint relation 30 related to the process s10 included in the process group 50 is also held.

  In step S <b> 26, it is determined whether or not the process grouping process has been performed for all process group preceding constraint relations 51. If the process grouping process has been completed for all process group preceding constraint relations 51, the process returns. On the other hand, if the process grouping process has not been completed for all process group preceding constraint relations 51, the process returns to step S22.

  By executing the above processing, the process s10 having a high degree of relevance 40 in the input process precedence constraint graph is grouped. Then, the process group preceding constraint graph can be generated by the grouping process.

<Flowchart (generation of process group flow)>
FIG. 15 is a flowchart showing a process flow for generating a process group flow in the process design in the process design support apparatus. In the process group flow generation process in the process design support apparatus, steps S31 to S39 are executed.

  In step S31, the first process group 50 of the process group precedence constraint graph generated by the process grouping process is selected. Then, the process group 50 as a candidate to be processed next is added to the next candidate list to be held. The head process group 50 to be added may be single or plural.

  In step S32, all the sets (combinations) of the next executable process group 50 are extracted from the process groups 50 in the next candidate list. The executable process group 50 is a process group 50 that satisfies the conditions of design information such as the conditions (type, number, etc.) of currently available resources and the tact time conditions (within a specified time). The resource condition can be determined by referring to the process group resource requirement specification of the process group information 60. The tact time can be determined by referring to the process group standard time in the process group information 60. In this embodiment, the feasibility is determined according to the resource condition and the tact time condition. However, when it is desired to make a determination under other conditions, information necessary for the determination may be added to the process information 20 and the process group information 60 as design information.

  In step S33, one set is extracted from the set of executable process groups 50 extracted in step S32. Further, the information (process group resource requirement specification) of the resources necessary to execute the set of the executable process group 50 that has been extracted is referred to. Then, the condition of the currently available resource is updated (e.g., the resource necessary for execution is reduced from the currently available resource).

  In step S34, the set of one executable process group 50 extracted in step S33 is added with the process group execution order relation 70 after the process group 50 that has been completed last in the process group flow being created. connect. It is assumed that the extracted process group 50 is the first process group 50 and there is no process group 50 that has been completed last in the process group flow being created. In this case, a process group flow including only the extracted process group 50 is used.

  In step S35, the process group 50 that completes the next execution is specified from the incomplete process groups 50 in the process group flow being created. The process group 50 that completes execution next has the shortest process group standard time among the incomplete process groups 50. In addition, referring to information on resources to be released upon completion of the process group 50 (process group resource requirement specification), the conditions of resources that can be used at present are updated (resources that can be used by the amount of resources that are available after completion) Etc.). Further, the process group standard time of the completed process group 50 is added to the current process group flow execution completion time and updated. However, when the process group 50 to be completed is arranged in parallel with the other process groups 50, the addition is performed in consideration thereof. The process group standard time of the completed process group 50 is added to the completion time of the process group 50 connected before the completed process group 50 to obtain a process group standard time up to the completed process group 50.

  In step S36, it is determined whether or not the above processing is completed for all process groups 50 in the process group precedence constraint graph. Then, if the above processing for all the process groups 50 is completed, the process proceeds to step S38, and if not completed, the process proceeds to step S37.

  In step S37, after the process group 50 specified in step S35 is completed, the process group 50 that can be executed is added to the next candidate list. Thereafter, the processing after step S32 is recursively executed. The executable process group 50 is as described in S32.

  In step S38, since processing has been completed for all process groups 50, the created process group flow is generated (output) as one solution.

  In step S39, it is determined whether or not processing has been completed for all sets of executable process groups 50 extracted in step S32. If the processing is completed for all sets of executable process groups 50, the process returns. On the other hand, if the processing has not been completed for all sets of executable process groups 50, the process returns to step S33.

  By executing the above processing, each process group 50 in the input process group precedence constraint graph is rearranged so as to satisfy the resource condition and the tact time condition (design information condition), and a process group flow is generated. be able to.

<Flowchart (Process flow generation)>
FIG. 16 is a flowchart showing an outline of a process flow for generating a process flow from a process group flow in the process design in the process design support apparatus. In the process flow generation process in the process design support apparatus, steps S41 to S44 are executed.

  In step S41, an unprocessed process group 50 is extracted from the input process group flow.

  In step S42, a process flow within the process group 50 is generated for the extracted process group 50. When the process flow is generated, the extracted process s10 belonging to the extracted process group 50 is rearranged so as to satisfy the conditions of resources, tact time, etc. (design information).

  In step S43, it is determined whether or not processing has been completed for all process groups 50 in the process group flow. If the processing has been completed for all the process groups 50, the process proceeds to step S44. On the other hand, if the processing has not been completed for all the process groups 50, the process returns to step S41.

  In step S44, the process flows in the process group 50 generated for all process groups are connected to each other by the process execution order relation 80 to generate a process flow. Specifically, for each process group execution order relation 70, the process is executed from all the last processes s10 in the process group 50 connected before it to all the first processes s10 in the process group 50 connected thereafter. The process flows are connected to each other so as to connect the order relation 80. As many process flows as the number of combinations of process flows generated in each process group 50 are generated.

  By executing the above process for all process group flows generated by the process group flow generation process, all process flows that satisfy the conditions of resource conditions, tact time, etc. (design information) can be generated. it can.

<Flowchart (Generation of process flow within process group)>
FIG. 17 is a flowchart showing a process flow for generating a process flow in a process group in the process design in the process design support apparatus. In the process flow generation process within the process group in the process design support apparatus, steps S51 to S59 are executed.

  In step S51, the first step s10 in the step group 50 is selected and added to the next candidate list holding the step s10 that is a candidate to be processed next. The top step s10 to be added may be single or plural.

  In step S52, all the sets (combinations) of the next executable step s10 are extracted from the step s10 in the next candidate list. The executable process s10 is a process s10 that satisfies the conditions (type, number, etc.) of currently available resources, the tact time conditions (within a specified time), etc. (conditions based on design information). The resource condition can be determined by referring to the resource requirement specification of the process information 20. The tact time can be determined by referring to the process standard time in the process information 20. In this embodiment, the feasibility is determined according to the resource condition and the tact time condition. However, when it is desired to make a determination under other conditions, design information necessary for the determination may be added to the process information 20.

  In step S53, one set is extracted from the set of executable processes s10 extracted in step S52. Further, the information (resource requirement specification) of the resources necessary for executing the extracted set of executable steps s10 is referred to. Then, the condition of the currently available resource is updated. For example, the update of the resource condition is realized by reducing the resources necessary for execution from the currently available resources.

  In step S54, the set of one executable process s10 extracted in step S53 is connected with the process execution order relation 80 after the process s10 that has been completed last in the in-group process flow being created. . The extracted executable process s10 is the first process s10 in the process group 50. If there is no process s10 that has been completed last in the process flow 50 being created, the process flow includes only the extracted process s10.

  In step S55, the next step s10 that completes execution is specified from the unfinished steps s10 in the process flow within the process group 50 being created. Next, step s10 that completes execution has the shortest process standard time among incomplete steps s10. Further, reference is made to information (resource request specifications) of resources released upon completion of step s10. Then, the condition of the currently available resource is updated (for example, the number of resources that can be currently used is increased by the amount of resources that are available after completion). Further, the process standard time of the completed process s10 is added to the execution completion time of the current process flow in the process group and updated. However, when the completed step s10 is arranged in parallel with other steps s10, the addition is performed in consideration thereof. For example, the process standard time of the completed process s10 is added to the completion time of the process s10 connected before the completed process s10 to obtain the execution completion time of the process flow in the process group up to the completed process s10.

  In step S56, it is determined whether or not the processes up to step S55 have been completed for all the processes s10 in the process group 50. If all the processes s10 are completed, the process proceeds to step S58, and if not completed, the process proceeds to step S57.

  In step S57, after step 10 specified in step S55 is completed, step s10 that can be executed is added to the next candidate list. Thereafter, step S52 and subsequent steps are recursively executed. The executable process s10 is as described in step S52.

  In step S58, since the process up to step S55 is completed for all the processes s10 in the process group 50, the created process flow in the process group is generated (output) as one solution.

  In step S59, it is determined whether or not the processing up to step S58 has been completed for all the sets of executable steps s10 extracted in step S52, and if completed, the process returns. Return to S53.

  By executing the above processing, the processes s10 in the process group 50 are rearranged so as to satisfy the resource condition and the tact time condition. Thereby, a process flow within a process group can be generated.

  According to such a configuration, the process information 20 includes design information such as resource requirement specifications, and the process design can be performed so as to satisfy the condition of the usable resources with reference to the design information. Therefore, even when a cooperative operation by a plurality of resources (equipment) is included or when a plurality of steps 10 are executed in parallel, the process design can be automatically performed. Further, the degree of relevance 40 is automatically defined based on the process information 20 (design information). Thereby, a good design solution (process flow) can be generated in a shorter time without the designer having to define the relevance 40.

  Further, in the present embodiment, the process of simply determining each step s10 one by one from the previous step s10 is not performed. In the present embodiment, the degree of relevance 40 is calculated and defined from the relevance between the steps s10 based on the step information 20 (design information). Then, the processes s10 are collectively handled and rearranged according to the degree of association 40 between the processes s10, the processes are rearranged, and the process design is performed while evaluating the conditions based on the design information in the entire process flow.

  Therefore, although it is not a very good design solution if it is determined only by the previous process, it can be generated as a design solution even when it is a good design solution that can be determined as a whole including the subsequent process. That is, a more optimal process flow design solution can be designed in a shorter time.

  Further, in the present embodiment, the process group precedence constraint graph is generated by grouping the steps 10 of the process precedence constraint graph based on the degree of association 40 between the steps s10. And after rearranging the process group 50 with a small number instead of the process s10 with a large number, the process group 50 is developed into the process flow.

  Therefore, a solution (process flow) can be generated so that the related process s10 can be easily continued. In addition, the process design processing time can be greatly shortened, and a good process design solution can be generated efficiently (in a shorter time).

  Further, in the present embodiment, the process flow generation unit 106 can arrange the processes s10 in parallel within the range of the number of available resources. Therefore, a more efficient process flow can be created.

<Embodiment 2>
<Configuration of process design support device (with grouping availability condition adjustment)>
FIG. 18 is a diagram showing an example of another configuration of the process design support apparatus according to Embodiment 2 of the present invention. The process design support apparatus according to the present embodiment includes a processing time measurement unit 170 and a grouping condition adjustment unit 171 in addition to the process design support apparatus according to the first embodiment. Here, the processing time measuring unit 170 can measure the processing time during execution of the process design process. The grouping condition adjustment unit 171 can adjust conditions for grouping the process s10 into the process group 50.

  A process flow for performing process design by the process design support apparatus having another configuration shown in FIG. 18 will be described below with reference to FIG. Note that a threshold for processing time (allowable maximum processing time) for determining whether or not to adjust the grouping condition is specified in advance before performing process design with the process design support apparatus.

<Hardware configuration>
The processing time measuring unit 170 and the grouping condition adjusting unit 171 according to the second embodiment are realized in the processing unit 222 illustrated in FIG. Other parts of the second embodiment are the same as those in FIG. 11 described in the first embodiment.

<Flow chart (Process design with grouping condition adjustment)>
FIG. 19 is a flowchart showing a processing flow for performing process design (process design with grouping condition adjustment) by the process design support apparatus having the configuration shown in FIG. In the process design process with grouping condition adjustment in the process design support apparatus, steps S61 to S68 are executed.

  In step S61, a condition for grouping the process s10 into the process group 50 is set. When setting for the first time, the specified condition (initial condition) is set. For example, when the relevance degree 40 is larger than a predetermined value, that is, when it is determined that the relevance between the process groups 50 is high and the grouping is possible, “the relevance degree 40 is higher than a predetermined value. “Large” is set as a grouping condition. As another example, a threshold value of the degree of association 40 may be simply set as the grouping condition. After executing step S61, step S62 and step S65 are executed in parallel.

  In step S62, the process design process shown in FIG. 12 is executed. Detailed processing contents are as described in the first embodiment.

  In step S63, it is determined whether or not the process design process in step S62 has been completed to the end. If it has been completed to the end, the process proceeds to step S64, and if it has not been completed to the end (if interrupted), step S68. Proceed to

  The process design process is completed within the maximum allowable processing time specified in advance. Accordingly, in step S64, the processing time measurement process in step S65 is interrupted, and the process design process with grouping condition adjustment is terminated.

  In step S65, the time during which the process design process is executed in step S62 is measured. The time measurement continues until the allowable maximum processing time defined in advance is reached, and when the allowable maximum processing time is reached, the processing time measurement process is completed. However, when the process design process in step S62 is completed within the allowable maximum processing time, the process in step S65 is interrupted. The processing in step S65 is executed by the processing time measuring unit 170.

  In step S66, it is determined whether or not the execution time of the process design process in step S62 exceeds a predetermined maximum allowable processing time (which can be grasped as a threshold time). If the execution time exceeds the allowable maximum processing time, the process proceeds to step S67. On the other hand, if the execution time does not exceed the allowable maximum processing time, the process design process with grouping condition adjustment is terminated.

  The time required for the process design process in step S62 exceeds the maximum allowable processing time specified in advance. Therefore, in step S67, the process design process in step S62 is interrupted, and the process proceeds to step S68.

  In step S68, the grouping in step s10 is further performed, and the grouping conditions are adjusted so that the time required for the process design process is shortened. For example, the threshold of the relevance 40 for grouping is made smaller than the current threshold. In this case, a condition in which the threshold value of the degree of association 40 is set to a value that is -1 from the current value may be set, or a condition in which the threshold value of the degree of association 40 is set to a value that is ½ of the current value may be set. In addition, the time required for the process design process can be shortened by adjusting to conditions that make grouping easier than at present. The grouping condition adjustment processing in step S68 is executed by the grouping condition adjustment unit 171. After adjusting the grouping conditions in step S68, the process returns to step S61. Then, using the new grouping conditions, the process design process with grouping condition adjustment in step S61 and subsequent steps is repeated.

  According to such a configuration, by defining the allowable maximum processing time (threshold time) in advance, even when the grouping of the process s10 is insufficient and the time required for the process design process increases, the grouping is automatically performed. You can adjust the conditions. Therefore, the process design process can be completed in a shorter time.

  In addition, when the process is started from the grouping condition for performing the process design without grouping and it takes too much time for the process design process, the process design process can be performed under the condition of gradually facilitating the grouping. Thereby, the process design can be efficiently performed without narrowing down the process design solution candidates from the beginning and performing unnecessary pruning. In addition, the process design can be automatically performed without knowledge and know-how regarding the degree of association 40.

  In the process design, as the number of steps s10 increases, the number of rearrangement combinations increases, and the design solution increases exponentially. Conversely, if the number of objects to be rearranged is slightly reduced by grouping the process s10, the process design can be performed by rearranging the grouped process groups 50. Therefore, the number of rearrangement combinations can be greatly reduced, and the process time for process design can be greatly reduced.

<Embodiment 3>
<Configuration of process design support device (division of process precedence constraint graph)>
FIG. 20 is a diagram showing an example of another configuration of the process design support apparatus according to Embodiment 3 of the present invention. The process design support apparatus according to the present embodiment includes a process precedence constraint graph dividing unit 190 in addition to the process design support apparatus according to the first embodiment. The process precedence constraint graph dividing unit 190 can divide the process precedence constraint graph based on the degree of association 40 between the steps s10.

  A process flow for performing process design by the process design support apparatus having another configuration shown in FIG. 20 will be described below with reference to FIGS.

<Hardware configuration>
The process precedence constraint graph dividing unit 190 of the third embodiment is realized in the processing unit 222 shown in FIG. Other parts of the third embodiment are the same as the configuration of FIG. 11 described in the first embodiment.

<Flowchart (process design with process precedence constraint graph division)>
FIG. 21 is a flowchart showing a processing flow for performing process design (process design with process precedence constraint graph division) by the process design support apparatus having the configuration shown in FIG. In the process design process with process precedence constraint graph division in the process design support apparatus, steps S71 to S78 are executed.

  In step S71, the degree of relevance 40 is defined in the process leading constraint relation 30 between the processes s10 in the process leading constraint graph. The details of the processing are the same as the processing in step S1, and are as already described in the first embodiment.

  In step S72, based on the degree of relevance 40 defined in the process precedence constraint relationship 30 of the process precedence constraint graph, the process precedence constraint graph is cut at a portion between the processes s10 having low relevance, and the process precedence constraint graph is divided. . The process of step S72 is executed by the process precedence constraint graph dividing unit 190.

  In step S73, one of the process leading constraint graphs (partial process leading constraint graph) divided in step S72 is extracted.

  In step S74, a process grouping process in the partial process precedence constraint graph is executed for the process precedence constraint graph (partial process precedence constraint graph) extracted in step S73. Thereby, in step S74, a process group precedence constraint graph for the partial process precedence constraint graph is generated. The details of the process grouping process in the partial process precedence constraint graph are the same as those in step S2 in FIG. 11 and are as already described in the first embodiment.

  In step S75, a process group flow generation process is executed for the process group precedence constraint graph (part) generated in step S74. Thereby, in step S75, a process group flow for the process group preceding constraint graph (part) is generated. The details of the process group flow generation process for the process group preceding constraint graph (part) are the same as those in step S3 in FIG. 12, and are as already described in the first embodiment.

  In step S76, a process flow generation process is executed for the process group flow (part) generated in step S75. Thereby, in step S76, a process flow for the process group flow (part) is generated. The details of the process flow generation process for the process group flow (part) are the same as the process of S4 in FIG. 12, and have already been described in the first embodiment.

  In step S77, it is determined whether or not the processing up to step S76 has been completed for all process precedence constraint graphs divided in step S72. If the process is completed, the process proceeds to step S78. On the other hand, if the process is not completed, the process returns to step S73.

  In step S78, the process flows generated for all process precedence constraint graphs divided in step S72 are connected to each other by the process execution order relation 80 to generate a process flow. Specifically, for each process flow (part), the process s10 connected by the process precedence constraint 30 before the process s10 in the target process flow before division belongs (other than the target process flow). Each process flow is connected so as to connect the process execution order relation 80 from all the last process s10 of the flow (part) to all the first processes s10 of the target process flow (part). When the above connection process is executed for all process flows (parts), one process flow including all processes s10 is created. Process flows are generated by the number of combinations of process flows generated in each divided process precedence constraint graph.

  By executing the above processing, the degree of association 40 between the steps s10 is calculated from the design information 101 stored in the storage unit of FIG. 20 including the input step precedence constraint graph. Then, based on the degree of relevance 40, the process precedence constraint graph is divided, a process flow that satisfies the conditions such as resources and tact time is generated for each divided partial process precedence constraint graph, and these are combined to finally A simple process flow can be generated.

<Flowchart (Division of process precedence constraint graph)>
FIG. 22 is a flowchart showing a process flow for dividing the process precedence constraint graph based on the degree of association 40 between the processes s10 in the process design in the process design support apparatus. In the process precedence constraint graph dividing process in the process design support apparatus, steps S81 to S87 are executed.

  In step S81, one unprocessed process precedence constraint relationship 30 is extracted from the process precedence constraint graph.

  In step S82, it is determined whether or not the process s10 is to be disconnected at the extracted part of the process precedence constraint 30 according to the specified division condition. If it is disconnected, the process proceeds to step S83, and if not, the process proceeds to step S84. .

  For example, if the relevance degree 40 is smaller than a predetermined value, it is determined that the relevance between the steps s10 is low and it is determined that disconnection is possible. However, even if the degree of relevance 40 is smaller than a predetermined value, if a plurality of divided process precedence constraint graphs can be executed in parallel by cutting at that portion, it is determined that cutting is not allowed. This is because in step S78, the partial process flows are not rearranged in consideration of parallelism, but all the partial process flows are simply arranged in series. Furthermore, the maximum number that can be cut (the maximum number that can be cut) is also defined, and if the current number of cuts is within the maximum number that can be cut, it is determined that cutting is possible. Furthermore, other conditions may be used as long as they are conditions for cutting between steps s10.

  In step S <b> 83, the process s <b> 10 in the process precedence constraint graph is cut at the extracted process precedence constraint relationship 30.

  In step S84, it is determined whether or not the cutting possibility determination process has been completed for all process precedence constraint relations 30. If completed, the process proceeds to step S85, and if not completed, the process returns to step S81.

  In step S85, when the process leading constraint graph is divided as a result of the disconnection between the processes s10 in the process so far, the partial process leading constraint graph is converted into the partial process leading constraint graph (partial process leading constraint graph). Graph).

  Specifically, for example, a partial process precedence constraint graph can be generated by tracing a process s10 connected by the process precedence constraint relationship 30 from a step s10 having a process precedence constraint graph to the cut portion. This is executed for all the processes s10 in the process precedence constraint graph (except for the process s10 included in the specified partial process precedence constraint graph). Thereby, all the divided partial process precedence constraint graphs can be generated.

  In step S86, it is determined from the partial process precedence constraint graph generated in step S85 whether or not the division is completed. If the division is completed, the process returns. If the division is not completed, the process proceeds to step S87.

  For example, if the number of divisions (the number of partial process precedence constraint graphs) is larger than a prescribed value, it is determined that the division is sufficient, and it is determined that the division is complete. Otherwise, it is determined that the division is not completed. . Further, if the size of all the partial process precedence constraint graphs (number of steps s10) is smaller than the predetermined value, it is determined that the division is sufficient, and it is determined that the division is complete. For example, it may be determined that the division is not completed. Furthermore, other conditions may be used as long as it is possible to determine whether or not the image is sufficiently divided.

  In step S87, the cutting condition for determining whether or not to cut between the steps s10 is adjusted in the process leading constraint graph division processing.

  For example, when the relevance degree 40 is smaller than a specified value as the cutting condition, it is determined that the relevance between the steps s10 is low and it is determined that cutting is possible, and otherwise, it is determined that cutting is not possible. The threshold value of relevance 40 is increased. In that case, the threshold value may be a condition that is +1 larger than the current value, or the threshold value may be a condition that is twice the current value. In addition, as a cutting condition, a maximum number that can be cut (maximum number that can be cut) is also defined. If the current number of cuts is within the maximum number that can be cut, it is determined that cutting is possible. Such a case is assumed. In this case, a condition may be set such that the maximum number that can be cut is increased by +1, or a condition that the maximum number that can be cut is twice the current value. Other division conditions may be used as long as the process precedence constraint graph is more easily divided.

  According to such a configuration, based on the degree of association 40 between the processes s10, the process precedence constraint graph is divided and part of the process design process is performed, and those results are combined to generate a final process flow. be able to.

  Therefore, even when the process s10 includes a cooperative operation by a plurality of resources (equipment) or when the problem is complicated, such as when the plurality of processes s10 are executed in parallel, the following effects are obtained. That is, it is possible to divide the process precedence constraint graph at a portion that is meaningful as process design (where the relationship between the processes s10 is low), and it is possible to generate a process design solution in a shorter time. As described in the first embodiment, the degree of association 40 between the steps s10 is automatically calculated and defined from the design information, and based on the degree of association 40, a complicated problem is divided into problems that are easier to solve. Can be solved. Therefore, the final design solution can be generated in a shorter time.

  It is also possible to provide a process design support apparatus that combines the process design support apparatus having the function according to the third embodiment and the process design support apparatus having the function according to the second embodiment.

6 is a diagram illustrating an example of information representing a relationship between a part and a process in the process design support device according to Embodiment 1. FIG. It is a figure showing the information of the process in the process design assistance apparatus which concerns on Embodiment 1. FIG. It is a figure which shows an example of a process precedence restriction graph in the process design assistance apparatus which concerns on Embodiment 1. FIG. It is a figure which shows an example of the process precedence constraint graph with a relevance degree in the process design support apparatus which concerns on Embodiment 1. FIG. It is a figure which shows an example of a process group precedence restriction graph in the process design support apparatus which concerns on Embodiment 1. FIG. It is a figure showing the information of the process group in the process design support apparatus which concerns on Embodiment 1. FIG. It is a figure which shows an example of a process group flow produced | generated with the process design assistance apparatus which concerns on Embodiment 1. FIG. It is a figure which shows an example of the process flow produced | generated with the process design assistance apparatus which concerns on Embodiment 1. FIG. It is a figure which shows another example of the process flow produced | generated with the process design assistance apparatus which concerns on Embodiment 1. FIG. It is a figure which shows the structure of the process design assistance apparatus which concerns on Embodiment 1. FIG. It is a figure which shows the hardware constitutions of a process design support apparatus. 4 is a flowchart of a process design process of the process design support apparatus according to the first embodiment. 6 is a flowchart of relevance definition processing of the process design support apparatus according to the first embodiment. 4 is a flowchart of a process grouping process of the process design support apparatus according to the first embodiment. 6 is a flowchart of a process group flow generation process of the process design support apparatus according to the first embodiment. 6 is a flowchart of a process flow generation process of the process design support apparatus according to the first embodiment. 5 is a flowchart of a process flow generation process within a process group of the process design support apparatus according to the first embodiment. It is a figure which shows the structure of the process design assistance apparatus which concerns on Embodiment 2. FIG. 10 is a flowchart of a process design process with grouping condition adjustment of the process design support apparatus according to the second embodiment. It is a figure which shows the structure of the process design assistance apparatus which concerns on Embodiment 3. FIG. It is a flowchart of the process design process with process precedence constraint graph division | segmentation of the process design assistance apparatus which concerns on Embodiment 3. FIG. 12 is a flowchart of process precedence constraint graph division processing of the process design support apparatus according to the third embodiment.

Explanation of symbols

  10s process, 11p part, 20 process information, 30 process precedence constraint relation, 40 relevance, 50 process group, 51 process group precedence restriction relation, 52 group relevance, 60 process group information, 70 process group execution order relation, 80 process Execution order relation, 100 process design processing unit, 101 design information storage unit, 102 data input / output unit, 103 process related definition unit, 104 process grouping unit, 105 process group flow generation unit, 106 process flow generation unit, 170 processing time measurement Part, 171 grouping condition adjustment part, 190 process precedence constraint graph division part, 220 input part, 221 storage part, 222 processing part, 223 display part.

Claims (4)

In the process design support device for determining the process flow indicating the execution order of the processing steps obtained by arranging a plurality of process blocks,
A process grouping unit that performs grouping processing on the plurality of process blocks based on a degree of association indicating a high degree of relevance between the process blocks;
A process group flow that generates a process group flow in which the groups generated as a result of the grouping process are arranged in series or in parallel based on design information that is a design condition defined for each process block. A generator,
Based on the design information, a process flow generation unit that arranges the process blocks belonging to the group in series or in parallel,
A process design support apparatus characterized by that. In the process precedence constraint graph representing the order constraints of the process blocks, a process relevance level defining unit that automatically defines the relevance level based on the design information is further provided.
The process design support apparatus according to claim 1. In the process design support device, a processing time measuring unit that measures the time for executing the process design process,
A grouping condition adjusting unit that changes a condition of the grouping process when the measurement time by the processing time measuring unit exceeds a preset threshold time;
The process design support apparatus according to claim 1. A process precedence constraint graph dividing unit that divides the process precedence constraint graph based on the degree of association;
The grouping unit
The grouping process is performed on the process precedence constraint graph after the division divided by the process precedence constraint graph division unit,
The process design support apparatus according to claim 2.

Images