JP2005242844A - Process planning processor and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To solve the problem in a conventional process planning that the necessary construction period from start to completion of construction on a process plan is determined by building up times necessary for individual works, and when the construction period desired by a consumer is shorter than the necessary construction period, the process plan is corrected by trial and error. <P>SOLUTION: To enable the systematic correction of the process plan in a case that the desired construction period is shorter than the necessary construction period, parallel work attribute information showing whether each process is workable in parallel or not and order replacement attribute information showing whether the work order of each process is replaceable or not are assigned to routing data 2. When a correction of the process plan such as shortening of the construction period is needed, it is examined whether the attribute information of each process is ON or OFF, and processes which are ON are preferentially selected, and set as a parallel work, or the order of the processes are replaced to facilitate the parallel working with another process, whereby the construction period is shortened. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a process plan creation processing apparatus and program for creating a process plan for construction including a number of processes such as construction work. The present invention relates to optimization of a process plan particularly when there is a restriction in the work period from the start date to the completion date.

  In building construction such as housing, various types of construction are carried out from the foundation to the frame, construction, joinery, interior, etc. according to the progress of construction. Materials necessary for each construction must be prepared in accordance with the time of construction, and specialist workers must be secured in advance. For this reason, it is difficult to decide or change the construction procedure on the spot, so it is important to create a solid process plan.

The construction work process plan is a process in which each work unit required from the start to the completion is regarded as a process, and a sequence is created by connecting the processes in the order of construction, and is represented by a bar chart diagram or a network diagram. In the conventional process plan creation system, the work period required for the work is calculated by accumulating the work time required for each process in the process sequence from start to completion given in the process plan. For example, in Japanese Patent Laid-Open No. 2000-1988 shown in [Patent Document 1], the total necessary working days are obtained by calculating the individual necessary working days for each construction (process) and totaling those individual working days. Technology that calculates the number of days (required work period), further subtracts this necessary work period from the desired work period, finds the total number of days, and allocates this time to each process according to various construction delay risks to determine the expected work period Is disclosed.
Japanese Unexamined Patent Publication No. 2000-1988

  In the conventional process planning system, the time required for the entire process from start to completion is determined by accumulating the time required for each work, and the customer's desired time is longer than the required time. . However, depending on the customer, the desired work period may be just below the required work period, or the desired work period may be shorter than the necessary work period. In such a case, in the conventional process plan creation system, the process plan must be corrected by a trial and error method.

  The present invention makes it possible to correct the process plan systematically and shorten the required work period even when the customer's desired work period is shorter than the necessary work period in the process plan. Therefore, in the present invention, in the information of each routing that becomes the basis of the process planning, the parallel work attribute information indicating whether or not the process can be performed in parallel and the work order of the process can be changed in advance. If it is necessary to alleviate the bottleneck such as shortening the work period in the process planning process, first check whether these attribute information is ON or OFF for each process. It is selected preferentially and the process itself is converted into parallel work, and the previous and subsequent processes are replaced to facilitate parallel work with other processes so that the construction period can be shortened.

