JPH04111756A - Scheduling device - Google Patents

Abstract

PURPOSE:To improve processing efficiency in adusting allocation by setting a totalized limit value of characteristic value at the time of a work group allotted at each time, and performing the allocation by using the characteristic value total leveling method so as to be set within the limitation, when the initial allocation is performed. CONSTITUTION:In an initial allocation part 20, work information, accepted by a work information input acceptance part 10, is alloted to a schedule table based on a method, stored in a initial allocation method memory 22, and a leveling method, stored in a characteristic value total leveling method memory part 50, while referring to a limiting condition, stored in an initial allocation limiting condition memory part 21, and a limiting condition related to the total of the characteristic value of work stored in an adjusting allocation limiting condition memory part 31. Next, an adjusting allocation part 30 performs allocation correction of an initial allocation result by the initial allocation part 20 based on the method, stored in an adjusting allocation method memory part 32, while considering each limiting condition respectively stored in the initial allocation limiting condition memory part 21 and the adjusting allocation limiting condition memory part 31.

Description

[Detailed Description of the Invention] [Objective of the Invention] (Industrial Application Field) The present invention is an object of the present invention, in which required work can be carried out by humans without satisfying various conditions, such as the delivery date of the work and the constraints on the operation of equipment. This invention relates to the improvement of a scheduling device that allocates information to equipment and facilities.

(Prior art) Recently, in various production fields, required work has been
Scheduling devices, such as those disclosed in Japanese Patent Laid-Open No. 63-34056, have been used to allocate schedules to people and equipment while satisfying various conditions, such as work delivery deadlines and equipment operation constraints. ing.

FIG. 2 is a block diagram showing a general configuration example of this type of scheduling device, and the processing contents of the conventional scheduling device will be explained below based on this block diagram.

In FIG. 2, a work information input reception unit 10 receives input of work information to be scheduled, such as information such as the type of work, quantity, and delivery date.

Note that this work information can be entered manually from a CRT terminal device (not shown) connected to this scheduling device;
Alternatively, it is performed by data transmission from the outside.

Next, the initial allocation unit 20 stores the job information received by the job information input reception unit 10 in the initial allocation method storage unit 22 while taking into account the constraints stored in the initial allocation constraint storage unit 21. Allocate it to the schedule table based on the method used. This allocation is called an initial allocation.

Next, the adjustment allocation unit 30 selects the initial allocation constraint condition storage unit 2.
1 and each constraint stored in the adjustment allocation constraint storage unit 31, the initial allocation unit
The initial allocation result of 0 is corrected. This allocation is called an adjustment allocation.

Finally, the allocation result output unit 40 prints out the adjusted allocation results from the adjustment allocation unit 30 to a printer (not shown) connected to the scheduling apparatus or to a CRT so that the user of the scheduling apparatus can recognize them. Output by display output, etc.

Here, the above initial allocation and adjustment allocation will be explained in more detail.

In the first place, when scheduling, in addition to the basic condition of the job's delivery date, various constraints must be considered.

Three examples will be described below as specific examples of conditions.

(1) Conditions regarding the processing order of work For example, when completing one product, first process it in equipment A, then process it in equipment (i!B), then one product is processed in equipment A. , B's processing work is referred to as job ■ and job ■, there is a condition that job ■ must be assigned before job ■.In addition, due to equipment conditions, some equipment assigns work next to job ■. There may also be a condition in which it is desirable to carry out step (2).

(2) Work exclusion conditions For example, although two jobs are independent, when one job is done in one piece of equipment, the other job cannot be done in parallel in another piece of equipment due to equipment conditions. It is said to be prohibited.

(3) Constraint conditions regarding the sum of characteristic values of a job Characteristic values indicate the type and amount of items to be supplied, such as electricity and raw materials, required to process the job. Here, in general, the upper limit of the amount that can be supplied of things such as electric power and raw materials is set for each time. Therefore, when assigning work to multiple pieces of equipment at a certain time, it is necessary to ensure that the sum of the characteristic values of the assigned work group falls within the upper limit at that time.

FIG. 3 illustrates the above contents. here,
Electricity and raw materials are taken up as examples of characteristic values. Third
In the diagram, the total required power is the value obtained by adding the power required to process the assigned work to the time unit of the schedule table at the bottom of the diagram. For example, the total value at time 1 is work ■.

