JP2697630B2 - Level-by-level development method for material requirements planning - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a level-by-level development method for material requirement planning, and in particular, demand information generated for items on a bill of materials in the order of low-level codes of the bill of materials from a requirement plan of a product. Is registered in a management table, required demand information is extracted from the management table, and an ordering process for determining a required time and a required amount of material is performed.

[0002]

2. Description of the Related Art A conventional level-by-level development method for material requirement planning is disclosed in JP-A-03-287.
There is an arrangement planning support system using a high-speed MRP method disclosed in Japanese Patent Application Laid-Open No. 357, and a required amount development system using a heap sort method disclosed in Japanese Patent Application Laid-Open No. 03-094326.

FIG. 3 is an explanatory diagram of a BOM model used in a conventional level-by-level development method for material requirement planning. Items X and Y are low-level code = 1, that is, product-level items, and items A, B, C, D, and E are:
Low level code = 2, items a, b, c, d, e, f,
g, h, and i are low-level codes = 3. Item X
Is composed of intermediate items A, B and C, and the item Y is composed of intermediate items C, D and E and a part a. Intermediate item A is made up of parts d and e, and intermediate item B is made up of parts b and
The intermediate item C is composed of parts a and b, the intermediate item D is composed of parts f and g, and the intermediate item E is composed of parts a, h and i.

[0004] When a production plan has been drafted for the items X and Y, the required quantities of lower-level items are calculated by the following procedure. First, demands (when and how many are required) of intermediate items A, B, and C are generated from the order of item X. next,
From the order of the item Y, the demands of the intermediate items C, D, E and the part a are generated. When the processing of the low-level code = 1 item is completed, the ordering processing of the low-level code = 2 intermediate items is performed.
An expansion to lower-order items, that is, a demand for parts with a low-level code = 3 is generated. When the processing of the intermediate item with the low-level code = 2 is completed, finally, the low-level code =
The ordering process of the part No. 3 is performed. This is a level-by-level development. At this time, since the part a having the low level code = 3 is a common part of the item Y and the intermediate items C and E, the demand of the part a is obtained after the ordering process of the item Y and after the ordering process of the intermediate item C. Is generated after the ordering processing of the intermediate item E.

FIG. 4 is a conventional level-by-level development method for material requirement planning using the BOM model shown in FIG. 3, which is created on a disk of an external storage device of a computer that executes this method. It is a figure of a demand file. FIG.
Demand file is item number 12, parent item number 1
3, the required date 14, the quantity 15, and other demand information. Demand information generated from a plurality of parent items of a certain item is written to a demand file in the order in which the parent item ordering process was performed. For example, the demand of the part a is the parent item Y, C, E
After the ordering process, the data was once written in the demand file shown in FIG. When the ordering process of the part a is started, the demand file is read into the memory of the computer, and the demands generated from a plurality of parent items are sorted using the required date as a key, and then the order is generated.

[0006]

According to the above-described conventional level-by-level development method for material requirement planning, demand information generated for each item is stored in a demand file in the order in which parent item ordering processing is performed. Store it in this order until the ordering process for this item starts, store it in the demand file, read the demand information at the start of the ordering process, and sort using the low level code, item number, required date, etc. as a key. In order to do, the demand information is read /
There is a problem that the writing time and the sorting time of the demand information are required, and the processing time becomes long.

[0007]

A level-by-level development method for material requirement planning according to the present invention requires an item number for identifying an item, a low-level code indicating an absolute level in an item bill of the item, and an item. In the initial state, the same value as the corresponding order is written in each of the key portions for registering the demand information including the required time of the certain time at a plurality of positions arranged in order and in each of the plurality of positions arranged in order. And a level-by-level expansion management table having an entry point in which (the number of registered codes + 1) is written in an initial state, and the level-by-level expansion management table is newly added to the level-by-level expansion management table. When registering demand information, the following processes (1) to (5) are performed. (1) First, a sub-table of the order of the entry point values To position the key part of the value of the position of the sequence registers the demand information. (2) The order of the position of the key part in which the demand information is registered in the processing of (1) is j. (3) For j determined in the processing of (2) or (4), i is set to a value equal to j / 2 (an integer whose fraction is rounded down). (4) With respect to j and i determined in the processes of (3) and (4), the contents I and J of the i-th and j-th positions of the key portion are compared according to a predetermined order, and if I ≦ J In the case, the end processing of (5) is performed, and when I> J, the key part i
Swap the contents at the j-th position and the j-th position, and replace j with i
And returns to the process of (3). (5) Finally, as an end process, 1 is added to the value of the entry point.