The present invention can be configured as follows.
[1] A process plan creation processing apparatus capable of drafting a process plan, detecting a bottleneck in the drafted process plan and creating a correction proposal,
Store in the storage device with attribute information about whether or not the work of each process can be performed in parallel with the routing data of each process that is the basis of process planning, and whether or not replacement is possible before and after in the sequence A routing data storage unit,
When a bottleneck is detected in the drafted process plan, a correction proposal is created by referring to the attribute information of the above routing data so that the process can be parallelized or the process can be replaced before and after. A correction proposal creation processing unit,
A configuration of a process plan creation processing device, wherein the process plan data in the process data storage unit is updated based on a correction proposal, and the process plan is corrected.
[2] A process data storage unit that stores process data for managing information on work and resources of individual processes that are elements of process plan creation;
For each process of the process data, sequence information related to the process within a predetermined construction unit, parallel work attribute information that makes it possible to identify whether the work of the process can be performed in parallel, and the process in the sequence A routing data storage unit that stores routing data for managing the order replacement attribute information that makes it possible to identify whether or not the order can be replaced;
Based on the input of process plan planning conditions such as the desired work period and work personnel, the process plan planning processing unit that creates the process plan data by formulating the process plan by combining the above routing data,
Analyze the created process plan data and refer to the parallel work attribute information or the order change attribute information of the above routing data for the bottleneck detection processing unit that detects the part that becomes the bottleneck and the bottleneck of the detected process plan. A correction proposal creation processing unit that creates a correction proposal that relaxes the bottleneck by parallelizing the work of processes that can be performed in parallel or by changing the order of processes that can be changed in order;
The structure of the process plan preparation processing apparatus characterized by comprising.
[3] The route code includes, as sequence information, at least a process code of the process, information of a trigger process for starting the sequence, and information of processes before and after the process in the sequence. A configuration of the process plan creation processing apparatus according to the preceding item 2.
[4] The method described in the above item [2], wherein when the correction proposal creation processing unit converts a process capable of parallel work into parallel work, a process having a low skill level of the required work is preferentially selected. Of the process plan creation processing apparatus.
[5] The process according to item 2 above, wherein when the process plan is drafted, the process plan is created by preferentially selecting a plurality of processes that are connected to form a process plan. Configuration of the plan creation processing device.
[6] The correction proposal creation processing unit, when selecting a process capable of parallel work and converting it to parallel work, corrects the degree of increase in work efficiency by multiplying by the loss rate accompanying the increase in work personnel. The configuration of the process plan creation processing apparatus according to any one of the preceding items 2 to 5.
[7] Process planning processing means for planning a process plan using routing data having attribute information about whether or not process operations can be performed in parallel and whether or not replacement can be performed before and after the sequence. ,
A bottleneck detection processing means for detecting a bottleneck in the planned process plan;
Correction proposal creation processing for creating a correction proposal for the detected Kushiro, referring to the attribute information of the above-mentioned routing data, and performing the parallelization of the process in which the work can be performed in parallel or the replacement of the process capable of being replaced before and after Means,
Routing data update processing means for updating routing data based on the correction proposal;
The structure of the process plan creation processing program characterized by comprising.

  FIG. 1 is a conceptual diagram of a process plan creation processing apparatus according to the present invention. In the figure, 1 is the process data storage unit, 2 is the process data stored in the process data storage unit, 3 is the routing data storage unit, 4 is the routing data stored in the routing data storage unit, 5 is A process plan planning processing unit, 6 is the planned process plan data, 7 is a bottleneck detection processing unit that analyzes the process plan data 6 and detects a bottleneck, 8 is the detected bottleneck data, and 9 is the bottleneck data. A correction proposal creation processing unit that analyzes the process 8 and creates a process correction proposal that relaxes the bottleneck, 10 updates the process correction proposal data, 11 updates the process data 4 based on the created process correction proposal data 10 The routing data update processing unit. Here, the process data storage unit 1 and the routing data storage unit 3 are realized by using a file storage means of a computer, and the process plan planning processing unit 5, the bottleneck detection processing unit 7, and the correction proposal creation processing unit 9 are The routing data update processing unit 11 is realized by using program processing means by a CPU of a computer.

  The process data 2 stored in the illustrated process data storage unit 1 is exemplary, but holds information related to work contents and resources of each process, for example, information extracted from a CAD drawing. Originally created by editing. The data items include information such as process data identification information ID, process code, process name, merchandise item code, and yield (required time and merchandise unit). In addition, the information of the routing data 4 stored in the routing data storage unit 3 is a sequence of work group procedures consisting of a small number of processes related to a partial construction unit in the entire construction schedule to be processed. It is something to manage. The routing data 4 is created for each process, and in the example shown in the figure, as data items, the routing data identification information ID, the process code of the process in the sequence, the trigger process information indicating the first process in the sequence, Information on the process before and after the process, parallel work attribute information that makes it possible to identify whether the work of the process can be performed in parallel, and whether the order of the process can be switched in the sequence Information such as order replacement attribute information is included.

  The process plan planning processing unit 5 determines each process based on conditions such as a desired work period (start date, completion date) and the number of input personnel given as process plan planning conditions and a sequence of work procedures of route data edited in advance. Are combined to create a process plan and output as process plan data 6.

  The bottleneck detection processing unit 7 analyzes the process plan data 6 and checks whether or not the planning conditions such as the construction period and work personnel given previously are satisfied. For example, in the process plan of the process plan data 6, if the total work period and the total number of workers required for the execution of the entire plan exceed the desired work period and the desired number of persons, Many processes are extracted as the Kushiro part.

  The correction proposal creation processing unit 9 refers to the parallel work attribute information and the order replacement attribute information of the routing data for the process extracted as a bottleneck, and selects a process that can be performed in parallel or a process that can be replaced before and after. To do. For example, for a process that can be performed in parallel, increase the number of input personnel for that process to parallelize the work, shorten the required time, and for processes that can be switched back and forth, shift the process forward or backward. A correction proposal is made to shorten the total time required by paralleling with other processes.

  The routing data update processing unit 11 updates the routing data 4 in the routing data storage unit 3 based on the created correction proposal. The process plan planning processing unit 5 executes the process planning process again based on the updated routing data 4 and creates corrected process plan data 6.

  FIG. 2 is an explanatory diagram of an example of creating a correction proposal by detecting a bottleneck and paralleling work (increasing personnel). FIG. 2A illustrates a model of a sequence of work procedures, and A, B, C, D, and E are processes connected to the sequence. In this example, the processes of A, B, and E are independent operations, but the operations of the processes of C and D are already parallelized. FIG. 2B shows process plan data and a correction proposal example for the model of FIG. Here, paying attention to the parallel processes C and D, the required time is 8 hours and 16 hours, which is longer than the time required for other processes. It has been judged. In particular, the time required for the process C is 8 hours, but the time required for D is 16 hours, and the process C cannot proceed to the process E until 8 hours have passed even after its work is completed. In this case, if the work time of the process D can be shortened, the start of the work of the process E can be accelerated accordingly, so a correction proposal for increasing the current number of input personnel 1 of the process D to 2 is created. However, since it is empirically known that the proportional relationship does not always work between the number of input personnel and the required time, here a 12% loss rate is expected and the proposed required time is 9 hours. It will be.

  FIG. 3 is an explanatory diagram of an example of creating a correction proposal based on another bottleneck detection and process parallelization. FIG. 3A shows an example of a serial model in the current process plan. FIG. 3C shows the process plan data and a correction proposal example. Here, the time required for the processes C and D are 8 hours and 16 hours, which are longer than the time required for the other processes, and thus are determined as planned bottlenecks (indicated by *). On the other hand, since the parallel work attribute of processes C and D is set to allow parallel work (indicated by x), a correction proposal for making process C parallel is created. FIG. 3 (b) shows the created proposed parallel model, where the process D is shifted forward and the work can be started together with the process C. As a result, the total required time is reduced by 8 hours. The

  According to the present invention, since information indicating whether the process that is the basis of the process planning is a work that can be performed in parallel or can be changed in order before or after is added to the routing data in advance, When a bottleneck is detected, it is possible to easily determine the process to be improved and the improvement method, and the process management can be made more efficient and faster.

  An embodiment of the present invention will be described with reference to FIGS. FIG. 4 is a functional explanatory diagram of one embodiment of the process plan creation processing apparatus according to the present invention, showing necessary processing units and data files in blocks, and showing the relationship between the blocks and the flow of processing by arrows. 5 and 6 (a) to 6 (g) show the data structure of each data file in FIG. FIG. 7 is a hardware configuration diagram.

  In FIG. 4, 20 is a process master management unit, 21 is a product master management unit, 22 is a routing master management unit, 23 is a man-hour calculation unit, 24 is a parallel work loss rate master management unit, 25 is a process planning processing unit, 26 is a planning condition input unit, 27 is a process plan inquiry / change unit, 28 is a bottleneck detection processing unit, 29 is a correction proposal creation processing unit, 30 is a routing master update processing unit, 31 is a process master, 32 is a product master, 33 is integrated estimate data, 34 is a route master, 35 is work time data by process, 36 is a parallel work loss rate master, 37 is process plan data, 38 is Kushiro data, 39 is route correction proposal data, and 40a is a process. A plan network diagram 40b is a process plan bar chart diagram.

  The process master management unit 20 creates or updates the process master 31 by editing the process data based on the process code, the process name, the product item code, and the yield (time / product unit) for each type of process. . The product item code is a code for linking with the product code.

  The merchandise master management unit 21 creates or updates the merchandise master 32 by editing the merchandise data with each data of the merchandise code, the merchandise name, the size, the unit, and the merchandise item code for each member merchandise.

  The route master management unit 22 extracts necessary steps from the CAD drawing of the architectural design not shown, and the property number, route type, route name, route number, process code, number of workers, trigger process 1 , Trigger process 2, trigger process 3, pre-process 1, pre-process 2, pre-process 3, post-process 1, post-process 2, post-process 3, curing days 1, curing days 2, curing days 3, work group capable of parallel work The routing data is edited based on the data of the section and the work group section whose order can be changed, and the routing master 34 is created or updated. Here, the route type is the work method ID, the route name is the work method name, and the trigger steps 1 to 3 are the first to third of the condition steps for starting the step (step corresponding to the route data). The first step, the previous step 2, the previous step 3, the post step 1, the post step 2, and the post step 3 are the steps immediately before and after the step, the curing days 1, the curing days 2, and the curing days 3, respectively. The number of days until the end or start of the process before or after the start of the trigger process, the work group classification that can be performed in parallel work is classified as a work group capable of parallel work, and the order of work group sections that can be reordered can be switched This is a division as a work group.

  The man-hour calculation unit 23 calculates man-hours for each process based on each process data of the process master 31, related product data of the product master 32, and related integrated estimated data 33, and process-specific work time data 35. Create Here, the integrated estimate data is composed of each data of the property number, the product code, and the integrated quantity, and the man-hour calculating unit 23 divides the integrated quantity of the integrated estimated data by the step of each process data of the process master 31 to work Calculate time. The output work time data 35 by process is composed of each data of property number, process code, process name, and work time.

  The parallel work loss rate master management unit 24 obtains, as parallel work loss rate data, a loss rate that decreases in efficiency due to interference or the like when increasing the number of employees for each process that can be performed in parallel work, from past data, etc. Register in the parallel work loss rate master 36. The parallel work loss rate data includes data of process code 1, process code 2, process code 3, number of personnel, and loss rate. The process codes 1 to 3 are codes of processes that proceed simultaneously by parallelization, and include cases where the number of personnel in only one process is increased and parallelized by a plurality of personnel. The number of personnel is the number of personnel in parallel, and the loss rate indicates the loss rate in the number of personnel.

  The process plan planning processing unit 25 performs process planning based on each routing data of the routing master 34, loss rate data of the parallel work loss rate master 36, and planning conditions given from the planning condition input unit 26. A process plan data 37 is created. The process plan is registered in advance for each model, and when the process plan is made, the pattern closest to the building object is selected and used. The process planning processing unit 25 arranges each process along the selected pattern, sets the start date and time and the end date and time sequentially from the required time for each process, and edits other related data.

  In the process plan data 37 thus created, the property number, routing type, routing number, process code, number of workers, required time, start date / time, end date / time, previous process, subsequent process, and parallel work are possible. Each data includes work group category, order changeable work group category, desired end date, and actual end date. Here, the start date / time is the scheduled start date / time for the process, the end date / time is the planned end date / time obtained by accumulating the time required for each process up to the process, and the actual end date is the actual date / time It is data of the end date and time of the process. If the actual end date is input, in the correction proposal creation process, the correction proposal can be created only for the process for which the actual end date has not yet been input (not completed), not from the start date. The process plan data 37 can be referred to directly from the process plan inquiry / change unit 27, or can be changed by rewriting the data, and the process plan network diagram 40a and the process plan bar chart diagram 40b are printed. Can be output.

  The bottleneck detection processing unit 28 reads out and analyzes the process plan data 37, and creates the bottleneck data 38 indicating the process at the location that is a bottleneck, as described with reference to FIGS.

  The correction proposal creation processing unit can perform parallel work by referring to the information on the work group classification capable of parallel work and the work group classification capable of order change with respect to the process designated as a bottleneck in the process plan data 37 based on the bottleneck data 38. If there is a change in the order, the route correction proposal data 39 is created. In order to shorten the work period by increasing the number of input personnel, the input efficiency is checked for each process that can be input, and the process correction proposal data 39 is created by sequentially selecting the processes with the highest input efficiency. The route correction proposal data 39 is composed of data of property number, route type, route number, process code, number of input personnel, number of proposed input personnel, pre-process, post-process, pre-proposed process, post-proposed process data. Yes. The number of personnel to be input in the routing correction proposal is increased gradually up to a predetermined maximum number of personnel that can be input.

  The route master update processing unit 30 performs an update process for reflecting the route correction proposal data 39 on the route master 34. The process planning process unit 25 performs the process planning process again with the updated data of the routing master 34, and the above process is repeated until the desired schedule is satisfied.

  FIG. 7 is a hardware configuration diagram of an embodiment of a process plan creation processing apparatus according to the present invention. In the figure, 41 is a CPU, 42 is a keyboard, 43 is a display device, 44 is a printer, 45 is a communication interface, and 46 is a storage device, both of which are provided in a general computer. The storage device 46 stores programs 50 to 60 and data files 61 to 69 for causing the hardware to function as the process plan creation processing device of the present invention. Here, 50 is a process master management program, 51 is a product master management program, 52 is a work order master management program, 53 is a manhour calculation program, 54 is a parallel work loss rate master management program, 55 is a process planning process program, 56 Is a planning condition input program, 57 is a process plan inquiry / change program, 58 is a bottleneck detection processing program, 59 is a correction proposal creation processing program, and 60 is a routing master update processing program. 20, product master management unit 21, work order master management unit 22, man-hour calculation unit 23, parallel work loss rate master management unit 24, process plan planning processing unit 25, planning condition input unit 26, process plan inquiry / change unit 27, Kushiro detection processing unit 28, correction proposal creation processing unit 29, routing master update processing unit 30 A program executed by the CPU41 to implement each function.

  In addition, the process master 61, the product master 62, the integrated estimate data 63, the work order master 64, the work time data 65 for each process, the parallel work loss rate master 66, the process plan data 67, the Kushiro data 68, and the work order correction proposal data in FIG. Each of the data files 69 corresponds to the data files indicated by 31 to 39 in FIG.

  FIG. 8 is an explanatory diagram of a work process sequence in the embodiment of the present invention. In the illustrated example, work processes or work process groups are indicated by blocks A and B (B1 (B11, B12), B2 (B21, B22), B3 (B31, B32)), C. Among these, permutation relationships between work process groups such as A, B, and C are shown connected by a downward arrow, and work processes surrounded by one block like B11 and B12. Is a group of work processes that can be parallelized. And what can be exchanged between the blocks of the work process group like B1 and B2 are connected by the upper and lower bidirectional arrow lines, and the work process blocks that can be parallelized like B2 and B3 are It is shown connected with the left and right bidirectional arrows.

  In the process plan creation process, first, the desired work period is input by the start date and time and the completion date as process conditions. Under this planning condition, process planning process is executed, and each work process is combined according to the routing data to assemble the plan. At this time, work processes connected to each other are preferentially incorporated. . Considering the serial relationship between such connected work processes, the process plan is drafted, and when the process plan is made, the required work period is calculated, and the desired work period for which the required work period is given as the planning condition is calculated. Determine if it meets. If the desired work schedule is satisfied, the process plan ends as a processing result. If the desired work schedule is not satisfied, a bottleneck detection process is performed to detect work processes that can be parallelized for a long time. To do. Next, among the detected work processes that can be performed in parallel, the work process that requires a lot of work (that is, the time-consuming process) is selected preferentially, the workforce is added, and the amount of parallel work is increased. Shorten. However, even if the number of input workers is increased, the amount of work does not normally increase in proportion to the number of workers, and the efficiency decreases due to interference. Therefore, it is necessary to correct the yield by multiplying the loss rate. In addition, the actual value of the step is made variable.

