JPH07160763A - Work allocation method - Google Patents

Abstract

PURPOSE:To prepare a work schedule whose reduction rate of the number of using application time is minimized by preparing the using schdule of specified resources with respect to plural using time zones which are applied to. CONSTITUTION:A computer 11 consists of a using application frame dividing part 101, an overlapped frame direction part 102, a frame allocation part 103 and a schedule display part 104. Then, this method converts the usable time zone and the using application time zone of the resources to the set of frames by the unit of minimal allocation time peculiar to a system, based on the set of the converted frames, the method investigates whether overlapped plural time zones exisit or not, moves and reduces a using time by the unit of the frame in correspondence to the priority of application concerning the overlapped plural using time zones, so as to prepare the using schedule of the specified resources with respect to the plural using time zones which are applied to. When all the sets of the frames can not be allocated by only moving, this method allocates work while reducing the number of the frames.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a work allocation method in a computer system that solves various scheduling problems, and in particular, accepts a plurality of resource utilization applications in which utilization time zones such as dates and days of the week are designated for specific resources. The present invention relates to a work allocation method suitable for creating a resource usage schedule.

[0002]

2. Description of the Related Art When solving a scheduling problem on a computer system, a know-how and conditions for creating a schedule are made into a knowledge base, and an expert system approach is adopted so that the know-how and conditions for creating a schedule can be quickly responded to. Is common.

As a method of allocating a plurality of works to a specific resource by this expert system approach, there is a method disclosed in Japanese Patent Laid-Open No. 1-240973.

[0004]

However, in the above-mentioned conventional technique, a work that cannot be assigned to an application in which a use time zone is designated (hereinafter, referred to as an unassigned work).
Is not taken into account,
There is a problem that unallocated work occurs when the usage applications are duplicated or when the total time of usage applications to the scheduling unit exceeds the number of resource available hours.

An object of the present invention is to solve the above problems and
It is to provide a work allocation method capable of creating a schedule that minimizes the difference between the number of usage applications and the number of work allocations for all users.

[0006]

[Means for Solving the Problems] The above-mentioned object is to convert a received use time zone into a set of frames in a minimum allocation time unit peculiar to a system, and then, based on the converted set of frames,
It is checked whether there are multiple overlapping usage time zones. For multiple overlapping usage time zones, the usage time is moved and reduced in units of frames according to the priority of the application, and multiple usage times This is achieved by creating a usage schedule of a specific resource for the usage time zone and outputting the schedule result.

[0007]

According to the above-mentioned means, the resource available time zone and the use application time zone are converted into a set of frames in the minimum allocation time unit peculiar to the system, and a plurality of duplicated plural frames are generated based on the converted set of frames. Check whether there is a usage time zone, and for multiple overlapping usage time zones, move and reduce the usage time in units of frames according to the priority of the application,
Create a usage schedule for a specific resource for multiple usage hours for which you have applied. Here, based on the calculated total number of applied frames and the number of duplicated frames, move the set of use applied frames according to the availability and the priority of the application and assign it. If it cannot be assigned, the work is assigned while reducing the number of frames. As a result, it is possible to create a schedule in which the occurrence of unassigned usage applications is minimized and the difference between the usage application hours and the work allocation hours of all the application applicants is minimized.

[0008]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to FIGS. 1 to 5 as an example of work allocation for a machine utilization application to a computer center that provides services from 8:00 to 24:00.

FIG. 1 is a block diagram showing an entire computer system to which the present invention is applied. In the figure, 11 is a computer for controlling the present system, which is composed of a use application frame division unit 101, a duplicate frame detection unit 102, a frame allocation unit 103, and a schedule display unit 104.

Reference numeral 12 denotes a display device for displaying the schedule result, which is provided with an input device such as a keyboard and a mouse, and inputs application data and its priority.
Reference numeral 13 is a usage application data storage device, 14 is a scheduling know-how storage device, and 15 is a scheduling result storage device.

FIG. 2 is a flow chart showing the control flow of this system, FIG. 3 is a diagram showing an example of converting an application into a set of frames, and FIG. 4 is an example of moving and allocating duplicate applications in units of frames. FIG. 5 is a diagram showing an example of deleting, moving and assigning duplicate applications in units of frames, and FIG. 6 is a diagram showing an example of scheduling knows stored in the scheduling know-how storage device 14.

The operation of the embodiment will be described below with reference to the operation steps of the flowchart of FIG.

The computer 11 carries out the work of allocating the application while referring to the scheduling know-how 610 of FIG. 6 from the scheduling know-how storage device 14.

The minimum allocation time unit peculiar to the system will be explained as 30 minutes.

Further, the priority is set in the range of "1" to "100", and in the case of the priority "100", it is assumed that the allocation is performed as requested, and this know-how is scheduled in the format shown by reference numeral 611 in FIG. Know-how storage device 1
Stored in 4.

First, when the usage application to be scheduled is read from the storage device 13, the computer 11 uses the usage application frame division processing unit 201 to convert it into a set of frames, which is the minimum scheduling unit (30-minute unit) peculiar to the system. (Step 201).

For example, in the case of application 301 from 9:00 am to 15:00 shown in FIG. 3, a set 302 of 12 frames 302
Convert to.

Next, the duplicated frame detection processing unit 202 determines whether or not there is a duplicated use application frame set for each scheduling unit (steps 202 and 203).

For example, like the application example 410 of FIG. 4,
"Application A" 411, which is the desired use time zone from 10:00 to 13:00, with priority "100", and 13:03 with priority "90"
"Application B", which is the desired time zone from 0 minutes to 18:00 4
12, there are three "application C" 413, which are the desired use time zones from 16:30 to 21:30 with the priority "80", and the "application B" 412 and the "application C" 413 have an overlapping part 414. In this case, the overlapping frame detection processing unit 202 detects the overlapping of three frames.

