• 한국경영과학회지
• /
• 제22권2호
• /
• pp.125-137
• /
• 1997

We are concerned with the packing policy determines the optimal packing of products with variable sizes to minimize the penalty costs for idle space and product spliting. Optimal packing problem is closely related to the optimal packet/record sizing problem in that randomly generated data stream with variable bytes are divided into a unit of packet/record for transmitting or storing. Assuming the product size and the production period are independently determined by renewal process, we can approximate the renewal process and formulate the optimization problem that minimize the expected packing cost for a production period. The problem is divided into two cases according to whether a product is allowed to split or not. Computational results for various distributions will be given to verify the approximation procedure and the resulting optimization problem.

• 한국기계가공학회지
• /
• 제19권9호
• /
• pp.1-8
• /
• 2020

In this study, the optimal design of the multi-cavity mold layout and packing pressure for the automobile TCU connector cover is determined based on the injection molding analysis and the desirability function method for multi-characteristic optimization. The design characteristics to be optimized are the warpage and sink marks of the product, the scrap of the feed system, and the clamping force. The optimal design is determined by performing injection molding analysis and desirability analysis for design alternatives defined by a complete combination of five mold layouts and six-level packing pressure. The optimal design shows that the desirability values for individual characteristics are quite high and balanced, and the resulting values of individual characteristics are satisfactorily low.

• Plant Resources
• /
• 제6권1호
• /
• pp.53-56
• /
• 2003

To develop optimal storage method of root of Anemarrhena Rhizome, which has been grown as major cultural herbal medicine material, root of Anemarrhena Rhizome was stored for 10 months with different packing materials and sealing methods. The loss in dry weight as influenced by packing materials and sealing methods was the lowest at vacuum packing and followed by complete sealing methods with transparent polyethylene film. The rot ratio of root during the storage period was not significantly different among packing materials but was significantly different among sealing conditions. Conclusively vacuum packing and complete sealing with polyethylene film appears to be optimal for storage of Anemarrhena Rhizome.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1539-1542
• /
• 2002

In layout of LSI and PWB, block pack- ing problem is very important in order to reduce chip area. Sequence-pair is typical one of conventional pack- ing method and can search nearly-optimal solution by using Simulated Annealing(SA). SA takes huge computation time due to evaluating of various packing results. Therefore, Sequence-pair is not effective enough for fast layout evaluation including estimation of wire length and rotation of every blocks. This paper proposes an efficient block packing method to minimize wire length and chip area. Our method searches an optimal packing efficient- ly by using a cluster growth algorithm with changing the most valuable packing score on packing process.

• Plant Resources
• /
• 제5권2호
• /
• pp.114-117
• /
• 2002

To develop optimal storage method of root of Peucedani Radix, which has been grown as major cultural herbal medicine material, root of Peucedani Radix was stored for 10 months with different packing materials and sealing methods. The loss in dry weight as influenced by packing materials and sealing methods was the lowest at vacuum packing and followed by complete sealing methods with transparent polyethylene film. The ratio of root rot during the storage period was not significantly different between packing materials but was significantly different between sealing conditions. Conclusively vacuum packing and complete sealing with polyethylene film appears to be optimal for storage of Peucedani Radix.

• Plant Resources
• /
• 제5권3호
• /
• pp.224-227
• /
• 2002

To develop optimal storage method of root of Zingiberis Rhizoma, which has been grown as major cultural herbal medicine materials, root of Zingiberis Rhizoma, was stored for 10 months with different packing materials and sealing methods. The loss in dry weight as influenced by packing materials and sealing methods was the lowest at vacuum packing and followed by complete sealing methods with transparent polyethylene film. The ratio of root rot during the storage period was not significantly different between packing materials but was significantly different between sealing conditions. Conclusionally, vacuum packing and complete sealing with polyethylene film appears to be optimal for storage of Zingiberis Rhizoma.

• Plant Resources
• /
• 제5권1호
• /
• pp.70-73
• /
• 2002

To develop an optimal storage method of root of Angelica acutiloba Radix, which has been grown as major herbal medicine material to be cultivated, root of Angelica acutiloba Radix, was stored for 10 months with different packing materials and sealing methods. The loss in dry weight as influenced by packing materials and sealing methods was the lowest at vacuum packing and followed by complete sealing methods with transparent polyethylene film. The ratio of root rot during the storage period was not significantly different between packing materials but was significantly different between sealing conditions. In conclusion, vacuum packing and complete sealing with polyethylene film appears to be most optimal for storage of Angelica acutiloba Radix.

• 한국CDE학회논문집
• /
• 제2권3호
• /
• pp.195-210
• /
• 1997

In Rapid Prototyping process, the time required to build multiple prototype parts can be reduced by packing several parts optimally in a work volume. Interactive arrangement of the multiple parts is a tedious process and does not guarantee the optimal placement of all the parts. In this case, packing is a kind of 3-D nesting problem because parts are represented by STL files with 3-D information. 3-D nesting is well known to be a problem requiring an intense computation and an efficient algorithm to solve the problem is still under investigation. This paper proposes that packing 3-D parts can be simplified into a 2-D irregular polygon nesting problem by using the characteristic of rapid prototyping process that the process uses 2-dimensional slicing data of the parts and that slice of the STL parts are composed of polygons. Our algorithm uses no-fit-polygon (NFP) to place each slice without overlapping other slices in the same z-level. The allowable position of one part at a fixed orientation for given parts already packed can be determined by obtaining the union of all NFP's that are obtained from each slice of the part. Genetic algorithm is used to determine the order of parts to be placed and orientations of each part for the optimal packing. Optimal orientation of a part is determined while rotating it about the axis normal to the slice by finite angles and flipping upside down. This algorithm can be applied to any rapid prototyping process that does not need support structures.

• 공업화학
• /
• 제18권6호
• /
• pp.636-642
• /
• 2007

다양한 크기를 가진 다성분 입자의 충전분율을 정확하게 예측할 수 있는 소프트웨어 프로그램을 개발하였다. 이를 위하여 다양한 크기의 염소산암모늄(Ammonium perchlorate, AP)과 알루미늄(Aluminum, Al) 입자와 혼합물에 대한 충전분율 측정실험을 수행하였다. 실험에 의해 얻어진 충전분율은 개발된 프로그램에 의해 예측된 값과 비교하였다. 크기가 다른 2종류 입자의 혼합 충전의 경우 상대오차가 0.25~13.13%, 3종류 입자의 혼합 충전의 경우 0.13~10.01%로 나타나 실험값과 잘 일치하였다. 목표 충전분율을 얻기 위한 각 구성입자의 질량분율 contour를 프로그램을 통하여 구할 수 있으며 이를 통하여 충전시스템을 최적화 할 수 있다.

• Management Science and Financial Engineering
• /
• 제19권1호
• /
• pp.25-28
• /
• 2013

Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.