The following [Table 1] shows the loss rates when the number of workers is increased from one to two and three under different working conditions. Note that the value of the loss rate varies depending on the work conditions such as the number of rooms and the area (m ² ) of the work place, so an optimum value is set.

作業の並行化は、同一種の作業の人員増による並行化ばかりでなく、前後に順序を変更できる作業を前あるいは後にずらすことによって、他の種類の作業との並行化を図ることができる。前後に順序を変更できる作業には、前あるいは後の作業とは作業手順上無関係な作業や、前あるいは後の作業の作業者の専門性とは異なる専門性を持つ作業者の行う作業、あるいは熟練不要の作業で作業者を投入しやすい作業などがある。このような並行化により隘路の作業を効率化する工順修正提案を作成して工程計画を修正し、希望工期が満たされるようにする。

The parallelization of work is not limited to parallelization by increasing the number of people of the same type of work, but parallelism with other types of work can be achieved by shifting the work whose order can be changed forward or backward. Work that can be reordered back and forth includes work that is irrelevant to the work procedure of the previous or subsequent work, work performed by an operator with expertise different from that of the previous or subsequent work, or There are tasks that are easy to throw in workers without requiring skills. Such a parallelization creates a routing correction proposal that makes the Kushiro work more efficient and corrects the process plan so that the desired schedule is satisfied.

  The work period is obtained by integrating the time required for each work process. If the accumulated work period exceeds the desired work period, the problem process is detected by the above-described Kushiro detection, and the work period is paralleled or replaced before and after the process by introducing personnel to shorten the work period.

