JP2011107906A - Process management system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To specify only a task necessary for implementation when occurrence of a re-implementation task, and to rapidly calculate the number of delay days by the re-implementation. <P>SOLUTION: A dependency relation information DB 12 of a process management system 10 stores a dependency relation information table indicating precedence/configuration relation between tasks necessary for the implementation of a project, and a control part 15 extracts a task that is a start point from the dependency relation information table, and extracts only a task following the task that is the start point for the purpose of the re-implementation. A plan/results information DB 13 stores a plan/results information table indicating plan information and results information of each task of the project, and implementation plans of the task that is the start point and the following task are prepared based on the plan/results information table. The number of the delay days of an implementation schedule of the project thereby is calculated from the implementation plans. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to a process management system in which project managers, members of a project management office, and the like can grasp the progress of work in project progress management.

  Generally, in a project, a work breakdown structure (WBS) is created in order to prevent omissions and omissions of work items (hereinafter referred to as tasks) and to share them among project members. The project manager manages the progress of tasks defined to comply with the plan as the project progresses. For example, the project manager grasps the progress of each task, and if the task is expected to be completed as expected, the project manager takes a quiet look at the progress, and if a delay is expected to finish, consider the countermeasures. Execute.

  In order to support such progress management, project management tools (such as MS Project developed by Microsoft) have a function to maintain the degree of progress registered for tasks and the degree of progress of subordinate tasks in the WBS. It has a function to roll up and calculate the progress of the upper task, and a function to clearly indicate a task delayed by a lightning line (for example, see Non-Patent Document 1).

  In particular, for projects that repeat the partial construction for software development projects and complete the entire project little by little, there is a “required definition of requirements” such as XP (eXtream Programming) and UP (Uniflied Process). There is known a method of developing a development plan assuming a repetitive process that repeats a task of “design one implementation → evaluation” and managing progress (for example, see Patent Document 1).

Machiko Uchinata “Microsoft Office Project 2007 at a glance” published by Nikkei BP Soft Press (2007/03) JP 2006-338309 A

  In the upstream process of a project (for example, business planning, product planning, etc.), due to changes in the external environment (for example, changes in customer needs or competitive trends), the need to re-execute tasks performed for this project plan Will occur. However, since it is very difficult to grasp such changes in the external environment in advance, at the project planning stage, it is not possible to specify a task that needs to be re-executed and the number of occurrences of re-execution of such a task.

  The technique described in Patent Document 1 shown as an example of the prior art relating to the re-execution of a task assumes a planned re-execution of a task. In the project planning stage, a task group of a task that is the starting point of re-execution and a task that succeeds the task is held as a set, and the set is inserted into the initial plan when necessary. However, this cannot be applied to a task in which a task that is the starting point of re-execution cannot be specified in advance.

  Further, in the above non-patent document 1 shown as another example of the prior art, if a task that is the starting point of re-execution is designated by preliminarily storing information on the preceding / successor task for each task, Subsequent tasks can be extracted. However, the more tasks that become the starting point of re-execution, the more successor tasks become, and there is a possibility that unnecessary tasks are extracted together. As a result, the execution period of the project is extended by the occurrence of the re-execution task, and the completion is delayed, but the delay schedule (how many days are delayed) cannot be accurately grasped.

  In order to create a final product within a limited period of time, the project manager must identify only the tasks necessary for implementation when the re-execution of the task occurs, and further determine the number of days delayed due to the re-execution. It is necessary to grasp and take measures early.

  The present invention has been made in view of such points, and its purpose is to specify only the tasks necessary for implementation when a re-execution task occurs, and to quickly calculate the number of days delayed due to re-execution. An object of the present invention is to provide a process management system.

  In order to achieve the above object, the present invention is a process management system that manages tasks based on information on project tasks, and acquires information on dependency relationships between tasks and information on plan / actual results of tasks, A re-execution task consisting of a task that is the starting point of re-execution and a successor task is provided with a re-execution task extracting means that extracts the task that becomes the starting point of re-execution and extracts only the task that succeeds the task that becomes the starting point. Is extracted.

  Further, according to the present invention, the dependency relationship between the tasks described above is dependent on the dependency-destination task with respect to the dependency-destination task, with the task as the dependency-source task and the task other than the dependency-source task as the dependency-destination task The re-execution task extraction means includes re-execution including dependency relationship information indicating that the relationship is any one of “preceding”, “no change effect due to successor and re-execution”, and “change effect due to successor and re-execution”. Only a task having dependency information “successive and subject to change due to re-execution” is extracted as a successor task that is the starting point of the above.

  In order to achieve the above object, the present invention provides a process management system for managing tasks using information on dependency relationships between tasks and plan / actual information of tasks as project task information. A re-execution flag is set for the task that is the starting point of re-execution in the plan / actual information, and the re-execution flag setting unit that sets the task as the re-execution starting task, information on the dependency between tasks, and the plan / actual result of the task Re-execution task extraction means to extract only the task that succeeds to the starting task as well as the task that is the starting point of the re-execution, and information on the re-execution task plan / actual result To calculate the re-execution days of the re-execution task and use the information on the dependency relationship between the re-execution tasks and the re-execution days to start / end the re-execution task To calculate the field schedule, is characterized in that a re-planning unit for calculating a delay number of days from the initial plan.

  Further, according to the present invention, the dependency relationship between the tasks described above is dependent on the dependency-destination task with respect to the dependency-destination task, with the task as the dependency-source task and the task other than the dependency-source task as the dependency-destination task. The re-execution task extraction means includes re-execution including dependency relationship information indicating that the relationship is any one of “preceding”, “no change effect due to successor and re-execution”, and “change effect due to successor and re-execution”. Only a task having dependency information “successive and subject to change due to re-execution” is extracted as a successor task that is the starting point of the above.

  In addition, according to the present invention, the re-plan creation unit creates and displays a line table indicating the schedule and actual schedule of each task in the initial plan, and creates a line table indicating the schedule of the re-execution task. In addition, a line table showing the schedule of the initial plan by all tasks is created and displayed, and a line table showing the schedule of the plan by the re-execution task is created and continued from the line table showing the schedule of the original plan It is characterized by being displayed.

  According to the present invention, in a project in which re-execution tasks frequently occur due to changes in the external environment, it is possible to extract only necessary tasks and automatically update the project plan. It is possible to quickly predict the number of days delayed from.

