KR19980063083A - Packaging Supply System for Automotive Parts - Google Patents

Abstract

The present invention is set as a container that is standardized to 20 ft and 40 ft in length as an international standard standard product loaded on a conventional wagon or ship, and is configured as a relatively small box body accommodated in the above-mentioned container and the container as shown in FIG. Case consisting of a shape and cube and size suitable to be standardly accommodated in the room, a kind of paper box loaded in the case, the width and length being 32 equal to the case for the smallest part, The packaging supply system of the automobile parts of the present invention adopts the ordering method for each part by the loading method which is composed of 16 parts and the like and is set as multiples of the basic box to realize the optimal distribution. By giving the minimum space has the usefulness to reduce the logistics cost.

Description

Packaging Supply System for Automotive Parts

1 is a layout of a warehouse that implements a packaging supply system for an automotive component of the present invention.

2 is a loading configuration diagram of a box and a case applied to a packaging supply system of an automobile part of the present invention.

3 is a perspective view showing one embodiment of a case applied to a packaging supply system of an automobile part of the present invention.

4 is a flowchart showing an overall flowchart of a packaging supply system for an automobile part of the present invention.

5 is an explanatory diagram showing the division of boxes in a case in the packaging supply system for automobile parts of the present invention.

6 is a general flowchart of a packaging supply system for an automotive component of the present invention.

Explanation of symbols on the main parts of the drawings

The present invention relates to a packaging supply system for automobile parts, and more particularly, to a method for optimizing the packaging supply of a buoyant product that minimizes the logistics costs in supplying parts to an area such as a foreign country that is spaced apart from the automobile parts production area.

In the production of automobiles, so-called globalization-type automobile production methods are widely used in which parts are produced and assembled. The most important problem in the production of automobiles with the parts produced and assembled is separated from each other is the management of the logistics cost of transporting the produced parts to the local assembly office. .

Conventionally, the so-called lot-to-lot method, which packs the production of N cars as one lot according to the production vehicle and performs the packaging for each model, has been widely used, but this method causes residual space in packaging and transportation. There are disadvantages in logistics management, and because it has to be ordered on an irregular basis, there is a problem that the adaptability to the order is lowered. In addition, since packing by lot or by model is set as a standard for production, there is a problem that optimization in packaging and logistics costs is not considered.

The packaging supply system for automobile parts of the present invention devised in view of the above problems of the packaging supply system for automobile parts of the present invention employs an ordering method for each component and provides a minimum space for packaging and transportation, thereby reducing logistics costs. For the purpose of

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, a packaging supply system for an automotive component of the present invention will be described with accompanying drawings.

The present invention discloses an optimal technique for standardizing a packaging unit case and container and loading parts into the standard packaging unit case and container.

In the present invention, an optimum loading using a packaging unit case and a container is a main configuration, and general ordering and production control are not specifically mentioned.

Referring to the container (box) employed in the present invention is as follows.

(1) Container (C: Container): International standard standard goods loaded on conventional wagons or ships. Standardized as 20ft and 40ft in length.

(2) Case (S: Case): configured as a relatively small box body contained in the container described above, and configured as a shape and a cube and size suitable for being standardly accommodated in the container interior as shown in FIG. It is configured as a frame (F) reinforcement that can accommodate a plurality of boxes in the packaging unit to be loaded. The size of the case is divided into a number of sizes so that it can be applied according to the present invention. The containers are divided into 24 equal parts or 36 equal parts to be loaded into the container, and are classified as CP1, CP2, CP3, CP4 ... Set it. In principle, the weight of the case should be 60 kg or less.

(3) Box (B: BOX) A type of paper box that is placed inside the case. The width and length, which are the size for accommodating the smallest parts, are mixed in 32 equal parts and 16 equal parts. And set as a multiple for the base box.

In the present invention, CB1, CB2, CB3, and CB4 .. will be exemplarily described as being equally combined.

As described above, the optimization technique for accommodating a plurality of optimized boxes B in the case S and stacking the case S inside the container C will be described. Therefore, this application is related with the optimal technique which loads the box B in the case S, and the optimal technique which loads the case S in the container C. As shown in FIG. In addition, boxes are set in the following table so that a maximum of 256 boxes can be loaded in the following case.

The standard values of the above boxes and cases are given as follows.

The standard value of the box

The classification of the box described above is determined by setting a standard box that is accommodated in the case as shown in FIG.

Standard value of the case

CP .. in the above means a conventional paper box and SF .. is composed of a steel strip due to the weight of the loading parts, an exemplary configuration is shown in FIG.

(1) How to optimally load box B in case S

First, the order contents for each part are classified by box type suitable for the size of each part, and the number of sorted boxes is counted.

fac [8] = {1, 2, 4, 8, 16, 16, 32, 16} ....... ①

box_name [8] = {CB010, CB020, CB030, CB040, CB041, ....... ②

CB050, CB051, CB060}

count ....... ③ by call box

while remain_box_quantity 256 do ....... ④

call case_type calculation ....... ⑤

if total_case_weight 600 ....... ⑥

Call weight adjustment ....... ⑦

endif

Calculate call case quantity ....... ⑧

end

end Basic pattern ....... ⑨

If you look at the details of each step, first, the order quantity by parts is classified by box type, and the total quantity is counted. (1), (2): By matching the box grant value one by one by the type of box that each part should be packed Grant.

(3) Count the number of boxes for each box packed.

(4): If the sum of all box granting values of the boxes is 256 or less (because of 1 case), it ends.

(5) Select a case suitable for the number of nights.

