JPH0523955A - Production quota indicating system - Google Patents

Abstract

PURPOSE:To determine the most rational quota by searching such one that the maximum among slippages being produced in each production line turns to the minimum, and indicating the quota based on this search result. CONSTITUTION:In consideration of all thinkable quotas, among those, such one as most congruous with the prescribed number is searched. In this case, the most congruous combination is searched, and such a slippage as yet produced even so is calculated. This slippage is calculated in regard to all production lines 1-M, and such a combination that the maximum value of the slippage turns to the minimum is searched. With this constitution, this combination - the maximum slippage turns to the minimum is searched, thus the most rational quota is securable in this way.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention can be applied to a factory equipped with two or more production lines to produce two or more product groups including types that can be produced by any of the two or more production lines. The present invention relates to a device for assigning and instructing which production line is used to produce a type. In particular, the present invention provides the required number of productions for each type of product, and when the total number of productions planned for each production line is given for each production line, the number of productions that is as close as possible to the planned number is produced. The present invention relates to a device for calculating and instructing an obtained allocation.

[0002]

2. Description of the Related Art For example, in a production plant having three production lines 1, 2 and 3 as shown in FIG. 1, any of two or more production lines can be produced as shown in FIG. When producing a plurality of types of product groups including types of products (the products 1, 2, 6, etc. in the example of FIG. 2), it is necessary to assign which type is used for which production line. is there. Especially when the planned production number is given to each production line, if not allocated very well, there will be a production line that makes more products than the planned number or a production line that makes less products than the planned number. It is not preferable in terms of production control.

To deal with this problem, Japanese Patent Laid-Open No. 1-22
The technique described in Japanese Patent No. 16403 has been proposed. According to the technique described in this publication, a veteran production manager creates various types of production plan / production plan correspondence tables in advance and stores them in a database called a rule base. When the actual production plan is instructed, the corresponding production plan is retrieved from this database, and the production plan is determined based on this.

[0004]

However, the manufacturing plan used in the technique described in the publication is created by the person in charge of production management on the basis of experience and perception, and it is not always guaranteed that it is optimal. Absent. Therefore, the present invention has decided to develop a device that can instruct production allocation using a more rational method.

[0005]

Therefore, in the present invention, a production allocation instructing device x whose concept is schematically shown in FIG. 20 is created. This production allocation instructing device x has two or more production lines (where M is the total number of production lines, M is 2).
When producing a product group d of two or more types (which are referred to as N types) including a product of a type that can be produced by two or more production lines in the factory c having the above integer), the production line Is a device that assigns and specifies the type.

The production allocation instructing device x has the following means. e: means for storing a production line capable of producing the type for each type (1 to N) f; means for inputting and storing the required number of productions for each type g; each production line ( 1 to M) means for inputting and storing the planned production quantity for each production line h; for each production line, subtracting the required production quantity of the type that can be produced only by the production line from the production quantity planned for each production line A means to calculate the number of production capacity and store it

K; means for calculating a combination of search procedures of factorial (M!) Sets of the total number (M) of production lines, in which each search procedure is composed of permutations of all production lines. Where a is an arbitrary integer from 1 to M !, and the search target production line P (a, b) in the b-th search order (where b is an arbitrary integer from 1 to M)
Means for calculating. Here, P (a, 1) to P (a, M) are given in permutation of M, and this permutation is M! There are street combinations. k, s, v; b is incremented by 1 from 1 to M-1, and a is incremented from 1 to M! Means for instructing the search target production line P (a, b) while incrementing by 1 each time b reaches M−1, that is, P (1,1), P (1,2) ,. ... P (1, M-1) P (2, 1), P (2, 2), ... P (2, M-1) --- --- --- --- --- −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− P (M !, 1), P (M , 2), ... P (M !, M-1) in order of the production lines to be searched.