1 is an overall configuration diagram showing an embodiment of a process management system according to the present invention. It is a figure which shows the function of the process management system in the process management server computer in FIG. 3 is a flowchart showing a specific example of a series of processing operations performed in the process management system shown in FIGS. 1 and 2. 4 is a flowchart showing a specific example of a re-execution flag setting process in step S101 in FIG. 3 by the re-execution flag setting unit in FIG. It is a figure which shows one specific example of the data table (plan / actual information table) of each task stored in the plan / actual information DB in FIG. It is a figure which shows one specific example of a re-execution task list. 4 is a flowchart showing a specific example of re-execution task extraction processing in step S102 in FIG. 3 by the re-execution task extraction processing unit 17 in FIG. It is a figure which shows one specific example of the data table (dependency relationship information table) of each task stored in dependency relationship information DB in FIG. FIG. 4 is a flowchart showing a specific example of a re-planning process in step S103 in FIG. 3 by the re-execution task extraction processing unit in FIG. It is a figure which shows one specific example of the line table produced by step S410, S411 of FIG.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  FIG. 1 is an overall configuration diagram showing an embodiment of a process management system according to the present invention, wherein 1 is a process management server computer, 2 is a central processing unit, 3 is a main storage unit, 4 is an auxiliary storage unit, and 5 is an input unit. An output device, 6 is a communication device, 7 is a network, and 8 is a user computer.

  In the figure, the process management system has a configuration in which a user computer 8 used by one or more users is connected to a process management server computer 1 via a wired or wireless network 7.

  The process management server computer 1 is a server computer that manages the process management system, and includes a central processing unit 2, a main storage device 3, an auxiliary storage device (database) 4, an input / output device 5 for inputting / outputting various data, and a network. 7 has a communication device 6 that communicates with the user computer 8 via the computer 7.

  The auxiliary storage device 4 of the process management server computer 1 stores files, data, programs and the like necessary for process management.

  When there is an instruction to start the process management program, the main storage device 3 reads out and stores the process management program from the auxiliary storage device 4, and the central processing unit 2 stores the process management program stored in the main storage device 3. Execute.

  The user computer 8 is a terminal used by a user, and includes a central processing unit, a main storage device, an auxiliary storage device, an input / output device, a display device, a communication device, and the like.

  The user of the process management system accesses the process management server computer 1 from the user computer 8 through the network 7 to acquire and display information on the project status, view the information, create a task related to the project, plan the task, and record the results. The process management system is used by setting input and re-execution tasks. Also, by using the process management system function of this embodiment, you can view tasks that are delayed in the project, tasks that are being re-executed, schedule after re-planning due to the occurrence of re-execution tasks, etc. You can also.

  FIG. 2 is a diagram showing functions of the process management system of this embodiment by the process management server computer 1 in FIG. 1, wherein 10 is a process management system, 11 is a re-execution task determination unit, and 12 is a dependency relationship information DB (database). ), 13 is a plan / actual information DB, 14 is a control unit, 15 is an input / output unit, 16 is a re-execution flag setting unit, 17 is a re-execution task extraction unit, and 18 is a re-planning creation unit.

  In the figure, the process management system 10 includes a re-execution task determination unit 11, a dependency relationship information DB 12, a plan / result information DB 13, a control unit 14, and an input / output unit 15. 1 corresponds to the central processing unit 2 in FIG. 1, the dependency relationship information DB 12 and the plan / result information DB 13 correspond to the main storage device 3 and the auxiliary storage device 3 in FIG. This corresponds to the input / output device 5 and the communication device 6 in FIG.

  The re-execution task determination unit 11 includes a re-execution flag setting unit 16, a re-execution task extraction unit 17, and a re-plan creation unit 18. Under the control of the control unit 14, the dependency relationship information DB 12 and the plan / All the tasks to be re-executed are detected using the information with the performance information DB 13, and the schedule after the re-planning due to the occurrence of the re-execution task is created. The input / output unit 15 inputs a new task, adds result information, gives an instruction for re-implementing the project, and outputs the re-plan generated by the re-execution task determination unit 11 to the user computer 8 (FIG. 1). Do.

  Next, the operation of the process management system of this embodiment will be described.

  FIG. 3 is a flowchart showing a specific example of a series of processing operations performed in the process management system shown in FIGS.

  In the figure, in step S301, a user (such as a project manager or a member of a project management office) accesses the process management system server computer 1 from the user computer 8 via the network 7 to obtain information related to the project status. The information is displayed on the user computer 8. Thereby, the re-execution process starts (step S100).

  When the user designates a task to be re-executed from this information displayed on the display device of the user computer 8, the process management system 10 uses the re-execution flag setting unit 16 in the re-execution task determination unit 11 to specify this. A re-execution flag setting process is performed for setting a flag as a task that is the starting point of re-execution for the task that has been executed (step S101).

  Next, the re-execution task extraction unit 17 in the re-execution task determination unit 11 extracts all the tasks necessary for re-execution, starting from the task for which the re-execution flag is set by the re-execution flag setting process. The re-execution task extraction process is performed (step S102), and the re-execution task extraction unit 18 of the re-execution task determination unit 11 starts / ends the re-execution task extracted by the re-execution task extraction process after the re-plan. A re-planning process for calculating a schedule and a forecast delay schedule for the initial plan and creating a re-plan is performed (step S103).

  Then, the re-planning information created by this re-planning processing is output from the input / output unit 15 and provided to the user computer 8 (step S104), and the series of processing operations ends.

  Next, the processing of steps S101 to S103 in FIG. 3 will be specifically described.

  FIG. 4 is a flowchart showing a specific example of the re-execution flag setting process in step S101 in FIG. 3 by the re-execution flag setting unit 16 in FIG.

  In the same figure, for example, by receiving market changes, it is necessary to modify and re-implement each task that constitutes a project starting from the corresponding predetermined task according to this market change. When the user makes a request for re-execution of the project at the user computer 8, in response to this request, the process management server computer 1 registers the control unit 14 (FIG. 2) from the plan / result DB 13 (FIG. 2). All the task data (task ID (identifier) and task name) is read, and a list (task list) is created and provided to the user computer 8 that requested it. In this user computer 8, this task list is displayed on the display screen, and the user can designate a task as a starting point of re-execution of this project from this task list. Therefore, when the user designates a task to be re-executed in the task list, the designation information is sent to the process management server computer 1 and re-execution processing is started (step S200).

  In the process management server computer 1, when this designation information is received from the input unit 15 (FIG. 2), the plan / result information DB 13 is searched under the control of the control unit 14, and the status of the task for which the user has been designated for re-execution (Current situation) is confirmed (step S201).

  5A and 5B are diagrams showing a specific example of the data table (plan / actual information table) of each task registered in the plan / actual information DB 13 in FIG. / Result information table, 21 is WBSID, 22 is task ID, 23 is task name, 24 is re-execution flag, 25 is start date (plan), 26 is end date (plan), 27 is start date (actual), 28 Is the end date (actual). Note that FIG. 5B will be described later.

  In FIG. 5A, in the plan / actual information table 20, for each registered (ie, implemented) tag, WBSID 21, task ID 22, task name 23, start date (plan) 25, end date (plan) ) 26, start date (actual) 27, end date (actual) 28 are registered, and a re-execution flag 24 is added to a task for which re-execution is designated. Here, WBSID 21 is an ID of a task in the project, and task ID 22 is an ID unique to the task.

  As described above, if, for example, a task D with WBSID 21 = “4” is designated as a re-execution task by the user in the task list, the control unit 14 (FIG. 2) starts from the plan / result information DB 13 (FIG. 2). The plan / result information table 20 is read, the task D with the designated WBSID 21 = “4” is searched, and its status is confirmed (step S201).

  As confirmation of this status, is the completion date (actual) 28 of the task D with WBSID 21 = “4” designated to be re-executed read from the plan / actual information table 20 and the date is stored and the implementation has been completed? It is confirmed whether or not (step S202).

  Here, in the task D with WBSID21 = "4", the end date (actual result) 28 is registered as "4/8" ("YES" in step S202), but like the task C with WBSID21 = "3" If the end date (actual) 28 is blank, the start date (actual) 27 is read to check whether the date has been registered and started (actual) (step S203). . If both the start date (actual result) 27 and the end date (actual result) 28 are blank (“NO” in step S202 and “NO” in step S203), the corresponding task has not been started and is to be re-executed. It will not be. In this case, an error or the like is displayed (step S204), and the process ends (step S205). In other words, the task designated as the starting point for re-execution in this case cannot be the starting point, so the processing is terminated and the user is notified of this fact.

  When the end date (actual) 28 or the start date (actual) 27 is registered for the task designated as the re-execution start point ("YES" in either step S202 or S203), the re-execution is performed. A task list (empty output list) is prepared (step S206), and the WBSID 21 and task ID 22 of the task designated by the user are stored in the task list (step S207).

  6A to 6C are diagrams showing specific examples of the re-execution task list, in which 30 is the re-execution task list, 31 is the new WBSID, 32 is the number of re-execution days, and corresponds to FIG. The same reference numerals are assigned to the parts to be repeated, and the duplicate description is omitted.

  In this re-execution task list 30, the WBSID 21, task ID 22, task name 23, re-execution flag 24, new WBSID 31, re-execution date 32, etc. are registered in this re-execution task list 30. For the designated task (hereinafter referred to as task D), in step S207, as shown in the figure, WBSID 21 = "4", task ID 22 = "4" and task name of this task D 23 = “Task D” is registered.

  Then, for this task D designated as the starting point, the re-execution flag 24 is set to “1” in the re-execution task list 30 as shown in the figure (step S208). Thereby, the process of step S101 in FIG. 3 ends (step S209). At this time, the new WBSID 31 and the re-execution date 32 are not registered.

  FIG. 7 is a flowchart showing a specific example of the re-execution task extraction process in step S102 in FIG. 3 by the re-execution task extraction processing unit 17 in FIG.

  In the figure, when the re-execution flag setting process (step S102 in FIG. 3) shown in FIG. 4 ends, the process management server computer 1 starts this re-execution task extraction process (step S300).

  In this re-execution task extraction process, first, the task ID 32 stored in the re-execution task list 30 (FIG. 6A) created in the re-execution flag setting process of FIG. 4 is read. Here, the task ID 32 = “4” is read (step S301), and the task D having the task ID 32 = “4” is set as the re-execution start task, and the successor task of the start dependency task in the task dependency information DB 12 (FIG. 2). A task search is performed (step S302 in FIG. 7).

  FIG. 8 is a diagram showing a specific example of a data table (dependency relationship information table) of each task registered in the dependency relationship information DB 12 in FIG. 2, wherein 40 is a dependency relationship information table, 41 is a dependency relationship ID, 42 is a dependency source task ID, 43 is a dependency destination task ID, and 44 is a dependency flag.

  In the figure, a dependency relationship information table 40 defines the presence / absence of a predecessor / successor relationship between tasks, and includes tasks such as a dependency relationship ID 41, a dependency source task ID 42, a dependency destination task ID 43, and a dependency relationship flag 44. It consists of information related to dependencies. The successor task for the preceding task is extracted based on the dependency relationship information table 40. In this case, the succeeding task to be extracted is a task that succeeds the preceding task, and a task whose contents must be updated under the influence of updating the preceding task.

  That is, for each task that forms a project, when the task is a task with a dependency source task ID 42 in this project (hereinafter referred to as a dependency source task), other tasks are determined as dependency destination tasks (dependency destination tasks). ID43 task) as to whether the dependency destination task can be a successor task of the dependency source task, that is, whether the dependency source task and the dependency destination task are in a relationship between the preceding task and the successor task. First, the dependency destination task preceding the dependency source task cannot be a successor task of this dependency source task. That is, the dependency destination task preceding the dependency source task cannot be a re-execution task together with the dependency source task. The dependency flag 44 indicates “preceding” for the dependency destination task.

  In addition, if the task specified as the starting point for re-execution is changed due to changes in the market, etc., it is not affected by this change, that is, the dependency that does not need to be changed. For the original task, the dependency flag 44 represents “successor but no change effect due to re-execution of re-execution start task”. Such a dependency destination task does not need to be re-executed and cannot be a successor task to be re-executed.

  Now, regarding the tasks A to F shown in FIG. 5A, the dependency information table 40 shows the parts of the tasks D to F. When the task D is set as the dependency source task, the other tasks A ~ C and tasks E and F are dependent tasks, but the dependency relation of tasks A to C, E, and F with respect to the dependency source task D is defined by the dependency flag 44, and task E is set as the dependency source task. Sometimes, other tasks A to D and F become dependency destination tasks, but the dependency relationship of tasks A to D and F with respect to the dependency source task E is defined by the dependency flag 44, and task F is defined as the dependency source task. , The other tasks A to E become the dependency destination tasks, but the dependency relationship of the tasks A to E with respect to the dependency source task F is defined by the dependency flag 44.

  A dependency ID 41 is assigned to each dependency relationship between the dependency source task and the dependency destination task, a dependency source task ID 42 is assigned to each dependency source task, and a dependency destination task ID 43 is assigned to each dependency destination task. There are five dependency relationships regarding the task D: dependency relationship IDs 41 = “1”, “2”, “3”, “4”, “5” for the tasks A, B, C, E, and F. There are five dependency relationships regarding the task E, that is, dependency relationship IDs 41 = “6”, “7”, “8”, “9”, “10” for the tasks A, B, C, D, and F. The dependency relation regarding the task F has five dependency relations of the dependency relation ID 41 = “11”, “12”, “13”, “14”, “15” with respect to the tasks A, B, C, D, and E.

  As the dependency relationship flag 44, when the task of the dependency destination task ID 43 is in the “preceding” relationship above the task of the dependency source task ID 42, the dependency relationship flag 44 = “0” is set, and the dependency destination task When the task of ID 43 is the above-mentioned “successor but no change effect due to re-execution start task re-execution”, the dependency flag 44 = “1” and the task of the dependency destination task ID 43 are “successor, If there is a change effect due to re-execution of the re-execution start task (that is, the content needs to be changed), the dependency flag 44 = “2” is set. The task having the dependency destination task ID 43 with the dependency flag 44 = “0” or “1” is not a successor task of the task having the dependency source task ID 42.

  If a new task needs to be added to the existing project due to changes in the market or the like, a request for task addition from the user computer 8 (FIG. 1) will cause the process management server computer 1 (FIG. 1). In FIG. 2, this request is input from the input / output unit 15, and the control unit 14 reads the dependency relationship information table 40 (FIG. 8) from the dependency plan information DB 12 in response to this request, and receives the request from the input / output unit 15. Provided to the user computer 8. In this user computer 8, the dependency relationship information table 40 is displayed on a display device (not shown), and a new task is added to the dependency relationship information table 40 as a dependency source task of the dependency source task ID 42 by a user operation. Then, each task already stored is added as a dependency destination task of the dependency destination task ID 43 of this new task, and the dependency relationship between the dependency source task and the dependency destination task is added by the dependency relationship flag 44, and the dependency already exists. For each dependency source task stored in the original ID 42, the dependency flag 44 of the dependency destination task is added with the new task as the dependency destination task of the dependency destination ID 43.

  In this way, the dependency relationship information table 40 updated by adding a new task is transmitted from the user computer 8 to the process management server computer 1. In the process management server computer 1, in FIG. 2, the updated dependency relationship information table 40 is input from the input / output unit 15 and stored in the dependency relationship information DB 12 under the control of the control unit 14. As described above, the dependency relationship information table 40 of the dependency relationship information DB 12 is updated by adding a new task. Similarly, when deleting a predetermined task that is no longer necessary from the dependency relationship information table 40, it is performed by a processing operation on the user computer 8.

  In the re-execution task list 30 shown in FIG. 6A, the task D with the task ID 32 = “4” is stored as the re-execution start task. In the information table 40, a dependency relationship ID 41 is searched for the task D with the task ID 32 = “4” as the task of the dependency source task ID 42 (step S302). As a result of this search, five dependency relationships with dependency ID 41 = “1”, “2”, “3”, “4”, “5” are collected. That is, there are five tasks, task A, task B, task C, task E, and task F, searched for task D with task ID 32 = “4”.

  Then, for each of the retrieved dependency IDs 41 = “1”, “2”, “3”, “4”, “5”, it is determined whether or not the dependency flag 44 is “2” (step) In step S303, for the dependency ID 41 with the dependency flag 44 = “2” (“YES” in step S303 in FIG. 7), the WBSID 31, task ID 32, and task name 33 related to the task are added to the re-execution task list 30. Store (step S306 in FIG. 7).

  For the task D set as the re-execution start task in the re-execution task list 30 shown in FIG. 6A, in the dependency relation information table 40 shown in FIG. The IDs 41 are “4” and “5”, so that the tasks of the dependency destination task ID 43 are tasks E and F, and these tasks E and F are successor tasks to the starting task D.

  Further, the predecessor / successor relationships of these successor tasks E and F are also determined from the dependency relationship information table 40. That is, one of these successor tasks E and F, for example, the successor task E is set as the task of the dependency source task ID 42, and the other successor task F is set as the task of the dependency destination ID 43, so that these in the dependency relationship information table 40 shown in FIG. Reference is made to the dependency relationship of the task E and F dependency ID 41 = “10”. In this case, since the dependency relationship flag 44 of this dependency relationship is “2”, the successor task E may be a preceding task as a dependency source task, the successor task F may be a dependency destination task, and a successor task E. it can. Incidentally, assuming that the successor task F is the task of the dependency source task ID 42 and the other successor task E is the task of the dependency destination ID 43, the dependency relationship ID 41 of these tasks F and E in the dependency relationship information table 40 shown in FIG. Referring to the dependency relationship of “15”, since the dependency relationship flag 44 of the dependency relationship is “1”, the successor task F cannot be a preceding task, and the successor task E cannot be a successor task.

  In this way, it is determined that the task E becomes the successor task for the task A that is the starting point of the re-execution, and further, the task E becomes the successor task for the successor task E. Tasks E and F are stored in the re-execution task list 30.

  FIG. 6B shows the re-execution task list 30a in which the successor tasks E and F of the task D as a starting point for re-execution are registered in this way.

  In the re-execution task list 30a, first, based on the plan / actual information table 20 shown in FIG. 5A, the WBSIB 31 of the successor task E that is the starting point of re-execution is “5”, and the task ID 32 is As “5”, the task name 33 is stored as “task E”, respectively, then the WBSIB 31 of the successor task F of the successor task E is “6”, the task ID 32 is “3”, and the task name 33 is “task” F ”respectively.

  In this way, the successor tasks E and F of the task D as the re-execution rules are determined, and the configuration of the project starting from the task D is set in the resetting task list 30a.

  In the dependency relationship information table 40 shown in FIG. 8, when there is no task having the dependency flag 44 = “2” for the task D designated as the re-execution starting point (for example, in the dependency relationship information table 40). When the dependency relationship flag 44 is “0” or “1” for the tasks E and F of the dependency destination task ID 43 with respect to the task D of the dependency source task ID 42 (“NO” in step S303 in FIG. 7), A message such as “no effect of change due to re-execution” is displayed (step S304 in FIG. 7), and the process ends (step S305 in FIG. 7).

  Next, in FIG. 7, the extracted tasks to be re-executed are reflected in the plan / actual information table 20 in FIG. 5A for the tasks in the plan / actual information DB 13 (FIG. 2). That is, the task ID 32 and the task name 33 of the re-execution task list 30a (FIG. 6A) are transferred as the task ID 22 and the task name 23 to the plan / actual information table 20, respectively (step S307). In this case, the plan / actual information table 20 is transcribed from the last stored task. In the illustrated example, since WBSID = “21” is stored, the re-executed tasks D, E, and F are stored in that order following the task of WBSID = “21”.

  Next, the re-executed task in which the task ID 22 and the task name 23 are transferred to the plan / actual information table 20 as described above, here, the tasks D, E, and F are reflected in the plan / actual information. The new WBSID 21 of the execution task is set in the plan / result information table 20. In this case, for the re-executed tasks D, E, and F newly set in the plan / actual information table 20, from the next of the WBSID 21 of the task arranged last among the already set tasks. WBSID 21 is assigned. Therefore, when the WBSID 21 of the last task that has already been set is WBSID, the WBSID 21 of the task D that is the starting point of the re-executed tasks D, E, and F is set to “WBSID + 1” (step S308 in FIG. 7), and the successor task E and F are incremented by “1” from “WBSID + 1” (step S309 in FIG. 7).

  Therefore, in the plan / result information table 20 shown in FIG. 5A, since the last WBSID 21 = “21”, the WBSID 21 of the task D that is the starting point of the re-execution is “21” + 1 = “22”. The WBSID 21 of the next successor task E is “23”, and the WBSID 21 of the next successor task F is “24”.

  In this way, new WBSIDs 21 are sequentially set for the re-executed tasks (“NO” in step S309 in FIG. 7), and new WBSIDs are set for all the re-executed tasks (in step S309 in FIG. 7). “YES”) is repeated (step S710), and the re-execution task extraction process of step S102 of FIG. 3 is terminated (step S310 of FIG. 7).

  FIG. 6B is a diagram showing the re-execution task list 30b in which the new WBSID 31 is set as described above. In the re-execution task list 30b, such a new WBSID 31 is not set, but is shown in order to clarify the relationship with the WBSID 31 re-execution task. However, a new WBSID 31 is also set in the re-execution task list 30b. After setting this, the task ID 32 and the task name 33 are associated with the new WBSID 31 and the plan / actual result shown in FIG. The information table 20 may be transcribed (added).

  FIG. 5B is a diagram showing a specific example of the plan / actual information table 20a obtained as described above. The new WBSID 21 = “22”, “23”, “24” is re-executed. Task IDs 22 and task names 23 for tasks D, E, and F are newly set. However, the start date (plan) 25 and the end date (plan) 26 are not yet registered.

  FIG. 9 is a flowchart showing a specific example of the re-planning process in step S103 in FIG. 3 by the re-execution task extraction processing unit 17 in FIG.

  In the figure, when the re-execution task extraction process (step S103 in FIG. 3) shown in FIG. 7 ends, the process management server computer 1 starts the re-planning process in step S103 in FIG. 3 (step S400). ).