It is the sum of the values of each power required for the processing of [phase] and (2).

Now, scheduling needs to satisfy all of the above conditions as a result, but since the process is basically a trial-and-error adjustment method, it is necessary to improve the efficiency of that trial-and-error process. becomes. In this case, one
If we were to make adjustments each time we assigned a job, we would have to make adjustments each time to ensure that the group of jobs that combined that job and the jobs that had been assigned up to that point satisfied all the conditions, which would require a large amount of trial and error. Very inefficient. For this reason, the approach taken by conventional scheduling devices is a two-stage allocation method using a combination of the above-mentioned initial allocation and adjustment allocation.

That is, all the conditions to be considered are stored in the initial allocation constraint storage section 21. in FIG. Adjustment allocation constraint condition storage unit 31
However, this corresponds to the initial allocation constraint storage section 21 in FIG. 2, which is a relaxation of the constraint by extracting only a part of it.

With that as a constraint, I will try to assign all the tasks for now. At this time, it does not matter if some of the jobs violate the constraint conditions as a result. This is the initial allocation. Next, based on the results of the assignment, we find the parts that are in violation based on all the conditions to be considered, and make adjustments by moving or replacing the work, or in some cases dividing the work. Reassign to eliminate the violating part. Either this or adjustment allocation.

In this case, there are various specific methods for initial allocation.
Generally, it consists of a combination of knowledge engineering methods and methods prescribed by logic. - For example, when creating a monthly plan, the first step is to allocate the tasks for the beginning and end of the month while considering the continuity of the previous month and the next month, and the second step is to allocate the tasks for the beginning and end of the month, taking into account the continuity of the previous month and the next month. rx
Select and assign the one with the instruction “day”, and
Steps are a processing method in which the remaining work is roughly classified by season, and first the early work is assigned to all equipment while taking into account constraints, and then the middle and late work are assigned. This method is stored in the initial allocation method storage section 22 shown in FIG.

On the other hand, as in the case of initial allocation, there are various specific methods for adjustment allocation. - To give an example, select the most severely violated part from among the parts of the violation, and change the allocation from there. In addition, even if a new violation occurs as a result of correcting the layout, if the degree of violation is smaller than the original violation, it is allowed for the time being. This method is stored in the adjustment allocation method storage unit 32 shown in FIG.

By the way, in such a conventional scheduling device, constraints regarding the sum of characteristic values of jobs are not considered at the stage of initial allocation, but only at the stage of adjustment allocation. The reason for this is that the constraint on the sum of characteristic values corresponds to, for example, a limit on the height of a pile of things, so this limit should be taken into consideration only after the pile has been piled up. Therefore, in the conventional initial allocation, the constraints regarding the sum of characteristic values are not taken into account, but other constraints are taken into consideration when allocation is made, and the resulting pile-up of the sum of characteristic values is reduced by adjustment allocation. We are making adjustments to meet the constraints.

The above contents are illustrated in FIG. 4.

FIG. 4 shows a case where the assignment of jobs to equipment A and B has been completed in the initial assignment process, and then job 2 is to be assigned to equipment C. At this time, the total characteristic value is the value shown in the upper part of the figure.

Now, from the initial allocation conditions, when the allocatable interval for job ■ is as shown in the figure, conventionally, the total of the characteristic values is not considered, and the allocation is simply made by either left-justifying or right-justifying the interval. There is. Here, the left-aligned idea emphasizes bringing forward work, and the right-aligned idea emphasizes reducing the amount of work in progress.

However, in such conventional methods, the pile of the total characteristic values due to the initial allocation is random,
There was a problem in that the probability of violating the mountain height limit was high, and it took a lot of effort to break down the mountain by adjusting the allocation.

(Problems to be Solved by the Invention) As described above, in the conventional scheduling apparatus, there is a problem in that the adjustment allocation requires a lot of effort and the scheduling efficiency is poor.

An object of the present invention is to improve the processing efficiency for satisfying the same condition in the adjustment allocation by considering the constraint condition regarding the sum of the characteristic values of the work not only in the adjustment allocation but also in the initial allocation, and to improve the processing efficiency as a whole. The object of the present invention is to provide an extremely reliable scheduling system that can significantly improve scheduling efficiency.