When the demand information is extracted from the level-by-level expansion management table, the following (1) to
The processing of (5) is performed. (1) First, the demand information which is the content of the first position of the key portion is extracted. (2) After the processing of (1), initial values of 1, 2, and 3 are set for i, j, and k, respectively. (3) The contents J and K of the j-th and k-th positions of the key part are compared with i, j and k determined in the processing of (2) or (4) in accordance with the above-described order, and J <K is satisfied. In this case, the content J of the j-th position of the key portion is substituted into the i-th position to make i equal to j, and then the process of (4) is performed. the content K of the kth position
Is substituted into the i-th position, i is set to a value equal to k, and then the processing of (4) is performed. When J = K, a code indicating that the i-th position of the key portion is vacant is obtained. Then, the end processing of (5) is performed. (4) For j determined in the process of (3), j is i * 2
, And k is set to a value equal to j + 1, and the process returns to (3). (5) Finally, as an end process, a code indicating that the key portion is vacant at the i-th position is written, and 1 is subtracted from the value of the entry point. Substitute i.

[0009]

Next, the present invention will be described in detail with reference to the drawings.

FIG. 1 is a diagram of a level-by-level management table used in one embodiment of the present invention. The ordering process including the calculation of the required amount of each item is performed for each item together with the required date of the constituent items, etc., and the required amount is obtained as demand information according to the low level code indicating the level on the bill of material. After all the high-order items are performed, the demand information is extracted in a predetermined order defined by the low-level code, the item number, and the like. Therefore, the demand information generated for each higher-level item at each level is securely stored in the memory until the item is subjected to the ordering processing of each item, and the low-level code, the item number, the information category, the group key, the required date and time are required. It must be kept sortable by key items such as days. What realizes the above on the memory is the level-by-level management table. When performing an ordering process for a certain item, the corresponding demand information is extracted from the level-by-level management table into the ordering table.

The level-by-level management table shown in FIG. 1 is a state in which 2500 items have been registered continuously from the initial state, and a main table 1 which is an area for physically storing / saving information; The sub-table 2 is an area for controlling one entry point. The main table 1 includes a key section 3 for storing key information of demand information generated for an item and a data section 4 for demand information. The key section 3 includes a relative position 5 indicating a position of data in the main table,
Low level code 6 of the item, item number 7 indicating the address in the item information table, information section 8 indicating whether or not to expand to lower order items, group key 9 as serial number information, and year in which demand occurs Required date indicating the date 10
Key item is provided. The data section 4 includes other demand information such as a required amount, an arranged quantity, and a demand status.

The sub table 2 stores a main table address 11 indicating a relative position in the main table 1 where demand information is to be registered. In the initial state, a corresponding relative position in the main table 1 is stored in each of the main table addresses 11 as shown in FIG. The entry point 16 indicates a relative position of the main table 11 in the sub table 2, and the main table address 1 indicated by the entry point 16
Reference numeral 1 indicates a relative position 5 of the main table 1 in which demand information is to be registered next. When the content of the entry point 16 is n, the value stored in the n-th sub-table 2 is the main table 1 in which demand information is to be stored.
Are relative positions.

In the case shown in FIG. 1, 2500 entries are continuously registered from the initial state, the entry point 16 indicates 2501, the 2501st main table address 11 also indicates 2501, and the next registration position Means that the relative position 5 of the main table 1 is 2501.

FIG. 2 shows that the relative position of the main table 1 is 2
FIG. 18 is a diagram of a level-by-level management table in a state where 488, 2496, and 2492nd demand information is continuously extracted and transferred to an ordering table (not shown) separately provided on a memory. 3 When you pass the information,
Since the content of the entry point 16 is 2498 after being subtracted as described later, the registration position of the next demand information is the 2498th value of the sub table 2 and in the example of FIG. Relative position. After this, depending on the contents of the key part 3 of the demand information,
After the replacement is performed in accordance with a predetermined procedure, 1 is added to the value of the entry point 16 to be 2499.

