KR100811538B1 - Method for computer based schedule management - Google Patents

Abstract

A method for managing a schedule using a computer is provided to make whole schedule efficiently by enabling a user to easily create activity, which represents a detail schedule, for managing the schedule and analyzing the schedule based on the activities. A schedule management program of a computer outputs a schedule management window for creating activity to a screen(S31). The schedule management program creates and displays a plurality of activities on the schedule management window by storing individual period information specifying a period corresponding to a dragged region when a user drags a mouse on the schedule management window(S33). The schedule management program enables the user to set a link among the activities displayed on the schedule management window with the mouse and manages the link by storing link information as activity information(S35). The schedule management program creates whole schedule by analyzing and interconnecting the activities displayed on the schedule management window, and outputs whole schedule to the schedule management window when a schedule analysis program is executed(S37). The individual period information includes an activity ID code and period information corresponding to the dragged region.

Description

Schedule management method using computer device {Method for Computer Based Schedule Management}

1 is an example of a configuration of a computer device,

2 is an example for describing an activity;

3 is an embodiment of a schedule management method according to the present invention;

4 is an embodiment of a schedule management window,

5 illustrates an example of dragging a mouse to generate an activity;

6 shows an example in which a generated activity is displayed on a screen;

7 shows an example of creating multiple activities in one row;

8 to 10 are examples for explaining the type of connection between activities,

11 and 12 are examples of how to specify a connection between activities,

13 is an example of a process of generating an entire schedule by analyzing an activity;

14 is an example for explaining a method for analyzing a main process path;

15 and 16 are yet another embodiment of a method for analyzing a main process path;

17 is an example of a screen before a schedule analysis command;

18 is an example of a screen after a schedule analysis command is issued.

* Explanation of symbols for main parts of the drawings

11: Computer Device 11-1: Calendar Program

21: control unit 22: ROM

23: RAM 24: storage

25-1: Keyboard 25-2: Keyboard Interface

26-1: Mouse 26-2: Mouse Interface

27: screen processor 28: display screen

29: communication unit 40: schedule management window

101,102: Activity 81,82: Display connection type

The present invention relates to a schedule management method using a computer device, and in particular, a user can easily create an activity representing a detailed schedule using a computer device and analyze the schedule through each of the individually generated activities, The present invention relates to a method for conveniently managing an entire schedule (or process) displayed by a furnace or the like.

Various groups, such as individuals and corporations, manage the entire schedule in individual periods each including detailed schedules.

As a specific example, the overall process in the construction or shipbuilding field is composed of many detailed schedule processes, and it is very important to accurately and efficiently establish and manage not only individual processes but the entire processes. To this end, attempts have been made to manage the detailed schedules and overall processes using computer programs.

In order to establish the entire schedule, individual time periods for each detailed work should be set. The individual work as a management unit is referred to as 'activity' in the related industry and will be described below using this term. . That is, the following 'activity' may be recognized as a visual period display displayed on a screen by a user who manages a schedule by using a computer, but specifically means any information for displaying and managing a corresponding job.

The procedure for creating and managing these activities is one of the most basic procedures for computer-based scheduling. In addition, since activities can increase greatly as the complexity of the entire schedule increases, how efficiently the activities can be processed becomes a key to determining the efficiency of the schedule management process.

Therefore, the present invention has been devised to meet the above needs, and makes it possible to easily and simply generate activities for schedule management, and also to analyze the generated activity bits to efficiently generate the entire schedule. The purpose is to provide a schedule management method using a computer device.

In order to achieve the above object, a schedule management method using a computer device according to the present invention, the step of outputting a schedule management window for generating an activity on the screen of the computer device; When the mouse is dragged from the schedule management window, an activity is generated by storing information (individual period information) for specifying a period corresponding to the dragged area, and generating the activity and displaying the generated activity on the schedule management window. Enabling to create an activity of; Allowing a connection relationship of activities displayed on the schedule management window to be specified by using the mouse, and storing and managing connection relationship information indicating the connection relationship as corresponding activity information; And when a schedule analysis command is input, analyzing each activity information generated in the schedule management window to connect the activities to each other to generate the entire schedule and output the generated schedule to the schedule management window. It is configured to include.

The individual period information may be configured to include at least an activity identification code that uniquely identifies the generated activity and period information corresponding to the area to which the mouse is dragged.