[Configuration of the Invention (Means for Solving the Problem) In order to achieve the above object, the present invention allocates required work to people and equipment while satisfying various conditions, and plans a schedule. In the scheduling device, a job information input receiving means receives input of job information to be scheduled, an initial allocation constraint storage means stores constraints for performing initial allocation, and constraints for adjusting allocation. an adjustment allocation constraint storage means in which is stored an adjustment allocation constraint condition storage means, an initial allocation method storage means in which a method for performing initial allocation is stored, and a total characteristic value in which a method for leveling the total of job characteristic values is stored. The job information received by the leveling method storage means and the job information input reception means is stored in the constraint conditions stored in the initial allocation constraint storage means and the job characteristic values stored in the adjustment allocation constraint storage means. initial allocation means that performs initial allocation based on the method stored in the initial allocation method storage means and the leveling method stored in the characteristic value total leveling method storage means while referring to the constraint conditions regarding the total;
The initial allocation means allocates the initial allocation results based on the method stored in the adjustment allocation method storage means while referring to each constraint stored in the initial allocation constraint storage means and the adjusted allocation constraint storage means. The apparatus includes an adjustment allocation means for making corrections, and an allocation result output means for outputting the adjustment allocation result by the adjustment allocation means to the outside.

(Function) Therefore, in the scheduling device of the present invention, when performing initial allocation, a limit value for the total characteristic value of the task group to be allocated at that time is set for each time on the target time axis. By using the characteristic value total leveling method to make assignments within the limits, violation of the characteristic value total constraint can be reduced using a simple method at the initial assignment stage, reducing the effort of adjustment assignment. By making it smaller, the overall efficiency of scheduling can be improved.

(Example) Hereinafter, an example of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram showing an embodiment of a scheduling device according to the present invention. The same parts as in FIG. 2 are given the same reference numerals, and the explanation thereof will be omitted, and only the different parts will be described here.

That is, the scheduling device of this embodiment adds a total characteristic value leveling method storage unit 50 in addition to the one shown in FIG. The conditions are also referred to in the initial allocation section 20. Here, the characteristic value total leveling method storage unit 50 stores a leveling method for the total characteristic value of a job.

Next, the operation of the scheduling device of this embodiment configured as described above will be explained. Note that, for convenience of explanation, the explanation will be made using FIG. 4 here.

In FIG. 1, a work information input reception unit 10 receives input of work information to be scheduled, such as the type of work, amount, delivery date, etc.

Next, the initial allocation unit 20 transfers the job information received by the job information human resource reception unit 10 to the constraints stored in the initial allocation constraint storage unit 21 and the adjustment allocation constraint storage unit 31. The schedule is created based on the method stored in the initial allocation method memory 22 and the leveling method stored in the characteristic value total leveling method storage unit 50 while referring to the constraint conditions regarding the total characteristic value of the job. Assignments are made to the table.

That is, in FIG. 4, it is assumed that the initial allocation section 20 has proceeded with the initial allocation and it is now time to allocate work (2) to equipment C. Here, the initial allocation constraint condition storage unit 21
Assume that an allocatable section as shown in the figure is determined based on the conditions. At this time, where to allocate the job (2) within the possible range is selected based on the characteristic value total leveling method stored in the characteristic value total leveling method storage unit 50. This characteristic value total leveling method is a simple one that finds the point in the possible interval where the total characteristic value of the jobs assigned so far is farthest from the upper limit, and assigns it there. . That is, it is called a leveling method because it is allocated so as to fill in the lowest hole in the graph of the sum of characteristic values in the target section.

In FIG. 4, the work ■ is allocated so that it falls within the interval from time 3 to time 5, which has the lowest total characteristic value. At this time,
Whether to shift to the left or to the right in the same section is selected in advance before scheduling starts. Note that when the time width of work (2) is smaller than the interval which is farther from the upper limit of the total characteristic value, the latter interval shall be included in the allocation. By applying such a method at the time of initial allocation, the probability that the total characteristic value has a flat shape at the end of allocation, which will be described later, increases. In other words, the probability that a portion unavoidably exceeds the upper limit will occur becomes smaller.

Next, in the adjustment allocation unit 30, the initial allocation constraint condition storage unit 2
1 and each constraint stored in the adjustment allocation constraint storage unit 31, the initial allocation unit
The allocation resulting from the initial allocation using 0 is corrected.

Finally, the allocation result output unit 40 prints out the adjusted allocation results from the adjustment allocation unit 30 to a printer (not shown) connected to the scheduling apparatus or to a CRT so that the user of the scheduling apparatus can recognize them. It is output as a display output etc.

As mentioned above, in the scheduling device of this embodiment, the constraints regarding the sum of characteristic values of jobs are taken into consideration at the stage of assigning jobs in the initial assignment, and the total characteristic value sum does not require much time for processing. Since a leveling method (selecting a position where the total characteristic value is equalized or below the upper limit) is applied, processing efficiency to satisfy the same conditions in adjustment allocation is improved, and overall scheduling efficiency is improved. It becomes possible to significantly increase the

Here, it is important that the processing of this total characteristic value leveling method does not require much time. This is because even if this method improves the efficiency of adjustment allocation compared to conventional scheduling devices, if the efficiency of initial allocation decreases significantly, the efficiency of the entire device will deteriorate and it is meaningless. In other words, it is necessary to improve the efficiency of adjustment allocation through simple processing. In this respect, the scheduling device of the present embodiment can reduce the effort required to break down the mountain due to adjustment allocation, so it improves the processing efficiency to satisfy the same conditions in adjustment allocation.
This makes it possible to significantly improve the overall scheduling efficiency.

In the above embodiment, when there are multiple characteristic values, for example, when there are raw materials and electric power as shown in FIG. Before starting scheduling, it is necessary to select what to do when there is no overlap.

Examples of options for this process are shown below.

(1) Assume that power is given unconditional priority in advance (and vice versa) (2) Priority is given to the one with the larger ratio of the distance that is farthest from the upper limit divided by the upper limit [Effects of the invention As explained above, this book According to the invention, when performing initial allocation, a limit value is set for the total characteristic value of the task group to be allocated at that time for each time on the target time axis, and the characteristics are adjusted so as to fall within the limit. Since the allocation is performed using the total value leveling method, the processing efficiency for satisfying the same conditions in adjusted allocation is improved, and the overall scheduling efficiency can be significantly improved.It is extremely reliable. A scheduling device can be provided.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of a scheduling device according to the present invention, FIG. 2 is a block diagram showing a configuration example of a conventional scheduling device, and FIG. 3 is a diagram for explaining the operation of a conventional scheduling device. , FIG. 4 is a diagram for explaining the processing contents of the present invention and the conventional scheduling device. DESCRIPTION OF SYMBOLS 10... Job information input reception part, 20... Initial allocation part, 21... Initial allocation constraint condition storage part, 22... Initial allocation method storage part, 30... Adjustment allocation part, 31... - Adjustment allocation constraint condition storage unit, 32...Adjustment allocation method storage unit, 40...Allocation result output unit, 50...Characteristic value total leveling method storage unit. Applicant's agent Patent attorney Takehiko Suzue

Claims (1)

[Scope of Claims] In a scheduling device that allocates requested work to people and equipment while satisfying various conditions and creates a schedule, there is provided work information input receiving means for receiving input of work information to be scheduled. , an initial allocation constraint storage means storing constraint conditions for performing initial allocation, an adjustment allocation constraint storage means storing constraints for performing adjustment allocation, and a method for performing initial allocation. an initial allocation method storage means storing a method for leveling the total characteristic value of the job; a total characteristic value leveling method storage means storing a method for leveling the total characteristic value of the job; and job information accepted by the job information input reception means. while referring to the constraints stored in the initial allocation constraint storage means and the constraints regarding the total of job characteristic values stored in the adjustment allocation constraint storage means. an initial allocation means that performs initial allocation based on the method stored in the storage means and the leveling method stored in the total characteristic value leveling method storage means; and the initial allocation constraint storage means and the adjustment allocation constraint storage means. While referring to each stored constraint condition,
Adjustment allocation means for correcting the allocation of the initial allocation result by the initial allocation means based on the method stored in the adjustment allocation method storage means; and allocation result output for outputting the adjusted allocation result by the adjustment allocation means to the outside. A scheduling device comprising: means;