It is a conceptual diagram of the process plan preparation processing apparatus by this invention. It is explanatory drawing of the correction proposal preparation example by a Kushiro detection and work parallelization (personnel increase). It is explanatory drawing of the correction proposal preparation example by a Kushiro detection and process parallelization. It is function explanatory drawing of 1 Example of a process plan preparation processing apparatus. FIG. 3 is a first explanatory diagram illustrating the structure of a data file. FIG. 6 is a second diagram illustrating the structure of a data file. It is a hardware block diagram of one Example of a process plan preparation processing apparatus. It is explanatory drawing of a work process sequence.

Explanation of symbols

1: Process data storage unit 2: Process data 3: Route data storage unit 4: Route data 5: Process plan processing unit 6: Process plan data 7: Kushiro detection processing unit 8: Kushiro data 9: Correction proposal creation processing Part 10: Route correction proposal data 11: Route data update processing part

Claims (7)

It is a process plan creation processing device that can formulate a process plan, detect a bottleneck in the drafted process plan and create a correction proposal,
Store in the storage device with attribute information about whether or not the work of each process can be performed in parallel with the routing data of each process that is the basis of process planning, and whether or not replacement is possible before and after in the sequence A routing data storage unit,
When a bottleneck is detected in the drafted process plan, a correction proposal is created by referring to the attribute information of the above routing data so that the process can be parallelized or the process can be replaced before and after. A correction proposal creation processing unit,
A process plan creation processing apparatus, wherein the process plan is corrected by updating the process data in the process data storage unit based on the correction proposal. A process data storage unit that stores process data for managing information on work and resources of individual processes that are elements of process planning;
For each process of the process data, sequence information related to the process within a predetermined construction unit, parallel work attribute information that makes it possible to identify whether the work of the process can be performed in parallel, and the process in the sequence A routing data storage unit that stores routing data for managing the order replacement attribute information that makes it possible to identify whether or not the order can be replaced;
Based on the input of process plan planning conditions such as the desired work period and work personnel, the process plan planning processing unit that creates the process plan data by formulating the process plan by combining the above routing data,
Analyze the created process plan data and refer to the parallel work attribute information or the order change attribute information of the above routing data for the bottleneck detection processing unit that detects the part that becomes the bottleneck and the bottleneck of the detected process plan. A correction proposal creation processing unit that creates a correction proposal that relaxes the bottleneck by parallelizing the work of processes that can be performed in parallel or by changing the order of processes that can be changed in order;
A process plan creation processing apparatus characterized by comprising:   3. The route code includes, as sequence information, at least a process code of the process, information of a trigger process for starting the sequence, and information of processes before and after the process in the sequence. The process plan creation processing device described in 1.   3. The process according to claim 2, wherein when the correction proposal creation processing unit converts a process capable of performing parallel work into parallel work, a process having a low skill level of the required work is preferentially selected. Plan creation processing device.   3. The process plan creation according to claim 2, wherein when the process plan is drafted, if there are a plurality of processes that are connected, the process plan is created by preferentially selecting them. Processing equipment.   The correction proposal creation processing unit, when selecting a process capable of parallel work and converting it to parallel work, corrects by multiplying the degree of increase in work efficiency by a loss rate accompanying an increase in work personnel. The process plan creation processing apparatus according to any one of claims 2 to 5. A process plan drafting processing means for drafting a process plan using routing data having attribute information on whether or not the work of the process can be performed in parallel and whether or not replacement can be performed before and after in the sequence;
A bottleneck detection processing means for detecting a bottleneck in the planned process plan;
Correction proposal creation processing for creating a correction proposal for the detected Kushiro, referring to the attribute information of the above-mentioned routing data, and performing the parallelization of the process in which the work can be performed in parallel or the replacement of the process capable of being replaced before and after Means,
Routing data update processing means for updating routing data based on the correction proposal;
A process plan creation processing program characterized by comprising:

Images