The activity identification code may be designated as a default, and then configured to be changed according to a user's selection.

A portion of the period information may be configured to allow a user to be set not to be included in the work day, and a portion set to not be included in the work day may be configured to be subtracted from the period information.

The selecting of the activity to designate the connection relationship may be configured by using the mouse to sequentially select the preceding preceding activity and the following trailing activity in sequence.

In this case, selecting the activity to designate the connection relationship is performed by clicking the preceding activity with the mouse, moving the cursor to a subsequent activity while the mouse button is pressed, and then releasing the mouse button. Can be used.

When designating the linking relationship, the first and second parts of the preceding activity and the subsequent activity may be selectively designated, so that one of the matching of the start point of the preceding activity and the following activity, the matching end point, and the start of the following activity after the completion of the preceding activity is completed. It can be configured to specify the connection type.

At this time, according to the cursor position of the mouse, which part of the first half or the second half of the current activity is selected may be displayed on the screen.

The connection relation information may include at least an identification code of a trailing activity, the type of connection with the trailing activity, and wait time information until the trailing activity starts after the period of its own ends.

In each of the above embodiments, the generating of the entire schedule may include: searching for a path between the activities by analyzing each activity information generated in the schedule management window; And analyzing the activity information in each of the discovered paths to find a main process path to which all activities in the path are connected without waiting.

The finding of the main process path may include setting a level based on the maximum number of activities needed to be connected with the best activity for each activity of the searched path, and connecting the activities belonging to each level with any subsequent activities. Generating a table indicating whether a table is present; Analyzing the schedule by sequentially repeating a process of analyzing activity information of a current level and activity information of a subsequent level for activities of each level using the table information; And finding the main process path according to the analysis result.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

The present invention enables a user to easily create an activity representing a detailed schedule by using a computer device, and analyze the generated activity information to manage the entire schedule at a glance.

The computer device according to the present invention is not limited to a personal computer (PC) but may be various types of computer devices such as a notebook computer or a personal digital assistant (PDA) according to the performance of the computer device.

Referring to FIG. 1, the present invention may be performed through a schedule management program 11-1, which is a computer program installed and operated on the computer device 11.

An example of the computer device 11 will be described.

The control unit 21 is responsible for the overall control of the computer device 11, and is generally configured using a central processing unit (CPU). Read Only Memory (ROM) 22 stores a Basic Input Output System (BIOS) that contains basic routines for transferring information between internal components of the computer device 11 during start-up time. Memory) temporarily stores various data necessary for the operation of the computer device 11 and the computer program code being executed.

The control unit 21 reads and executes computer program codes stored in the RAM 23 in order.

The storage unit 24 is configured using a nonvolatile storage medium for storing digital data such as a hard disk drive (HDD) or a flash memory, and includes an interface for connecting the control unit 21 to the storage medium.

The storage unit 24 stores various computer programs required for the user to use the computer device and information personally managed by the user. In particular, an operating system program and various application programs, such as Microsoft's Windows program, are installed, and in particular, a schedule management program 11-1 for performing schedule management according to the present invention is installed.

The keyboard 25-1 and the mouse 26-1 are devices that allow a user to input desired information to the computer device 11. Signals generated from the keyboard 25-1 and the mouse 26-1 are input to the computer device 11. Each is transmitted to the controller 21 through the keyboard interface 25-2 and the mouse interface 26-2.

The display screen 28 is a component for visually displaying a screen such as a CRT monitor or an LCD module. The screen processor 27 controls the display screen 28 including a video adapter, and converts and transmits information to be displayed on the screen into a signal suitable to be output through the display screen 28.

In addition, the communication unit 29 may include a network interface card (NIC), a modem, or the like, and the computer device 11 is wired or wirelessly connected with other computer devices through various communication networks such as an internet network or a wireless communication network. It serves to communicate in a way.

As described above, the schedule management method according to the present invention may be preferably implemented using the schedule management program 11-1 installed in the storage unit 24 and executed by the user. When the user executes the schedule management program 11-1 by using the keyboard 25-1, the mouse 26-1, or the like, the related computer program code is stored in the RAM 23, and then in order by the controller 21. The processing is performed and thus, the user can use the computer device 11 to create an activity and manage a schedule.

Referring to FIG. 2, each activity can be arbitrarily created by a user, each having its own individual time period. Individual time periods for each activity can be set as desired by the user.

