JPH0195360A - Work plan supporting device - Google Patents

Abstract

PURPOSE:To efficiently prepare the day's schedule and process plan even when the number of work items is many by providing a work item list preparing means, a pickup means, an allocatable frame extracting means, an allocation frame selecting means, an allocating means, etc. CONSTITUTION:In a work plan supporting device composed of a reasoning engine 6, a knowledge base 7 and an interface 8 to store the control program of an allocation plan, a work item list preparing means 1 prepares the work item list in the earlier sequence of the starting period. Next, one work item is successively picked up from a peak by a pickup means 2, the starting period and the work time are recognized by an allocatable frame extracting means 3 and the allocatable total work allocation frame is extracted. The work allocation frame is selected, in which the final completion time of the work item allocated already out of the extracting work allocation frames is maximum, by an allocation frame selecting means 4 and the work item picked up by an allocating means 5 is allocated. Thus, even when the work item is many, the day's schedule and the process can be prepared.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a work planning support device for creating schedules or processes during work planning.

[Conventional technology]

When planning a GI drawing, it is necessary to create a complete schedule or process so that the planned plan can be carried out without difficulty.

Conventionally, the creation of schedules or processes for work 81 has been done exclusively manually.

On the other hand, creating schedules or processes manually requires a lot of effort and time, so a processing method is being considered in which this task is done by a computer.

A conventional processing method, for example, is to create a list of permutations of each work item and sequentially rearrange the permutations to find a feasible permutation.

However, in the conventional processing method based on combinations of permutations, the number of permutation lists increases factorially as the number of work items increases, so when the number of work items is large, so-called combinatorial explosion occurs. This caused the problem that it was virtually impossible to create a system that could withstand practical use.

[Purpose of the invention]

SUMMARY OF THE INVENTION An object of the present invention is to improve the above-mentioned problems and provide a work planning support device that can efficiently plan schedules or processes even when there are many work items.

[Summary of the invention]

To achieve the above object, the present invention, as shown in FIG. A work item list generation means 1 that generates a sequential work item list, a pickup means 2 that sequentially picks up one work item from the top of the generated work item list, and a start deadline and work time of the picked up work item. an allocatable frame extracting means 3 that recognizes and extracts all work allocation frames to which the relevant work item can be allocated; The present invention is characterized by comprising an allocation frame selection means 4 for selecting, and a work item allocation means 5 for allocating picked up work items to the selected work allocation frame.

〔Example〕

Hereinafter, the present invention will be explained based on the drawings.

FIG. 2 is a diagram showing an embodiment of the present invention.

First, to explain the configuration, there is an inference engine 6 that stores a program for controlling an allocation plan, and a knowledge base 7 that stores various conditions related to work items and work item allocation. All of these are normally stored in an external storage device and moved to the main storage device by a predetermined procedure. The interface 8 also includes an output means 9 for displaying program execution results and the contents of the knowledge base to the user, and an input means 10 for receiving command input from the user.

The output means 9 and the input means 10 are exemplified by a CRT and a keyboard for convenience, but the output means 9 may be a liquid crystal display, a plasma display, etc., and the input means 10 may be a mouse, a light pen, a tap panel, etc. These can be applied to any input/output device that can be connected to a normal computer.

FIG. 3 is an explanatory diagram showing an example of the knowledge base 7, and FIG.
) to (e) are explanatory diagrams of control programs.

In FIG. 3, data ■ indicates that the total number of work items is five. In addition, data ■～■ are for each work item a
-e, the number of working days is 3.4.5.4.3 respectively.
days, and the end dates are 10, 8.9, and 10.5, respectively.
It shows that it is day. Furthermore, the data data indicates that the total number of allocated frames is 2, and the data data ■, ■ indicate that the total number of allocated frames is 2, F1. The length of F2 is 10 days.

FIG. 5 is a flowchart of system processing, and FIGS. 6 and 7 are explanatory diagrams showing the states of work items and layout frames during the process.