Q: When the production line P (a, b) to be searched is designated, the production lines P (a, 1) to P (a, 1)
A production line of P (a, b-1) that is not allocated by (a, b-1) and that can be produced only by the production lines P (a, b-1) and P (a, b). Other than the type not assigned to the search target production line P
Among the combinations of the required production numbers of the types that can be produced in (a, b), the combination of the types that minimizes the deviation from the corrected production capacity of the production line P (a, b) is searched, and A means for allocating the type of time to the production line P (a, b) and storing the minimum deviation E (a, P (a, b)) at that time r; the production line P (a, b) and the production line P (A, b +
Production line P (a, b) with a type that can only be produced in 1)
Means for allocating a type that cannot be assigned to the production line P (a, b + 1) and subtracting the required production quantity of the assigned type from the production capacity of the production line P (a, b + 1) to correct the production capacity. For the same a, assigning to the production line P (a, M) a type that was not assigned to any production line while b changed from 1 to M-1, and required production of the assigned type Number and the production line P (a,
Means for storing the deviation E (a, P (a, M)) from the production surplus number of M) u; For the same a, the deviation E calculated while b changes from 1 to M-1 (A, P (a, 1)) to E
Means for searching maximum value EMAX (a) in (a, P (a, M)) w; a is 1 to M! Means for searching the value of a when the minimum value is obtained from the maximum deviation values EMAX (1) to EMAX (M!) Calculated during the change

[0009]

According to the production allocation instructing means x of the present invention, the means h
Then, the number of surplus production capacity for each production line is calculated and stored. On the other hand, the search procedure constituted by the permutation of all production lines by means k is M! Calculated as follows. When M integers 1 to M are arranged, the permutation is M! Since there are passages, all combinations of permutations are calculated here. Where means s
So, first M! Of the common search procedures, the search target production line when the first search procedure is followed, that is, P (1,1), P (1,2), ... Instructed by k. First, P (1,
When the production target line of 1) is designated from the means k, the means q produces the P (1,1) out of the combination of the required production numbers of the types that can be produced on the production line of the P (1,1). The combination with the smallest deviation from the production capacity of the line is searched. As a result, the line P (1,1) is searched for the allocation closest to the planned production quantity, and the deviation at that time is stored as E (1, P (1,1)). Here, the deviation E (1, P (1,1)) corresponds to the deviation from the planned production quantity when the production lines in the first search order of the first search procedure are allocated so that the deviations are minimized. To do.

Next, a search is performed on the production line in the second search order. Here, the types that can be produced only by the production line in the first search order and the production line in the second search order, and the types that cannot be assigned to the production line in the first search order have to be assigned to the production line in the second search order. Therefore, the means r carries out this allocation, and subtracts the required production quantity of the allocated type from the production capacity of the production line in the second search order to correct the actual production capacity.