In FIG. 2, five activities consisting of individual periods # 1 to # 5 are shown, wherein the individual periods of activity # 1 are between the start point t1 and the end point t2, and the individual periods of activity # 2 are between the start point t2 and the end point t4, and the activities. The individual period of # 3 is set between the start point t4 and the end point t5, the individual period of activity # 4 is between the start point t2 and the end point t3, and the individual period of the activity # 5 is set between the start point t4 and the end point t5.

In the following, for convenience of explanation, the period is described as an example in which days are formed (that is, how many days are included in each period). It may be configured to be made.

A specific embodiment of a schedule management method using a computer device according to the present invention will be described with reference to FIG. 3.

First, a schedule management window for generating an activity by an instruction of a user or on an initial screen on which the schedule management program 11-1 is executed is output (S31).

Referring to the example of the schedule management window 40 with reference to Figure 4, it can be displayed on the top of the period scale is divided into years, quarters, months, etc. to help set individual periods, Necessary information such as current reference date information 41 indicating the start date may also be displayed. The current reference date may be configured to be set by the user in various ways, such as by moving the reference date designation mark 42 with a mouse or inputting it through a separate reference date input box (or a separate window).

In addition, the schedule management window 40 may be divided into several lines for the convenience of schedule management and clear organization, and the user may create an activity in any row as needed. 4 shows a state in which the rows from # 1 to # 13 are visible, and when the entire schedule is displayed thereafter, the rows may be separately displayed according to the corresponding rows.

Now, the user can create an activity through the schedule management window 40. The user can create an activity only by dragging a mouse in the schedule management window 40. FIG. That is, when the user drags the mouse in the schedule management window 40 (S32), the dragged area is immediately set as an individual period, and by storing information for specifying this period (hereinafter, referred to as individual period information). An activity having the corresponding individual period is generated, and the generated activity is displayed on the schedule management window 40 (S33).

In operation S33, the user may generate as many activities as desired (but the maximum number that can be generated may be limited as necessary) at a desired position.

5 shows a dragging state 51 using a mouse, and an example in which the date and duration information 52 corresponding to the current dragged area is displayed on the lower end of the dragged area for the convenience of the user.

In step S33, the individual period information may be variously configured as necessary, but may be configured to include at least an activity identification code for uniquely identifying the generated activity and period information corresponding to the area to which the mouse is dragged.

The activity identification code is a name that uniquely identifies the activity and can be assigned as the default (e.g., task1, task2, etc.) at the beginning of the mouse drag. Each activity identification code is then assigned to the user's choice. It can be configured to change accordingly. As an example, the user may be configured to enter a name for each activity directly by providing a means to enter the activity identification code.

While the individual period information is stored, the dragged region has properties as an activity, and is displayed on the schedule management window 40 in various forms such as an activity 61 having a bar shape as shown in FIG. 6.

Also, as shown in the example of FIG. 7, several activities 71, 72, and 73 may be generated on the same activity (reference numeral 73 is currently shown as dragging). Likewise, several can be generated across multiple rows. In an embodiment in which the schedule management window 40 is divided into multiple rows, the individual period information may include identification information (location number) of the row where the activity is located, and then display the activity on the screen or display the entire schedule analysis result. You can make it appear in that position when you print it.

As described above, an activity has a separate period of time to proceed with some specific schedule, which may include work on all days within this period, but may also include days that cannot be worked, such as holidays or inability to work due to certain circumstances. have.

Therefore, the user can specify the activity so that some of the days belonging to the activity are not included in the work day, in which case the period information in the individual period information will be subtracted from the individual periods in the activity. Can be. For example, if an individual period of an activity was 40 days, and five of these periods were set to no work days, the period information is managed as 35 days.

When a plurality of activities are generated through step S33, the user can designate a connection relationship between the activities.

That is, when the user designates that the activities displayed in the schedule management window 40 are connected to each other by using the mouse (S34), the connection relationship information indicating the connection relationship of the corresponding activity is stored as the corresponding activity information. Manage by (S35).

Each activity forms part of the overall schedule, so it is necessary to determine where the activities are in the overall schedule so that the entire schedule can be analyzed. Therefore, it is a process to specify the pre / post relationships between these activities.

At this time, the designation of the connection relationship between the activities can be configured by a process of designating the preceding and predetermined trailing activities in a predetermined order with the mouse in order.