First, by the operation of the control unit 14 (FIG. 2), the plan / result information table 20b (FIG. 5B) is read from the plan / result information DB 13 (FIG. 2), and the re-execution task is read from the plan / result information table 20b. The status (current state) of the re-executed tasks D, E, and F stored in the list 30b (FIG. 6C) is confirmed (step S401). This confirmation of status is to confirm the status of the re-execution task D, E, F with respect to the previous plan in the re-execution task list 30b. In this plan / actual information table 20b, WBSID 21 = "4" ”,“ 5 ”,“ 6 ”tasks D, E, and F are subject to status confirmation. If these tasks D, E, and F have been completed (“YES” in step S402), the actual number of days, that is,
Actual days = end date (actual) 28-start date (actual) 27
Is stored in the re-execution days 36 of the re-execution task list 30b (FIG. 6C) (step S403).

  Here, according to the plan / actual information table 20b, the tasks D and E with WBSID = “4” and “5” are stored in the end date (actual) 28 and have been completed. It is obtained and stored in the re-execution days 36 of the re-execution task list 30b. For task D with WBSID = “4”, since the end date (actual) 28 = 4/8 and the start date (actual) 27 = 4/6, the actual number of days = “2” and the WBSID = “5”. For task E, since the end date (actual) 28 = 4/25 and the start date (actual) 27 = 4/9, the actual number of days = “16”.