(6) Since the reference weight of one case is set to 600 kg, if the case weight of 600 or more goes out, the case with the lowest weight is selected sequentially and the weight is adjusted.

(7) The number of cases according to the case type is calculated.

(2) Count by Procedure Box:

I = 1, K = 1, L = 1 [I = number of data, K = box type name, L = number of boxes.]

while box [i] = null do

if i 1

if box [i] not = box [i-I] (8)

K = K + 1 (9)

L = 1 (10)

endif

endif

box_name [K, L] = box [i]

Number of boxes per box [K] = Number of boxes per box [K] +1 (11)

L = L + 1

i = i + 1

end

count by end box

(8), (9): If the current box and the previous box are not the same, the box type name is increased by one. In this case, the number of boxes is one.

(10), (11): The number of boxes corresponding to K is increased by one.

(2) Optimization of the number of cases

The second method is to calculate the case form (the number of components per box loaded in the case) by applying the sum of the total count values and the ratio of the sum of the count values by the box using 'CB010' which is the reference box of the basic pattern as the coefficient value 1.

Procedure case type calculation

for i = 1 to 8

sum of counts per box [i] = number of boxes per box [i] ^* fac [i]

tot1 = sum of counts by tot1 + box [i]

end

for i = 1 to 8

ava [i] = 256 ^* Sum of counts per box [i] / tot1

type number of boxes 1 [i] = int [[ava [i] / fac [i] +0.5]

tot2 = tot2 + [number of forming boxes 1 [i] ^* fac [i]]

end

if tot2 not = 256

call error adjustment

endif

for i = 1 to 8

Number of cases [i] = number of boxes per box [i] / type number of boxes 1 [i]

end

case quantity = min [number of possible cases [i]]

end case type calculation

Since the sum of the box counts that can be loaded in the basic case SF010 is 256, if the sum of the counts is 256, the case volume ratio is 100%, and if the sum of the weights in the case does not exceed 600 kg, it is determined or the weight is adjusted. .

After the weight is adjusted, the shape of the case is determined, and the number of configurable cases is calculated in the same manner.

procedure case quantity calculation

while case no case quantity

case no = case no +1

for i = 1 to 8

for j = 1 to type number of forming boxes [i]

box_name [i, j] = case no

end

end

end

for i = 1 to 8

number of boxes per box [i] = number of boxes per box [i]-[type of forming boxes [i] ^* case quantity]

remain_box_quantity = remain_box_quantity + [number of boxes per box [i] ^* fac [i]]

end

end case quantity calculation

Obtained by the method as described above, the automotive supply packaging supply system of the present invention has the usefulness to reduce the logistics cost by adopting a part-specific ordering method and giving a minimum space for packaging and transportation.

Claims (1)

International standard standard goods loaded on conventional wagons or ships, which are standardized in lengths of 20 feet and 40 feet, are set as containers, and are configured as relatively small boxes contained in the above-mentioned containers and standardized inside containers as shown in FIG. A case configured as a shape and a cube and size suitable for being accommodated as an object, and a width and length which is a kind of paper box placed inside the case, the size and the size of which accommodates the smallest parts are divided into 32 equal parts and 16 equal parts to the case. Composed of several things, and set as multiples of the basic box, The standard value of the box is The standard value of the case is As; The method of optimally loading the box B in the case S, fac [8] = {1, 2, 4, 8, 16, 16, 32, 16} ....... ① box_name [8] = {CB010, CB020, CB030, CB040, CB041, ....... ② CB050, CB051, CB060} count ....... ③ by call box while remain_box_quantity 256 do ....... ④ call case_type calculation ....... ⑤ if total_case_weight 600 ....... ⑥ Call weight adjustment ....... ⑦ endif Calculate call case quantity ....... ⑧ end end Basic pattern ....... ⑨ With Count per procedure box; I = 1, K = 1, L = 1 [I = number of data, K = box type name, L = number of boxes.] while box [i] = null do if i 1 if box [i] not = box [i-I] (8) K = K + 1 (9) L = 1 (10) endif endif box_name [K, L] = box [i] Number of boxes per box [K] = Number of boxes per box [K] +1 (11) L = L + 1 i = i + 1 end count by end box To; How to optimize the number of cases, The second method is to calculate the case form (the number of components per box loaded in the case) by applying the sum of the total counts and the ratio of the sum of the counts by box, using 'CB010' as the reference box of the basic pattern as the coefficient value 1. Procedure case type calculation for i = 1 to 8 sum of counts per box [i] = number of boxes per box [i] ^* fac [i] tot1 = sum of counts by tot1 + box [i] end for i = 1 to 8 ava [i] = 256 ^* Sum of counts per box [i] / tot1 type number of boxes 1 [i] = int [[ava [i] / fac [i] +0.5] tot2 = tot2 + [number of forming boxes 1 [i] ^* fac [i]] end if tot2 not = 256 call error adjustment endif for i = 1 to 8 Number of cases [i] = number of boxes per box [i] / type number of boxes 1 [i] end case quantity = min [number of possible cases [i]] end case type calculation With procedure case quantity calculations; while case no case quantity case no = case no +1 for i = 1 to 8 for j = 1 to type number of forming boxes [i] box_name [i, j] = case no end end end for i = 1 to 8 number of boxes per box [i] = number of boxes per box [i]-[type of forming boxes [i] ^* case quantity] remain_box_quantity = remain_box_quantity + [number of boxes per box [i] ^* fac [i]] End, end case quantity supply system for packaging automotive parts, characterized in that for calculating.