The way in which you want to specify leading and trailing activities can be configured as needed.

For example, the mouse is used to specify the linkage between activities, which mouse button is recognized as a signal to designate the linkage when it is clicked, or when the right mouse button is clicked on the activity. Whether to display the shortcut menu (for example, designate as a preceding activity or designate as a subsequent activity) that is displayed can be configured in various ways.

As a specific example of this, a mouse clicks on a predetermined preceding activity and then moves the cursor to a trailing activity that follows the schedule while the mouse button is pressed, and then releases the mouse button to release the action between the preceding activity and the following activity. It can also be configured to specify a connection.

On the other hand, there may be various types in which the preceding activity and the following activity are connected. That is, since both the preceding activity and the following activity have a starting point and an ending point, they can be configured to select which of the starting and ending points of the preceding activity is connected to the starting and ending points of the trailing activity.

Therefore, by selectively connecting the first half and the second half of the preceding activity to the first half or the second half of the trailing activity, one of the following: start point matching, end point matching, and end of the preceding activity. You can specify the type.

In this case, the first half and the second half may be divided into two lengths so that when the mouse cursor is in the first half or the second half of the preceding activity, the starting or ending point of the preceding activity is connected to the trailing activity, respectively. Likewise, the trailing activity can also be the starting point or ending point of the trailing activity, respectively, when the mouse cursor is in the first half or the second half of the trailing activity. At this time, the criteria for distinguishing the first half and the second half do not necessarily need to be exact two parts, and of course, can be set as necessary.

FIG. 8 shows an example 81 in which a link connection shape indicating the connection mode when the mouse cursor is positioned at the first half and an 'S' (Start) indication indicating that the mouse is positioned at the first half are shown. An example 82 is shown in which a link connection shape indicating a connection mode when located and a 'F' (Finish) indication indicating that it is located in the second half are shown.

By specifying the connection type in this way, when creating the entire schedule, the connection type of the preceding activity and the following activity can be processed in more detail.

That is, as in the example shown in FIG. 10A, both the preceding activity 101 and the following activity 102 are connected through the starting point and treated as starting at the same time, or as shown in FIG. 10B, according to the preceding activity 101. The trailing activity 102 can be treated as starting after the period ends, or as both the preceding activity 101 and the trailing activity 102 ending as shown in FIG. 10C.

11 and 12 illustrate an overview of connecting a preceding activity with a trailing activity, and show an example in which dashed lines 111 and 112 are displayed between the connected activities so that a user can easily recognize the same. In particular, FIG. 12 shows a state in which a preceding activity (task 1) is connected to two trailing activities (task 2, task 4).

In addition, in an embodiment of designating a connection type, connection type information with a subsequent activity is included in connection relationship information stored and managed as activity information.

If a connection relationship between each activity is designated through step S35, the user may input a schedule analysis command to generate an entire schedule.

That is, when a schedule analysis command is input from the user (S36), each activity information (individual period information and connection relationship information) generated in the schedule management window is analyzed and the path between each activity is searched and the main hole is searched using the found path. Various overall schedules such as a forward route are generated (S37).

Then, the schedule management is terminated according to the schedule management end command input from the user (S38).

Referring to FIG. 13, a specific embodiment of performing step S37 will be described. A process of searching for a path between activities by analyzing each activity information generated in the schedule management window (S131), and in each of the discovered paths Analyzing the activity information may be configured to include a step (S132) to find a path (main process path) to which all activities in the path are connected without waiting time.

The user can arbitrarily create a number of activities across each row of the calendar window, and can freely specify the connection relationships. Therefore, there may be more than one best activity, and there may be more than one path leading to the best activity.

The method for searching each path in step S131 may be configured in various ways as necessary. For example, by searching each activity information in the schedule management window, it searches for the best activity with the detailed schedule that needs to be performed first by searching for the activity that is not linked to the following activity of other activities. By tracking the trailing activity, starting with the best activity found, you can find the entire schedule from the best activity to the trailing activity and create a full schedule for each route.

Meanwhile, step S132 includes a process of finding a main process path by performing a schedule analysis on each searched path.

The process of finding the main process path from the searched path can be configured using various methods as necessary.

An embodiment of performing a schedule analysis on each route will be described with reference to FIG. 14. Assume that a total of ten activities (tasks A to J) have been created in the schedule management window as shown in the example of FIG. 14A, and that four routes have been identified as shown in FIG. 14B as a result of searching the route. do.