In this embodiment, a method for registering demand information generated from a parent item at the product level is as follows. (1) First, the registration information is set to a relative position of the main table 1 equal to the contents of the position of the sub table 2 in the order of the value indicated by the entry point 16. (2) Let j be the relative position 5 of the main table 1 in which the demand information is registered. (3) Assuming that i = j / 2 (rounded down), i is obtained. (4) The relative position 5 compares the contents I and J of the i-th and j-th key parts 3. When I ≦ J, the end processing of (5) is performed. I-th of 1 and j
The contents of the third key part 3 and data part 4 are exchanged, and j =
The process returns to (3) as i. (5) Finally, as an end process, the entry point 16
Is added to the value of. The initial value of the entry point 16 is set to 1.

In this specification, the contents (excluding the relative position 5) of the key portion 3 whose relative position 5 is i, j, and k in the main table 1 are represented by I, J, and K. When the key part 3 is sorted, the low-level code 6 is determined according to the value thereof, and a, b, c,... Shown in FIG. The magnitude relationship is determined in advance for each key item, such as the larger the earlier, and the magnitude is determined with priority given to the left side of each item in the table shown in FIG.

If the demand information is registered in the level-by-level management table in accordance with the above-described procedure, the relationship between the i-th, j-th, and k-th relative positions 5 in the main table 1 can be calculated as follows: Position * 2, k position = j
Of the key portion 3 at the i, j, and k-th relative positions 5, the magnitude relationship between the contents I, J, and K is always I
≦ J and I ≦ K. By extracting the demand information from the level-by-level management table in such a state in the following procedure, the demand information is extracted in the order sorted by the contents of the key unit 3.

The method for extracting the demand information registered in the level-by-level management table is as follows. (1) Since the information having the smallest content of the key section 3 always exists at the first position of the key section 3 of the main table 1, first, the demand information of the first key section 3 and the data section 4 is extracted. (2) Set initial values of i = 1, j = 2, k = 3. (3) The contents I and K of the j-th and k-th key parts 3 are compared, and if J <K, the j-th contents of the key part 3 and the data part 4 are substituted into the i-th and i = j Then, the processing of (4) is performed. If J> K, k of the key part 3 and the data part 4
The i-th content is substituted for the i-th content to make i = k, and then the process (4) is performed. If J = K, J = high v
(5) performing an “alue” process (writing a code indicating that the key portion 3 is vacant at the j-th position excluding the relative position 5)
Is performed. (4) j = i * 2, k = j + 1, and the process returns to (3). (5) High value is assigned to the i-th key part 3. After subtracting 1 from the content of the entry point 16, the value of i is assigned to the position of the value of the entry point 16 in the sub-table 2 in the order of the value.

FIG. 5 is a diagram of a parts table model for specifically explaining a method of registering demand information in the level-by-level management table and a method of extracting demand information according to the present embodiment. FIG. 6 is a diagram showing a configuration information table in which parent item numbers, unit quantities, and lead times of each child item of the parts table model shown in FIG. 5 are stored. It is assumed that there is one order on August 10 for item X with low level code = 1 on the parts table and one order for September 10 for item Y.

FIG. 7 shows level-by-level management in the case where demand information generated from items X and Y is simply registered in the order of generation without using the above-mentioned registration method for explaining the registration method. It is a figure showing a table. First, from the order of item X, demands are generated in the order of child items a, b, c, x, and the demand information
The key part and the data part of the bi-level management table are sequentially registered in the first to fourth. At this time, the value of the entry point is 5. Also,
The required date of the demand of each child item is time-shifted from the order date of the item X by the lead time of the configuration information table shown in FIG. (It is assumed that there are no non-working days during this period.) Next, demands for the child items a, b, c, and d are generated from the order of the item Y. First, the demand information of the child item a is registered in the fifth part of the key part and the data part of the level-by-level management table. Next, j = 5 in accordance with the process (2) of the demand information registration method described above, and i = 2 in accordance with the process (3) of the registration method. Next, according to the processing of (4) of the registration method, the content of the key part of the j-th key part, ie, the fifth registered information, J (LLC (low level code) = 2, item number = a,
(Required date = September 5), the contents I of the key part of the i-th, that is, the second registered information (LLC = 2, item number = b, required date = August 5) and And I
> J, the contents of the i-th and j-th parts of the key part and the data part are exchanged, j = i, and the processing returns to (3). After returning to the process of (3), j = 2, i = 1, and in the process of (4), the content J of the j-th, that is, the second key portion J (LLC = 2, item number = a, required date) Day = September 5), and the contents I (L of the i-th, ie, first key portion,
LC = 2, item number = a, required date = August 5), it becomes I <J. Therefore, it is determined that the processing is to be terminated, and the entry point value is set according to the processing of the registration method (5). 1 is added to obtain 6. Next, the demand information of the child item b is registered as the sixth information of the key part and the data part, and then replaced with the sixth and third contents of the key part and the data part in the same manner as described above. . Next, the demand information of the child item c is registered as the seventh information of the key part and the data part. Assuming that j = 7 and i = 3, the contents J and i of the key part of the j-th information, ie, the seventh information Even if the contents of the key portion of the third information, ie, the third information, are compared, I <J, so that no exchange is performed. Finally, the demand information of the child item d is registered in the eighth position, and the contents of the eighth item are replaced with the contents of the fourth item.