As in the application example 510 in FIG. 5, the priority is "100" and the desired time zone from 11:30 to 15:30 is "application E" 511 and priority "90".
From 14:00 to 18:30, "Application F" 512, which is the desired usage time zone, and priority "80" from 10:30 to 1
"Application G" 51, which is the desired use time zone at 5:30
3. There are four applications, “Application H” 514, which is the desired time zone from 15:30 to 23:00 with priority “70”, “Application E” 511, “Application F” 512, and “Application G” 513. , "Application H" 514 has an overlapping portion 515, the overlapping frame detection processing unit 202 detects the overlapping of 17 frames.

As a result, if there is no overlapping frame, the scheduling result output process (step 206) outputs the usage application as it is as a scheduling result, and the process is terminated.

However, if there is a duplicated frame, the priority of the frame set is evaluated by the frame set priority evaluation process of the frame allocating unit 103 (step 204).

For example, in the example of FIG. 4, "application B" 41
2 and “Application C” 413 each have a priority of “100”
And “90”, the “application C” 413 is to be moved / deleted. Further, in the example of FIG. 5, “application E” 51
1, "application F" 512, "application G" 513, and "application H" 514 have priority levels of "100" and "9", respectively.
"Apply F" 5 because it is "0", "80", "70"
12, “Application G” 513 and “Application H” 514 are targets for movement / deletion.

Next, the frame set movement / deletion process is performed by the frame set movement / deletion process based on the evaluated priority (step 205).

For example, in the example of FIG. 4, since there is a space for 5 frames behind the “application C” 413 to be moved / deleted for the overlapping frame number “3”, the “application C” 413 is placed behind. Move 3 frames and allocate without deleting.

Further, in the example of FIG. 5, "application F" 51
2. "Application G" 513 and "Application H" 514 have moved /
Although it is a deletion target, it can be seen that 10 frames need to be deleted because there are only 7 empty frames for the number of overlapping frames “17”.

Therefore, “application F” 512, “application G” 513, and “application H” 514 are respectively “2”,
After deleting "3" and "5" frames, "Apply F" 5
12 is moved 5 frames forward, “application G” 513 is moved 10 frames backward, and “application H” 514 is moved 8 frames backward and allocated.

In this case, know-how 6 shown in FIG.
Follow step 12.

Finally, the schedule display unit 104 outputs and displays the scheduling result on the display device 12, and the scheduling result storage device 15
(Step 206).

The allocation results for the application example of FIG. 4 and the application example of FIG. 5 are as shown by reference numeral 420 in FIG. 4 and 520 in FIG.

In the present embodiment, the case where there is an application for the priority "100" has been described, but the priority "10" is applied.
If there is no "0" application, all applications are relatively evaluated by priority, and the frames are moved / deleted and assigned.

As a strategy for deleting frames, in this embodiment, attention is paid to the difference in priority of application according to the frame deletion know-how 612, and the ratio of frame deletion is set to 1: 2: 3.
10 × (1/6) ≈2, 10 × (2/6) ≈3,10 ×
The number of deleted frames is calculated by the calculation of (3/6) = 5. However, by modifying this know-how part, for other strategies, for example, for applications other than priority “100”, “3”, Strategy to delete equally with "3" and "4",
In addition, the reduction rate is calculated from the total number of frames (34 frames) and the number of frames to be deleted (10 frames) in the set of moving / deleting objects (10/34 = 30%), and the reduction rate is applied to each of the applied frame sets. It is also possible to select a strategy such as “3”, “3”, “4” to be deleted.

[0033]

As described above, according to the present invention, after converting the received use time zone into a set of frames of the minimum allocation time unit peculiar to the system, a plurality of overlapping plural frames are generated based on the converted set of frames. Check whether there is a usage time zone, and for multiple overlapping usage time zones, move and reduce the usage time in units of frames according to the priority of the application,
A schedule is created that minimizes the difference between the number of application hours for all users and the number of work assignments, as it creates a usage schedule for specific resources for multiple usage hours for which applications have been made. It is possible to create a work schedule that minimizes the number reduction rate.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment of a computer system to which the present invention is applied.

FIG. 2 is a flow chart showing the operational steps of the present invention.

FIG. 3 is an explanatory diagram showing an example of dividing a use application for a resource into frames.

FIG. 4 is an explanatory diagram showing an example of moving and assigning duplicate usage applications based on the number of frames.

FIG. 5 is an explanatory diagram showing an example of assigning duplicate applications by deleting and moving frames.

FIG. 6 is a diagram showing an example of scheduling know-how.

[Explanation of symbols]

11 ... Calculator, 12 ... Display, 13 ... Usage application data storage device, 14 ... Scheduling know-how storage device, 15 ... Scheduling result storage device, 101 ...
Usage application frame division unit, 102 ... Duplicate frame detection unit, 10
3 ... Frame allocation section, 104 ... Schedule display section.

Claims (1)

[Claims] 1. A work allocation method for accepting a plurality of work allocation applications in which a usage time zone is specified for a specific resource and creating a usage schedule of the specific resource, wherein the received usage time zone is a system-specific minimum. After converting to a set of assigned time units, check whether there are multiple overlapping usage periods based on the converted set, and if there are multiple overlapping usage periods, set the priority of the application. According to the work allocation method, the usage time is moved or reduced in units of frames, a usage schedule of a specific resource is created for a plurality of usage time hours for which an application has been made, and the schedule result is output.