First, in FIG. 5, in step 501, each work order [1
For each task, the start deadline for starting the work is calculated, taking into account the standard time and the end deadline. A specific processing method can be executed, for example, as shown in FIG. 4(a). In other words,
The start deadline S of the work item named X is calculated from the difference between the end deadline E and the work time T, and is stored in the temporary storage area with a predicate named 5tart. Of course, this start deadline S can be specified in the knowledge base in advance, and in that case, the process of step 501 is unnecessary.

Next, in step 502, the program shown in FIG. 4(b) is used to generate a list L in ascending order of starting deadline S, as shown in FIG. When this is executed, in the case of this embodiment, the bears of (start deadline S2 work item

1ist(((2,8), (4,b), (6
,d>.

(7,8))).

Next, in step 503, the elements of the list stored as a result of the processing in step 502 are sequentially stored from the left end.
That is, the items with the earliest start deadline S are picked up in order. This process can be realized by a simple recursive procedure using the program shown in FIG. 4(C).

Next, in step 504, the program shown in FIG. 4(d) searches all allocation frames to which the work item given by the pair (start deadline S9 work item X) handed over from step 503 can be allocated. .

That is, all the frames that can be allocated to the work item defined by the work time T and start deadline S of the work item are unified into a heading list W in a list format.

Here, a frame that can be allocated (frame name 20, number of days D that the frame has) is defined by the predicate enable.

First, the number of days the frame has is the working time T of work item
The first condition is greater than or equal to.

Here, each time the allocation is performed, the number of days of the frame needs to be shortened by one minute of its standard time, which is performed in the next step 505.

Next, the predicate used, which indicates how many days of each frame have been allocated, is referenced. If nothing is stored, this will be day 0, but if U8 is used, the possible start date of work item X to be assigned next will be U+1. Therefore, the second condition is that the start deadline S is longer than or equal to this "u + i", that is, that the start deadline S is better than the possible start date U. In the layout that satisfies these two conditions, all the frames are unified into W as a list sorted in descending order of remaining days by the predicate 5etof.

Finally, in step 505, the first element of this allocatable frame list W, that is, the allocation with the shortest remaining days, allocates a work item of work time T1 work item x to frame Q using the program shown in FIG. 4(e). wear.

In this program, assigned (Q, X
) to memorize this assignment. In addition, the layout frame Q
The memory is rewritten as the number of days remaining by subtracting the standard time T from the number of remaining days as the new number of remaining days 01. In addition, the allocation uses the predicate used as the number of allocated days for frame Q if the frame is unused up to that point, and +T as the new number of allocated days if day is the number of allocated days. memorize it in your memory.

As described above, as shown in FIG. 7, in this example, two frames F1. In F2, predetermined work item a.

b...e can now be assigned in a manner that allows them to meet deadlines.

In this example, rules used in an expert system are applied as an example of a processing program, so that the procedure is easy and efficient schedule planning is performed.

Furthermore, since all permutations of work items are not considered, the processing speed is fast and it is possible to easily cope with an increase in the number of work items.

Note that the present invention is not limited to the above embodiments,
By making appropriate design changes, the embodiment described above can also be implemented.

〔Effect of the invention〕

As described above, the present invention has the configuration as described in the claims, and even if the number of work items is large, it is possible to efficiently plan a complete schedule or process.

[Brief explanation of the drawing]

Fig. 1 is a diagram showing an overview of the present invention, Fig. 2 is a block diagram showing the configuration of a work planning support device, Fig. 3 is an explanatory diagram showing an example of a knowledge base, and Fig. 4 (a) (b) ( c)
(d) (c) is an explanatory diagram showing an example of a control program, FIG. 5 is a flowchart of system processing,
FIG. 6 is an explanatory diagram of work items, and FIG. 7 is an explanatory diagram of layout frames. a, b, c, d, e...work items, Fl, F2...allocation frame agent patent attorney Yasuo Miyoshi Figure 1 Figure 2 ・ Figure 3 Figure 4 (a) Figure 4 (b) Figure 4 (c) Figure 4 (d) Figure 4 (e) Figure 5

Claims (1)

[Claims] A work planning support device that allocates a large number of work items with different start deadlines and work times to multiple work allocation frames,
A work item list generating means for generating a list of work items in descending order of start deadline; a pickup means for sequentially picking up one work item from the top of the generated work item list; An allocatable frame extraction means that recognizes the work time and extracts all work allocation frames to which the relevant work item can be allocated, and a work allocation frame with the maximum final finish time of the already allocated work items among the extracted work allocation frames. What is claimed is: 1. A work planning support device comprising: a layout frame selection means for selecting a work allocation frame; and a work item allocation means for allocating picked up work items to the selected work allocation frame.