FIG. 8 is a diagram showing the state of the level-by-level management table immediately before the demand information is registered and the ordering processing of the item having the low level code = 2 is started. Hereinafter, a method for extracting the demand information from the level-by-level management table in order to perform the ordering processing of the item a will be specifically described. First, according to the processing of the demand information extracting method (1), the demand information at the first of the key part and the data part is extracted. Then, according to the processing of the extracting method (2), i = 1. , J = 2, k = 3. Next, according to the processing of the extraction method (3), j
The content J of the key part of the second or the second demand information
(LLC = 2, Item number = a, Required date = September 5)
And the content K (LLC = 2, item number = b, required date = September 5) of the key part of the k-th or third demand information
When day) is compared, since J <K, the second demand information is brought to the first. Next, take out method (4)
J = i * 2, that is, 2 * 2 = 4, k = j + 1, that is, 4 + 1 = 5, and the process returns to the extraction method (3). Here, the j number, ie, the content J of the key part of the fourth demand information (LLC = 2, item number = d, required date = September 5) and the key part of the kth, ie, the key part of the fifth demand information Comparing with the content K (LLC = 2, item number = b, required date = August 5), J
Since> K, the fifth demand information is brought to the second. Again, according to the processing of the extraction method (4), j
= I * 2, that is, 5 * 2 = 10, k = j + 1, that is, 1
0 + 1 = 11, but the values are not registered in the tenth and eleventh key parts, so the j, k-th, ie, 1
The 0th and 11th contents J and K are set as a table max,
The process returns to (3). Here, J = K = table ma
Since it is x, the end process of (5) of the extracting method is performed with J = high value. At this time, since i = 5, the content of the fifth key portion is changed to high va
lue, the value of the entry point is 9-1 = 8, and 5 is entered in the eighth sub-table.

FIG. 9 is a diagram showing the state of the level-by-level management table showing the state immediately after the demand information a is extracted by the above method. Subsequently, the next demand information a is extracted in the following manner. How to take out (1)
After performing the processing of (2) and (3),
The content J of the second key portion (LLC = 2, item number = b, required date = August 5) and the content K of the kth, third key portion (LLC = 2, item number =
b, required date = September 5), since J <K, the second demand information is brought to the first. Next, j = i * according to the processing of the extracting method (4).
2, that is, 2 * 2 = 4, and k = j + 1, that is, 4 + 1
= 5, and the process returns to the process (3) of the extracting method. Here, the content J of the key part of the j-th, that is, the fourth demand information (LLC = 2, item number = d, required date = September 5)
Date) and the contents of the k-th, that is, the fifth key part k (hig
hvalue), the fourth demand information is brought to the second because J <K. Again, according to the processing of the extraction method (4), j = i * 2, that is, 4
* 2 = 8, k = j + 1, that is, 8 + 1 = 9, but k
In the ninth, that is, in the ninth, since no value is registered in the key portion, the contents J and K of the j and k-th are set as the table max, and the process returns to (3). After returning to the process of (3), the contents J (LLC =
3, item number X, required date = August 1) and the table max of the contents K of the k-th, ie, the ninth key part, are J <K, so the eighth demand information is given by the fourth. come. Again, according to the processing of the extraction method (4), j = i * 2, that is, 8 * 2 = 16, k = j + 1, that is, 16 + 1 = 17, but since the 16th and 17th values do not exist, J = K = Set table max, (3)
And the end processing of the extraction method (5) is performed. At this time, since i = 8, the eighth key portion is set to high value, the value of the entry point is 8-1 = 7, and 8 is entered in the seventh of the sub-table.

In the manner described above, demand information is extracted in the order of items b, c, d, and x. According to the present invention, demand information can be extracted and sorted from the level-by-level deployment management table in ascending or descending order, or can be sorted and extracted in various orders.

[0024]