By the way, for the task F with WBSID = “6”, the start date (actual result) 27 = 4/26 is stored, but the end date (actual result) 28 is not stored, and the implementation is in progress. (“NO” in step S402 in FIG. 9). In such a case, the process is once terminated (step S404), and the planned number of days, ie,
Planned days = End date (plan) 26-Start date (plan) 25
Is stored in the re-execution days 36 of the re-execution task list 30b (FIG. 6C) (step S405).

  Through the above processing, the re-execution days 36 are stored in the tasks D, E, and F in the re-execution task list 30b.

  Next, for the re-execution task for which the re-execution flag 34 is set in the re-execution task list 30b, that is, for the task D designated as the re-execution start point, the date when the execution flag 34 was set at that time The plan / execution information table 20a (FIG. 5 (b)) is set as the start date (plan) 25, and the start date (plan) 25 is set as the end date (plan) 26 from the re-execution task list 30b. Is stored in the column of task D with WBSID = “22” (step S406 in FIG. 9).

  For example, if the date when the re-execution flag 34 of the task D is set is 4/28, the start date (plan) 25 of the task D with the WBSID = “22” set with the re-execution flag 34 is set to “4 / 28 ”, the end date (plan) 26 is“ 4/30 ”(= the sum of the start date (plan) 26 (= 4/28) and the number of re-execution days 36 (= 2)), the plan / execution information table 20a. (FIG. 5B).

  Next, the start date (plan) 25 and the end date (plan) are set for the successor tasks E and F in which the re-execution flag 34 is not set in the re-execution task list 30b (FIG. 6C). First, the dependency relationship information table 40 (FIG. 8) of the re-execution task for which the re-execution flag 34 is not set is read from the dependency relationship information DB 12 (FIG. 2). It is confirmed whether or not there is a plurality (step S407 in FIG. 9).

  Here, for the successor task that is only the task D and there are not a plurality of successor tasks like the successor task E ("NO" in step S407 in FIG. 9), the re-execution of the successor task E is started. The date (plan) 25 is set to the date of “end date (plan) 26 + 1 of the preceding task”, and the end date (plan) 26 is set to the start date (plan) 25 and the re-execution task list 30b (FIG. 6 ( b)) is set by adding the number of re-execution days set in 36, and stored in the column of task E of WBSID = “23” in the plan / execution information table 20a (FIG. 5B) (FIG. 9). Step S409).

  That is, since the preceding task of task E with WBSID = “23” is only task D with WBSID = “22”, the start date (plan) 25 of this task E is the end date (plan) 26 of task D. It is “5/1” obtained by adding one day to “4/30”, and the end date (plan) 26 of this task E is the re-execution task list 30b (FIG. 6C). The number of re-execution days at 36 = “5/17” including “16”.

  Also, like the successor task F, the preceding tasks are tasks D and E, and there are a plurality of succeeding tasks (“YES” in step S407 in FIG. 9), the dependency relationship information table 40 between the preceding tasks ( FIG. 8) is read from the dependency information DB 12 (FIG. 2), and the dependency flag 44 is “2” when the continuation task F is set as the dependency destination task ID 43. The dependent task having the relationship “Yes” is selected as the preceding task (step S408 in FIG. 9). Here, the preceding task of task F with WBSID = “24” is task D with WBSID = “22” and task E with WBSID = “23” according to the dependency relationship information table 40 (FIG. 8). Since E is a successor task of task D, task E is selected as the preceding task of task F.

  Then, the start date (plan) 25 of the re-execution of the successor task F is set to the date of the “previous task end date (plan) 26 + 1”, and the end date (plan) 26 is set as the start date (plan). 25, the date obtained by adding the number of re-execution days 36 set in the re-execution task list 30b (FIG. 6B) is set, and WBSID = “23” in the plan / execution information table 20a (FIG. 5B). Is stored in the column of task E (step S409 in FIG. 9).

  That is, since the preceding task of task F with WBSID = “24” is task E with WBSID = “23”, the start date (plan) 25 of this task F is the end date (plan) 26 of task E. “5/18” is one day plus “5/18”, and the end date (plan) 26 of this task F is “5/18” in the re-executed task list 30b (FIG. 6C). The number of re-execution days 36 = “5/26” including “8”.

  In this way, the start date (plan) 25 and the end date (plan) 26 of the re-execution tasks D, E, and F are set in the plan / execution information table 20a (FIG. 5B). Become. In the plan / execution information DB 13 (FIG. 2), the contents of the plan / execution information table 20 (FIG. 5A) are updated to the contents of the plan / execution information table 20a.

  Next, based on the plan / execution information table 20a, an execution schedule for the re-execution task is created (step S410 in FIG. 9), and the entire schedule of the project including the re-execution plan is rolled up, A line table is created (step S411 in FIG. 9). The created line table is transmitted to the user computer 8 (FIG. 1), the re-planning process is completed (step S412 in FIG. 9), and this line table is displayed on the display of the user computer 8.

  FIG. 10 is a diagram showing a specific example of a line table, in which 50 is a line table, 51 is a task name, 52 is a re-execution flag, 53 is a schedule, 54 is a current mark, 55 is a planned schedule, and 56 is a delay schedule. , 57 is the entire project, 58 is an execution task, 59 is a re-execution task, 60 is an executed part, and 61 is an unexecuted part.

  In the figure, in the line table 50, an entire project 57, an execution task (here, tasks A to F) 58 already planned and executed, and a re-execution task (here, tasks D to F) 59 are shown. A task name 51 is displayed, and a schedule 53 to be executed for each of them is displayed. In addition, a re-execution flag 52 is set for the task designated as the re-execution start point (in this case, task D).

  The schedule 53 of the entire project 57 includes the planned schedule 55 and the re-execution task 62 which are already planned and executed before the re-execution by the re-execution task 59 is set (that is, the original plan). For example, the schedule schedule 55 is displayed in white and the delay schedule 56 is filled in, so that each can be clearly distinguished.

  For the schedule 53 of the execution task 58, the executed portion 60 (here, the task B of the execution task 58 is shown, but the same applies to the other tasks) is displayed in a solid color and has not been executed yet. That is, the unexecuted portion 61 (here, the task B of the implementation task 58 is shown, but the same applies to other tasks) is shown in white so that these can be clearly distinguished.

  Hereinafter, each task of the implementation task 58 is referred to as implementation tasks A to F, and when these are collectively referred to, they are referred to as implementation tasks 58. Further, the re-execution task 59 is referred to as each of the task re-execution tasks D to F, and these are collectively referred to as the re-execution task 59.

  The schedule 53 is set based on the plan / actual information table 20a shown in FIG. 5B. According to this, the schedule / actual information table 20a is designated as the re-execution starting point. Since the start date (plan) 25 = “4/28” of the task D thus performed is the current time, the current time mark 54 indicates the current “4/28” in the line table 50.

  Therefore, according to the plan / actual information table 20a (FIG. 5B), in the case of the implementation task A, the start date (actual) 27 = “4/1” and the end date (actual) = “4/5”. In both cases, since the current mark 54 = “4/28” and before, the schedule 53 is displayed only in the painted portion 60. The same applies to the implementation tasks D and E.

  In the case of the implementation task B, the start date (actual) 27 = “4/9” and the current mark 54 = “4/28” or earlier, but the end date (plan) = “4/30”. Thus, the current mark 54 = “4/28” or later, which has already been carried out but has not been completed. Therefore, in the line table 50, the schedule 53 is the start date (actual) 27 = “ From “4/9” to the current mark 54 = “4/28” are displayed in the filled portion 60, and from the current mark 54 = “4/28” to the end date (plan) = “4/30” It will be displayed in the white unexecuted portion 61. The same applies to the implementation tasks C and F.

  Here, the end of the planned schedule 55 of the entire project 57, that is, the end date, is the date on which the end date (plan) 26 is the latest among the execution tasks 58, and the plan / actual information table 20a (FIG. 5B). In the example shown in (), the end date (plan) of the execution task C = “5/10”. Therefore, the end date of the planned schedule 55 of the entire project 57 is “5/10”.

  When the re-execution task 59 is set, this re-execution plan will re-implement the project from task D to the successor task F, which is the starting point of this re-execution. This is the end date (plan) 27 of the succeeding task F to be executed last. The end date (plan) 27 of the successor task F is “5/26” from the plan / result information table 20a shown in FIG. 5B, and this end date (plan) 27 = “5/26” is Since the end date of the planned schedule 55 of the entire project 57 is after “5/10”, the end date of the planned schedule 55 of the entire project 57 is delayed from “5/10” to “5/26”. become. Accordingly, the delay schedule 56 of the schedule 53 of the entire project 57 is “5/26” − “5/10” = 16 days. The delay schedule 56 in the line table 50 represents this number of days.

  According to this line table 50, in the initial plan of the project, the end date of task C was expected to be the entire task and the end date of this project. However, new tasks D, E, F is necessary to be re-executed, and the end date of task F (re-execution) is changed to the end date of the entire project 57, and it is highly likely that the end of the entire project 57 is delayed.

  In addition, when the re-execution tasks D, E, and F are displayed in the line table 50 in this way, the contents of the task D that is the starting point of the re-execution are changed due to the re-execution, such as changes in the market. The correction is changed according to the factor, and the contents of the successor tasks E and F are corrected according to the correction change. As a result, these re-executions can be performed.

  As described above, in this embodiment, the project manager and the project management office members can be re-executed by automatically displaying the necessary re-execution task and the schedule after the re-planning by re-execution of the task in progress of the project. The execution instruction for the execution task can be performed quickly, and the delay schedule due to the re-execution task can be easily grasped.