Then, as shown in FIG. 4B, since each analysis should be performed five times, six times, six times, and seven times for each path 1 to 4, it can be seen that a total of 24 analyzes are required to find the main process path. . In other words, using this method, the schedule analysis may be repeatedly performed on all the paths, thereby increasing the number of redundant analyzes.

Another embodiment of performing a schedule analysis on each route will be described with reference to FIG. 15.

First, when the route is found, the level is set for each activity of the schedule management window using this information (S151). The level here means the largest number of activities that the activity must pass through in order to connect with the best activity.

In operation S152, each activity is gathered by level and a connection structure of each activity bit and a subsequent activity is displayed. That is, in the table generated in step S152, information indicating which trailing activities are associated with activities belonging to each level are stored for each level.

As an example illustrated in FIG. 16A, activity 'task A' may be set to level 1 because it is the best activity itself. Activities 'Task B' and 'Task G' are set to level 2 because they are linked to the best activity 'Task A' in the following order. However, activity 'task D' is linked through the best activity 'task A' through up to three (tasks G, H, and C), so even if a path exists between 'task B' and 'task C' Is set to. In this way, the last activity 'Work F' is connected to the best activity 'Work A' and up to six activities (G, H, C, I, J, E), so it is set to level 8.

The table generated through the level setting result is shown in FIG. 16B. Here, the symbol 'O' indicates that the activities of the left / right are connected to each other, and the 'X' indicates that the connection is blocked. That is, the symbol 'O' indicates that activity 'job B' is connected to 'job' C, and activity 'job D' is connected to 'job' E. In addition, when each activity is located in an adjacent cell in the table such as 'task A' and 'task B', 'task G' and 'task H', the two activities are marked as connected.

Referring back to FIG. 15, a process of analyzing activities for each level and subsequent activities information for each level using the above table information generated in step S152 is sequentially performed for each level from the activities of the first level to schedule a schedule between activities. Analyze (S153).

As an example illustrated in FIG. 16B, activity 'Task A' analyzes a schedule between 'Task B' and 'Task G', and activity 'Task B' schedules a schedule between 'Task C'. The activity 'Task G' analyzes the schedule with 'Task H', the activity 'Task H' analyzes the schedule with 'Task C', and the activity 'Task C' refers to the 'Task' The schedule is analyzed between D 'and' task I ', and activity' task D 'analyzes schedule with' task E ', and activity' task I 'schedules schedule with' task J '. The activity 'task J' analyzes the schedule with 'task E', and the activity 'task E' analyzes the schedule with 'task F'.

That is, only the detailed paths 1, 6, 7, 2, 8, 3, 9, 10, 4 11, and 5 of the detailed paths indicated by 1 to 11 in FIG. 16 need to analyze the schedule. You can find the path.

Now, the main process path is found according to the analysis result in step S153 (S154). That is, the main process path can be found by checking the paths to which all activities of each path are connected without any time. When the embodiment shown in FIG. 16 is used, a significant amount of calculation is reduced compared to the embodiment shown in FIG. This allows you to find your main process path more quickly.

Meanwhile, FIG. 17 illustrates a state in which four random activities (tasks 1 to 4) are generated and a connection relationship is designated in the schedule management window 40. FIG. 18 is shown in the schedule management window in the state shown in FIG. The following shows an example of a state displayed on the screen after executing a schedule analysis command.

Here, FIG. 18 shows an example in which the schedule is started from this date by considering the current reference date as the best date.

Therefore, each activity created in FIG. 17 has moved according to the current reference date, and the meaningless space between each activity has been removed. In other words, the start date and end date of each activity may be changed through the schedule analysis process, but the period information does not change. In addition, in FIG. 18, the path consisting of 'job 1', 'job 2', and 'job 3' is the main process path, and the path consisting of 'job 1', 'job 4', and 'job 3' is 'job 4'. 'Is not the main path because it has time.

This main process path may be marked to be distinguished from other paths other than the main process path. For example, the main process path may be displayed differently from other paths and colors.

On the other hand, each activity described above has individual periods as information about the period of the activity and connection relationship information specifying connection relationships between the activities. This information represents the basic structure of each activity, which allows you to obtain information about the entire schedule, such as finding the main process route.