Then, the means q performs the search for the production line in the second search order. Here, the types already assigned to the production line in the first search order are excluded, and the types assigned to the production line in the second search order by means r are also excluded. Among the combinations of the required production numbers of the types that can be produced in the sequential production line, the combination that minimizes the deviation from the production capacity of the production line in the second search sequence corrected by the means r is searched. This result line P
Among the types of combinations that may or may not be allocated to (1,2), the allocation that is closest to the planned production quantity of line P (1,2) is searched, and the deviation at that time is E (1, P).
(1, 2)). Deviation E (1, P
(1,2) is a condition when the allocation to the production line in the first search order of the first search procedure is a precondition, and the allocation to the production line in the second search order is such that the deviation is minimized. It corresponds to the gap with the planned production number.

Similarly, the optimum allocation to the production lines in the third search order of the first search procedure and the deviation E (1, P (1, 3)) at that time, the fourth, fifth, sixth, ... M-
The optimum allocation to the production line in the search order of 1 and the deviation at that time are calculated and stored. This result is shown in Figure 2.
Deviation shown in 1 E (1, P (1,1)) ... E (1, P
(1, M-1) is stored. After the allocation to the production lines in the M-1th search order is performed, the types not allocated to any of the production lines by the means t are allocated to the production lines in the Mth search order, and the total number of required productions and that line are assigned. Deviation of the number of production capacity of E (1, P (1,
M)) is calculated.

In this way, according to the first search procedure, first, the combination that minimizes the deviation of the production lines in the first search order is specified, and the deviation E (1, P (1,
1)) is calculated, then the combination that minimizes the deviation of the production line in the second search order is specified, and the deviation E at that time is identified.
(1, P (1, 2)) is calculated, and the search is performed one after another, and the combination that minimizes the deviation of the production line in the (M-1) th search order is specified. P
(1, M-1)) is calculated, and the deviation E (1, P (1, M)) of the production line in the final search order is calculated.

Then, by means u, E (1, P in FIG.
The maximum value is searched from among (1,1)) to E (1, P (1, M)), and this is stored in EMAX (1).
The above processing is M! The maximum value EMAX for each search procedure as a result of being executed for all search procedures
(1) to EMAX (M!) Are calculated.

Here, EMAX corresponds to the maximum deviation that occurs in any of the production lines when optimally allocated according to each search procedure. And by means w
The minimum value of a is searched from EMAX (1) to EMAX (M!) In FIG. Where the value a is
It shows the search procedure that minimizes the maximum deviation that occurs when optimally allocated to the production line, and when allocated according to this search procedure, the maximum value of the deviations that occur in each production line is This corresponds to the smallest case of all possible allocations. Therefore, according to the present invention, the allocation that minimizes the maximum deviation is calculated, and the rational allocation that minimizes the deviation from the planned production quantity is calculated.

[0016]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, a specific example of the present invention will be described with reference to FIGS. FIG. 1 shows a factory layout in which the present allocation instruction device is incorporated, and has three production lines 1, 2, and 3. Each of the production lines 1, 2 and 3 is connected to a raw material storage 4 via a raw material conveying device 5. The end of each production line is connected to the product storage 7 via the product transport device 6.

Production instruction controllers 11, 12, and 13 are arranged on the production lines 1, 2, and 3, and the controllers 11, 12, and 13 are connected to a host computer 10. The host computer 10 is the main body of the production allocation device, and the host computer 1
0 assigns which product is produced on which production line. The result of allocation is the production instruction controller 1
1, 12 and 13 are transmitted to each controller 11, 1
Assignment results are instructed to 2 and 13. In addition, the rough material conveying device 5
Is controlled according to this allocation and conveys the rough material for the products assigned to each production line to that production line.

FIG. 2 exemplifies the relationship between 15 types of products produced in this factory and the production lines capable of producing the products. For example, a product of type 1 can be produced on both production lines 1 and 2. It shows that there is. This data is stored in the host computer 10. FIG. 3 exemplifies the required number of products that must be produced in this factory within a predetermined period for each type. For example, type 1 is 250
It shows that it is necessary to produce individually. This data is input from the input device of the host computer 10 and stored in the host computer 10. The process procedure diagram of FIG. 18 shows the flow of the process executed by this production allocation instructing device, and the input of the required production number is executed in step S2. Note that the processing procedure in FIG. 18 is generalized and illustrated when N types of product groups are produced by M production lines.

FIG. 4 shows an example of the planned production quantity for each production line, and shows that, for example, production line 1 is planned to produce 500 pieces. This is for the operator to refer to the operating state of the factory to calculate and determine the load for each production line, and this data is stored in the host computer 10 using the input device of the host computer 10. This is executed in step S4 of FIG.

Step S6 of FIG. 18 is for determining whether or not the operator has input a proper value in step S4. The total number of required productions ΣF (i) and the total number of planned productions ΣG (j). If the values are not equal, ask the operator to set the planned number again. This processing is to prevent the operator from setting an unrealistic scheduled number, and an expression that makes "yes" when they are approximately equal may be used.

FIG. 5 shows the types that can be produced only by one production line, the required number of productions, and the total number P of the required productions.
(J) is illustrated, and the total number P (j) is calculated in step S8 of FIG. Step S10 in FIG. 18 is to subtract the total number P (j) of the required production numbers for the types having no other allocation method from the planned production number G (j) for each production line. A process of calculating and storing the number of remaining production capacity H (j) of each production line is executed. This surplus production number corresponds to the allocatable number, which is illustrated in the bottom row of FIG.

FIG. 6 exemplifies the relationship between the types that can be produced on two or more production lines, the required number of productions, and the producible line, and the relation between the production capacity of the producible line. In the illustrated example, products 1 and 7 may be assigned to any of lines 1 and 2, products 2, 9 and 15 may be assigned to any of lines 2 and 3, and products 6 and 14 may be assigned to lines 1 and 3. It is shown that the total number of required production numbers of the types assigned to each line at this time should be assigned so as to best approximate the remaining production capacity.

After step S12 in FIG. 18, there is shown a procedure for searching the most approximate allocation. Prior to describing this, a more specific description will be given with reference to FIGS. In FIG. 7, first, the production line 1 is searched for the allocation that minimizes the deviation from the planned number, then the production line 2 is searched, and finally the type that cannot be allocated to the first and second production lines is the third production line. This is an example of the process until the line 3 is assigned. First, the type that can be assigned to the line 1 is searched in the column 71. Figure 6
In the case illustrated in (1), since the types 1, 7, 6, 14 can be produced in the line 1, these four types are searched.

FIG. 8 exemplifies a combination of required production numbers of the types listed in the column 71 of FIG.
Column 81 is assigned 0 types, column 82 is assigned 1 type, column 83 is assigned 2 types, column 84 is assigned 3 types, column 85 is 4 types.
The figure shows the case where all species are assigned. And column 86
The total number of required productions of the type assigned to is shown. A column 87 shows a deviation from the number to be assigned to the production line 1, that is, the remaining production capacity (440 in this case), and in this case, the deviation 10 between the column * 1 and the column * 2 is shown to be the minimum. Has been done. This gap 1
0 corresponds to E (1, P (1, 1)) of the present invention. From this, when types 1 and 7 are assigned to production line 1,
It is understood that when the types 6 and 14 are assigned, it is possible to bring the number to be the closest to the planned production number, and the deviation at this time is 10.

A line 72 in FIG. 7 shows a case where the types 1 and 7 are assigned to the production line 1 based on the search result * 1 in FIG. A column 73 shows the type of the production line to be searched next as a result of the allocation to the production line 1, that is, the production line 2 in this case. In this case, of the types that can be produced only by the production lines 1 and 2, the types that are not produced on the production line 1 are produced on the production line 2 and are searched. In the case of this example, the types that can be produced only on the production lines 1 and 2 are 1 and 7, and as a result of assigning both of them to the production line 1, there is no corresponding type.

On the other hand, the column 77 shows the case where the types 6 and 14 are assigned to the production line 1 based on the search result of * 2 in FIG. 8, and in this case, production can be performed only on the production lines 1 and 2. As a result that neither type 1 nor type 7 is assigned to production line 1, types 1 and 7 are assigned to line 2 only. Here, the value shown in the column 78a is
New production line 2 from the production capacity 410 of production line 2
It is obtained by subtracting the total number 450 of the required production numbers of the types allocated to, and this is the new production capacity number.

The column 79 in FIG. 7 shows the production line 1 of the types 1, 7, 2, 9, 15 which can be produced on the production line 2.
Shows the types other than the types 1 and 7 that are no longer available except the products 6 and 14 assigned to the production line 2 and the production line 2 shown in the column 78. This is the type that can be assigned to the production line 2 at this stage. Shows.

FIG. 9 shows all combinations of required production numbers of allocatable types, and column 91 shows the total number of required production numbers for all combinations of allocatable types. The column 93 shows the difference between this total number and the surplus production capacity shown in the column 78a. In this case, the surplus production capacity is -40.
Since a larger number than the planned number has already been allocated to the production line 2, the deviation is minimized when none of them is allocated as shown in * 4. This deviation 40 (the deviation may be an absolute value) becomes E (1, P (1, 2)) of the present invention.

Column 79a in FIG. 7 indicates that no line 2 is assigned based on the search result * 4 in FIG. Column 79b of FIG. 7 illustrates that a type that cannot be assigned to either line 1 or 2 is assigned to the remaining production line 3, in which case the total number of required productions of the assigned type is 420. It shows that the difference from the production capacity is 50. Column 74 of FIG. 7 shows the types that can be assigned to line 2 when line 1 is assigned based on the search result of * 1 in FIG.
It agrees with 9. Here, as shown in column 73, there is no type other than that assigned to line 2,
The production capacity of line 2 remains at 410. Therefore, in the column 92 of FIG. 9, the combination of the required production numbers of the types that can be assigned to the line 2 and the deviation of the surplus production capacity (410 pieces) are displayed.
It shows that when all 15 are allocated (* 3 column), the deviation is minimized. Therefore, as shown in the column 75, all the types 2, 9, and 15 are assigned to the line 2. Finally, the types remaining in line 3 are assigned. In this case, 450 pieces are assigned to the production line 3 as shown in the column 76a, and the deviation E (1, P (1, 3)) becomes 20.

The left half of FIG. 10 is the production line 1, which is shown in FIG.
Figure 1 shows the process of searching 1 and then the allocation of line 3 and allocating the rest to line 2. The right half searches production line 1 for * 2, then the allocation of line 3 and the remaining line FIG. 11 is a diagram showing the process of assigning to 2
Shows the process of searching the combination of the required production numbers of types 2, 9, and 15 which can be assigned to the line 3 in the search process for the line 3 and which has the smallest deviation from the production capacity of the line 3. There is. Here, in the case of * 1, among the types 6 and 14 that can be produced only in the lines 1 and 3, 6 and 14 cannot be assigned to the line 1, so the line 3 is assigned. Has been revised to 20 (see column 11). Therefore, in the case of * 1, the deviation is minimized when none of the types 2, 9, and 15 is assigned to the line 3 (see * 5 in column 11a), while in the case of * 2, it is shown in the column 11b. As described above, the deviation is minimized when the allocation is * 6.

FIG. 12 is a diagram showing the process of searching in the order of lines 2 → 3 → 1, the right half of FIG. 12 is a diagram showing the process of searching in the order of lines 2 → 1 → 3, and FIG. 13 is the type assigned to line 2. Shows the process of searching. Further, FIG. 14 is a diagram showing the process of searching in the order of lines 3 → 1 → 2, FIG.
The right half of FIG. 4 is a diagram showing the process of searching in the order of line 3 → 2 → 1 and FIG. 15 shows the process of searching for the type assigned to line 3.

The results of the above search are summarized in FIG. 16. Each search procedure, in this case 1 → 2 → 3, 1 → 3 →
2, 2 → 3 → 1, 2 → 1 → 3, 3 → 1 → 2, 3 → 2 → 1
The value of the minimum deviation E when following the six types of search procedures and the maximum deviation EMAX in one search procedure are shown. In this embodiment, when searching line 1,
Since there are two allocations in which the minimum values of the deviations are equal, the subsequent search is performed for each of them.
As a result, when the types are assigned in accordance with the search procedure indicated by * in FIG. 16, it can be seen that the assignments that can be suppressed to 20 deviations at the maximum can be obtained, and there is no allocation that suppresses deviations more than this allocation. In this case, when the search procedure marked with * is followed, the same allocation is eventually carried out by any search procedure. FIG. 17 shows the result of this allocation, where line 1 has types 1, 7 and line 2
It is shown that the most rational allocation is carried out when allocating types 2, 9, 15 and types 6, 14 to line 3.

After step S12 of FIG. 18, the above-described search procedure for allocation is shown as a generalized step. Steps S18, S20 and S22 are for the b-th search order of the a-th search procedure. It is for carrying out a processing procedure for determining the allocation to the production line. This process is executed by incrementing b from 1 to M-1 by 1 in steps S14 and S24, and steps b12 and S14 are performed each time b reaches M-1.
While a is incremented by 1 by 30, a is 1 to M! Is repeated until.

In step S16, the production line P (a, b) to be searched is determined when a and b are determined. As shown in FIG. It consists of permutations in which integers are arranged in arbitrary order, and this permutation is M! The process of designating the production line P (a, b) to be searched in the b search order of the a search procedure from among the existing sets is executed.

Step S18 is b in the a-th search procedure.
The type that can be assigned to the production line P (a, b) in the second search order, that is, production can be performed on the production line, b-1
B-1 with a type that is not allocated to the production line in the search sequence of the 2nd search order and can be produced only in the production line in the search sequence of the b-1st search sequence and the production line in the bth search sequence
8, 9, 11, 1 among the types other than the type not assigned to the production line in the search order (which has no choice but to be assigned to the b-th line).
As exemplified in Nos. 3 and 15, a combination that minimizes the deviation from the actual production capacity of the production line is searched, and the type at that time is assigned to this production line. The deviation at this time, that is, the deviation at the most reasonable allocation is E
It is stored as (a, P (a, b)).

Step S20 is b in the a-th search procedure.
Among the types that can be produced only by the production line P (a, b) in the second search order and the production line P (a, b + 1) in the next search order, they are not assigned to the line P (a, b) in step S18. Forcibly select the type of line P (a, b + 1)
Assign to. As a result of this processing, when b is incremented by 1 and step S18 is executed next, the types that have no room for selection are excluded from the search target. Further, in step S22, as a result of the compulsory allocation in step S20, the production surplus number of the line P (a, b + 1) is corrected correctly.

The process is repeated by incrementing b from 1 to M-1 by 1 for the same a, thereby making a difference E (a, P (a, 1)), E.
(A, P (a, 2)) ... E (a, P (a, M-1)) is calculated. Then, in step S26, the types that cannot be assigned to any of the production lines are assigned to the remaining production lines, and the deviation E (a, a between the remaining production capacity of the line and the total required production number of the types assigned to the line is assigned. P (a,
M)) is calculated.

Then, in step S28, the deviation E (a, P
The maximum value of (a, 1)) to E (a, P (a, M)) is searched, and this maximum value is stored in EMAX (a). This step S28 is repeated for all a's by steps S12 and S30, and when step S30 proceeds to step S32, EMAX (1) to EMAX (M!) Are calculated. Then, in step S32, the minimum search procedure is searched from these, and the case where the optimum production allocation is obtained is determined. Thereby, by step S34,
Optimal production quotas are determined and indicated.

Now, in the present embodiment, the combination that minimizes the deviation is searched for each production line, and the maximum deviation when the minimization is performed among all the production lines is searched. The search procedure in which the maximum deviation searched for is minimized is searched. The result of searching in this way is
The deviation that must occur in reality is suppressed to the minimum, and a reasonable combination is determined. In the present invention, when there is no type that can be manufactured by only one production line, that is, in the special case where all types handled can be produced by two or more production lines, the surplus production capacity h
Please note that is unnecessary.

[0040]

As described above, according to the present invention, the allocation that minimizes the largest deviation among the production lines is searched for, and the allocation based on the search result is instructed. The proportion is determined. Therefore, even if the allocation is extremely difficult due to the large number of production lines or the large number of product types, the rational allocation is automatically instructed, and the production management is significantly streamlined.

[Brief description of drawings]

FIG. 1 is a diagram showing a system configuration of an embodiment.

FIG. 2 is a diagram illustrating a relationship between product types and producible lines.

FIG. 3 is a diagram illustrating an example of the required production quantity of product types.

FIG. 4 is a diagram exemplifying a planned production quantity by line.

FIG. 5 is a diagram exemplifying types that can be produced only by one production line and the number of surplus production capacity.

FIG. 6 is a diagram exemplifying a type to be assigned and a production surplus number to be assigned and approximated.

FIG. 7 is a diagram exemplifying a search process when searching in the order of lines 1 → 2 → 3.

8 is a diagram exemplifying a process of searching for a type assigned to line 1 in the search of FIG.

9 is a diagram exemplifying a process of searching a type assigned to line 2 in the search of FIG.

FIG. 10 is a view exemplifying a search progress when searching in the order of lines 1 → 3 → 2.

11 is a diagram exemplifying a process of searching a type assigned to line 3 in the search of FIG.

FIG. 12 is a view exemplifying a search progress when searching in the order of lines 2 → 3 → 1, 2 → 1 → 3.

FIG. 13 is a view exemplifying the progress of searching for a type assigned to line 2 in the search of FIG. 12;

FIG. 14 is a view exemplifying a search progress when searching in the order of lines 3 → 1 → 2, 3 → 2 → 1.

FIG. 15 is a view exemplifying the progress of searching for a type assigned to line 3 in the search of FIG. 14;

FIG. 16 is a maximum deviation EMAX when following each search procedure.
The figure which illustrates (1) -EMAX (6).

FIG. 17 is a diagram illustrating a final allocation result.

FIG. 18 shows the search procedure of the present invention in which M production lines and N production lines are used.
The figure generalized and shown to a product of a kind.

FIG. 19 is a diagram exemplifying a combination of search procedures.

FIG. 20 is a diagram schematically showing the concept of the present invention.

FIG. 21 is a diagram schematically showing a searched minimum shift and maximum shift.

[Explanation of symbols]

 c Factory d Product group e Type-manufacturable line correspondence storage means f Type-required production quantity input storage means g Production line-scheduled production quantity input storage means h Production line-remaining production capacity storage means k Search step calculation / search target Production line instructing means q Minimum deviation search storage means r Next search order Production line allocation / remaining production capacity correction means s 1st to M-1th search order repeating means t Final search order deviation calculation storage means u Maximum value search means v 1st ~ Mth! Search procedure repeating means w Minimum value searching means

Claims (1)

What is claimed is: 1. A factory equipped with two or more production lines.
When producing two or more types of product groups including types that can be produced on the above production lines, when the required production number for each type and the planned production number for each production line are given, which type is selected? A device for assigning and instructing which production line to produce, a means for storing for each type a production line capable of producing that type, and a storage by inputting the required number of productions for each type And the means for inputting and storing the planned production quantity for each production line, and subtracting the required quantity of the types that can only be produced on the production line from the planned production quantity for each production line. A means for calculating and storing the number of spare capacity of each production line and calculating a combination of the search procedures of the factorial group of the total number of production lines, in which each search procedure is composed of permutations of all production lines,
B-th a-th search procedure (where a is an arbitrary integer from 1 to M !, where M is the total number of production lines)
When the production line in the search order (where b is any integer from 1 to M) is P (a, b), b is 1
From M to M-1 by 1 and a from 1 to M! Means for instructing the search target production line P (a, b) while incrementing by 1 each time b reaches M−1, and when the search target production line P (a, b) is instructed Lines P (a, 1) to P (a, b-1) are not assigned and the production line P (a, b-
1) and P (a, b) are the types that can be produced only by P (a,
b-1) The production line P (a, a) is selected from the combinations of the required production numbers of types other than the types not assigned to the production line and which can be produced on the search target production line P (a, b). b) The combination of the type that minimizes the deviation from the corrected production capacity is searched, the type at that time is assigned to the production line P (a, b), and the minimum deviation E (a, P) at that time is searched. (A, b)) storing means, production line P (a, b) and production line P (a, b + 1)
The types that can only be produced in the production line P (a, b) and that cannot be assigned to the production line P (a, b + 1) are assigned to the production line P (a, b + 1), and the required number of productions of the assigned types is assigned to the production line P.
(A, b + 1) means for correcting the remaining capacity by subtracting the remaining capacity from the remaining capacity, and the same a, but not assigned to any production line while b changes from 1 to M-1 Is allocated to the production line P (a, M), and the deviation E (a, P (a, M) between the total number of required productions of the allocated type and the production capacity of the production line P (a, M). ) For the same a, the deviations E (a, P (a, 1)) to E (a, P) calculated while b changes from 1 to M−1 for the same a.
Means for searching the maximum value EMAX (a) in P (a, M)), and a is 1 to M! A maximum value EMAX (1) to EMAX (M!) Calculated during the change to the value of a when it becomes the minimum value, and a production allocation instructing device.