DESCRIPTION OF SYMBOLS 1 Process management server computer 2 Central processing unit 3 Main storage device 4 Auxiliary storage device 5 Input / output device 6 Communication device 7 Network 8 User computer 10 Process management system 11 Re-execution task determination part 12 Dependency information DB
13 plan / actual information DB
14 control unit 15 input / output unit 16 re-execution flag setting unit 17 re-execution task extraction unit 18 re-plan creation unit 20, 20a plan / actual information table 21 WBSID
22 Task ID
23 Task name 24 Re-execution flag 25 Start date (plan)
26 End date (plan)
27 Start date (actual)
28 End date (actual)
30, 30a, 30b Re-execution task list 31 New WBSID
32 Re-execution days 40 Dependency information table 41 Dependency ID
42 Dependent task ID
43 Dependent task ID
44 Dependency Flag 50 Line Table 51 Task Name 52 Re-execution Flag 53 Schedule 54 Current Mark 55 Planned Schedule 56 Delayed Schedule 57 Entire Project 58 Implemented Task 59 Re-implemented Task 60 Implemented Part 61 Unimplemented Part

Claims (5)

A process management system that manages tasks based on information about project tasks,
The information on the dependency relation between the tasks and the information on the plan / actual result of the task are acquired, the task that is the starting point of re-execution is extracted, and only the task that succeeds the task that is the starting point is extracted. Having execution task extraction means;
A process management system characterized by extracting a re-execution task consisting only of the task as a starting point of re-execution and its successor task. The information regarding the dependency relationship between the tasks according to claim 1, wherein for each task, the task is a dependency source task, and the task other than the dependency source task is a dependency destination task. Including dependency information indicating that the dependency of the previous task is one of “preceding”, “no effect of change due to successor and re-execution”, and “no effect of change due to successor and re-execution”;
The re-execution task extraction means extracts only the task having the dependency relationship information of “subsequent and re-execution has a change effect” as the successor task of the re-execution starting point. Management system. A process management system that manages tasks using information on dependency relationships between tasks and task plan / actual information as project task information,
A re-execution flag setting unit that sets a re-execution flag to a task that is a starting point of re-execution in the plan / actual information of the task,
The information on the dependency relationship between the tasks and the information on the plan / actual result of the task are acquired, and only the task succeeding the task that is the starting point together with the task that is the starting point of the re-execution, Re-execution task extraction means for extracting;
The re-execution task plan / actual result information is used to calculate the re-execution task re-execution days, and the re-execution task start / end dates are calculated using the dependency relationship between the re-execution tasks and the re-execution days. A process management system, comprising: a re-planning section that calculates a schedule for the first schedule and calculates the number of days delayed from the initial plan. The information on the dependency relationship between the tasks according to claim 3, wherein for each task, the task is set as a dependency source task, and the task other than the dependency source task is set as a dependency destination task. Including dependency information indicating that the dependency of the previous task is one of “preceding”, “no effect of change due to successor and re-execution”, and “no effect of change due to successor and re-execution”;
The re-execution task extraction means extracts only the task having the dependency relationship information of “subsequent and re-execution has a change effect” as the successor task of the re-execution starting point. Management system. In claim 3 or 4,
The re-planning section
In addition to creating and displaying a schedule showing the schedule and actual schedule of each task in the initial plan, creating and displaying a schedule showing the schedule of the re-execution task,
In addition, a line table indicating the schedule of the initial plan by all the tasks is created and displayed, and a line table indicating the schedule of the plan by the re-execution task is created and displayed on the line table indicating the schedule of the initial plan. A process management system characterized by continuous display.

Images