In addition, each activity refers to the period of time in which the activity is planned to perform a particular task during the period represented by the activity, so that each activity includes, or contains, information that represents a detailed schedule for that task. It is of course possible to include information indicating a file or other data storage structure.

Then, with respect to the entire schedule such as the activity itself or the main process path that is identified according to the present invention as described above it can be provided to the user by processing the information in a variety of ways.

The above-described embodiments are intended to help the understanding of the present invention, and the present invention is not limited to the above-described embodiments and can be variously modified and implemented by those skilled in the art without departing from the spirit of the present invention. to be.

According to the present invention, when performing schedule management through a computer device, the user can easily create an activity simply by dragging the mouse as desired at a desired position, and the connection relationship of each generated activity can be easily performed by using a mouse. Can be specified. In addition, a plurality of generated activities can be quickly analyzed according to a schedule analysis command to obtain useful overall schedule information such as the main process route.

Accordingly, the entire schedule (process) such as construction industry or shipbuilding industry can be used very conveniently in the field consisting of a number of detailed schedule (process), which is directly connected to the improvement of productivity and work efficiency, thereby reducing the cost. In addition, it provides a simple and easy general user interface for creating detailed schedules for managing schedules and analyzing / managing entire schedules.

Claims (12)

In the schedule management method using a computer device that allows a user to create a plurality of activities representing a detailed schedule using a computer device and to manage the entire schedule through this, Outputting a schedule management window on a screen of the computer device to enable a schedule management program installed in the computer device to generate the activity; When the user drags the mouse in the schedule management window, the schedule management program generates an activity by storing information (individual period information) for specifying a period corresponding to the dragged area, and generates the activity. Allowing a plurality of activities to be generated in a manner displayed in a schedule management window; The schedule management program allows a user to designate a connection relationship between activities displayed on the schedule management window using the mouse, and store and manage connection relationship information indicating the connection relationship as the corresponding activity information; And When a schedule analysis command is executed, the schedule management program analyzes each activity information generated in the schedule management window and connects the respective activities to each other to generate the entire schedule, and generates the entire schedule in the schedule management window. And outputting to the schedule management method using a computer device, characterized in that the configuration. The method of claim 1, And the individual period information comprises at least an activity identification code for uniquely identifying the generated activity, and period information corresponding to the area in which the mouse is dragged. The method of claim 2, The activity identification code is designated as the default value (Default), and the schedule management method using a computer device, characterized in that configured to be changed after the user's selection. The method of claim 2, The portion of the period information allows the user to set to not included in the work day, and the portion set not included in the work day is configured to subtract from the period information. . The method of claim 1, And the step of designating a connection relationship between the activities using the mouse is performed by sequentially selecting a preceding preceding activity and a following trailing activity in sequence using the mouse. Schedule management method using. The method of claim 5, wherein When designating the linking relationship, the first and second parts of the preceding activity and the subsequent activity may be selectively designated to match one of the start point of the preceding activity and the following activity, the end point coincidence, and the start of the following activity after the completion of the preceding activity. A schedule management method using a computer device, characterized in that configured to specify the connection type. The method of claim 6, And displaying, on the screen, which part of the first half or the second half of the corresponding activity is selected according to the cursor position of the mouse. The method of claim 6, The connection relation information comprises at least an identification code of its own trailing activity, the type of connection with the trailing activity, and information on the amount of time it takes for the trailing activity to start after its period ends. Schedule management method using device. The method of claim 5, wherein The process of designating the connection relationship may be performed by clicking a previous activity with the mouse and then moving the cursor to a subsequent activity while the mouse button is pressed and then releasing the mouse button. How to manage. The method according to any one of claims 1 to 9, The generating of the entire schedule may include: searching for a path between the activities by analyzing each activity information generated in the schedule management window; And And analyzing the activity information in each of the discovered paths to find a path (main process path) to which all activities in the path are connected without any time. The method of claim 10, wherein the finding of the main process path comprises: Setting a level based on the number of activities required to be associated with the best activity for each activity in the searched path, and generating a table indicating which trailing activities are associated with the activities belonging to each level ; Analyzing the schedule by sequentially analyzing activity information of a current level and activity information of a subsequent level for activities of each level using the table information; And And a step of finding the main process path according to the analysis result. The method of claim 10, And the main process path and other paths are configured to be displayed separately in the schedule management window.

Images