According to the level-by-level development method for material requirement planning of the present invention, the demand information is registered in the level-by-level development management table and the demand information is read from the level-by-level development management table. At the time of retrieval, by performing a predetermined processing procedure such as exchanging the contents at a plurality of positions of the key part in which the demand information of the level-by-level deployment management table is registered,
There is an effect that demand information generated by bi-level expansion can be efficiently obtained in a short time while being sorted according to a predetermined order. In particular, among the plurality of demand information registered in the level-by-level deployment management table, if the demand information is sorted in a predetermined order, the first one is always registered in the first position of the key part. Then, the demand information at the top is 1 for the key part.
It can be taken out instantly with a single access.

[Brief description of the drawings]

FIG. 1 is a diagram showing a state in which 2500 pieces of demand information are continuously registered from an initial state of a level-by-level management table used in an embodiment of the present invention.

FIG. 2 is a diagram showing a state where three pieces of information are extracted from the state shown in FIG. 1 of the level-by-level management table used in one embodiment of the present invention.

FIG. 3 is a diagram of a bill of material model targeted by a conventional level-by-level development method for material requirement planning.

FIG. 4 is a diagram of a demand file used in a conventional level-by-level development method for material requirement planning.

FIG. 5 is a diagram of a BOM model targeted by one embodiment of the present invention.

FIG. 6 is a diagram showing a configuration information table of the parts table model shown in FIG. 5;

7 is a diagram showing a level-by-level management table in which demand information of components of the component slip model shown in FIG. 5 is registered in the order of generation.

8 is a diagram showing a level-by-level management table in which demand information of parts of the parts table model shown in FIG. 5 is registered according to one embodiment of the present invention.

9 is a diagram showing a level-by-level management table in a state where the first demand information of the item a is extracted from the state shown in FIG. 8 according to one embodiment of the present invention.

[Explanation of symbols]

 1 Main table 2 Sub table 3 Key part 4 Data part 5 Relative position 6 LLC (Low level code) 7 Item address 8 Information section 9 Group key 10 Required date 11 Main table address 12 Item number 13 Parent item number 14 Required date 15 Quantity

Claims (1)

(57) [Claims] 1. Demand information including an item number for identifying an item, a low-level code indicating an absolute level of the item in a bill of materials, and a required time when the item is required is registered in a plurality of locations arranged in order. Key portion, a sub-table in which the same value as the corresponding order is written in each of a plurality of positions arranged in order in the initial state, and (the number of registered codes + 1) is written in the initial state. When the new demand information is registered in the level-by-level deployment management table using the level-by-level deployment management table having the entry point having the entry point, the following processes (1) to (5) are performed. (1) First, the demand information is registered in the position of the key part in the order of the value of the position of the sub-table in the order of the value of the entry point. (2) The order of the position of the key part in which the demand information is registered in the processing of (1) is j. (3) For j determined in the processing of (2) or (4), i is set to a value equal to j / 2 (an integer whose fraction is rounded down). (4) With respect to j and i determined in the processes of (3) and (4), the contents I and J of the i-th and j-th positions of the key portion are compared according to a predetermined order, and if I ≦ J In the case, the end processing of (5) is performed, and when I> J, the key part i
Swap the contents at the j-th position and the j-th position, and replace j with i
And returns to the process of (3). (5) Finally, as an end process, 1 is added to the value of the entry point. When the demand information is extracted from the level-by-level deployment management table, the following processes (1) to (5) are performed, and a level-by-level deployment method for material requirement planning is provided. (1) First, the demand information which is the content of the first position of the key portion is extracted. (2) After the processing of (1), initial values of 1, 2, and 3 are set for i, j, and k, respectively. (3) The contents J and K of the j-th and k-th positions of the key part are compared with i, j and k determined in the processing of (2) or (4) in accordance with the above-described order, and J <K is satisfied. In this case, the content J of the j-th position of the key portion is substituted into the i-th position to make i equal to j, and then the process of (4) is performed. the content K of the kth position
Is substituted into the i-th position, i is set to a value equal to k, and then the processing of (4) is performed. When J = K, a code indicating that the i-th position of the key portion is vacant is obtained. Then, the end processing of (5) is performed. (4) For j determined in the process of (3), j is i * 2
, And k is set to a value equal to j + 1, and the process returns to (3). (5) Finally, as an end process, a code indicating that the key portion is vacant at the i-th position is written, and 1 is subtracted from the value of the entry point. Substitute i.