http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
가변적인 보관공간 크기가 가능한 창고시스템에서 동적 보관공간 계획 모형
장석화 ( Suk Hwa Chang ),신현재 ( Hyun Jae Shin ) 대한설비관리학회 2010 대한설비관리학회지 Vol.15 No.3
This paper addresses the determination of the sizes and the numbers of storage bins in a warehouse system with variable storage bin size for the discrete and finite time period. The sizes of products that are stored in the warehouse are diverse and different according to the product. The maximum inventory amount of the product in a warehouse is changed dynamically for given time periods. The warehouse needs several sizes of storage bins to store products that are different in size. In each period, the sizes and the numbers of storage bins can be changed according to the size and the inventory amount of the products. The sizes and the numbers of storage bins which minimize cost are determined in each period during given time period. The cost factors are fixed cost when the sizes or the numbers of storage bin are changed and use cost for cubic size of total storage bins. The problem is analyzed and a mathematical model is formulated. And a dynamic programming algorithm is developed. A numerical example is shown to explain the algorithm.
장석화(Chang Suk-Hwa) 한국산업경영시스템학회 2008 한국산업경영시스템학회지 Vol.31 No.2
This paper addresses determining the location of the distribution centers in a discrete dynamic distribution system. In discrete and finite time horizon, the demands of retailers are dynamic for the periods. Some locations among the retailers can be chosen for the role of the distribution centers at the beginning of each period. The distribution centers have to be located at the location of minimizing logistics cost. Logistics cost factors are the operation cost and the fixed cost of distribution center, and the transportation cost. The distribution centers of minimizing sum of operation cost, fixed cost and transportation cost are determined among retailers in each period for the planning period. A mathematical model was formulated and a dynamic programming based algorithm was developed. A numerical example was shown to explain our problem.
단일공급자 다수구매자 통합 생산재고모형에서 공급체인주기를 통한 조정
장석화 ( Suk-hwa Chang ) 대한설비관리학회 2018 대한설비관리학회지 Vol.23 No.1
This paper is to analyze the cycle of the manufacturer, the order cycles of the retailers and the order cycles of raw materials in a multi-stages supply chain with source of raw material, manufacturer and the retailers. The cycle of the manufacturer is the elapsed time between two successive beginnings of the production cycle. The decision making factors that minimizes the cost in a multi-stages supply chain are coordinated through supply chain cycles. Cost factors are the production setup cost and inventory holding cost of the manufacturer, the ordering cost and inventory holding cost of the retailers and the ordering cost and inventory holding cost of the raw material. A mathematical model is represented with the cycle of the manufacturer, the numbers of supply to retailers and order numbers for raw materials. The reference value for defining the search range of the cycle of the manufacturer is obtained through the costs of the manufacturer. A minimum cost solution method is suggested, and the solution results are compared with those of genetic algorithm through a numerical example.
양쪽방향 회전 다랙 회전창고시스템에서 실현가능한 시스템을 위한 인출 배치크기
장석화 ( Suk Hwa Chang ) 대한설비관리학회 2015 대한설비관리학회지 Vol.20 No.2
This paper addresses the retrieval batch size which the bi -directional multi -rack carousel system can be feasible. Each rack of the carousel system turns clockwise or counterclockwise rotation. The items that customers order are retrieved from the bins of the carousel with batch size. The mathematical model is formulated to represent the rotary travel distance and the retrieval lead time for retrieval batch size in an bi -directional carousel system. The rotary travel distance is the distance which the carousel system rotates for retrieval of all items included in a batch. The retrieval lead time is the time interval from retrieval starting time to retrieval finishing time for retrieval of all items included in a batch. The retrieval batch size that the carousel system can be feasible is obtained. A numerical example is shown to explain the solution procedure. The rotary travel distance and retrieval lead time are obtained through simulation approach in a numerical example.
단일방향 다랙 회전창고시스템에서 실현가능한 창고시스템을 위한 인출 배치크기
장석화 ( Suk Hwa Chang ) 대한설비관리학회 2014 대한설비관리학회지 Vol.19 No.4
This paper addresses the retrieval batch size which the uni-directional multi-racks carousel system can be feasible. The items that customers order are retrieved from the bins of the carousel with batch size. The mathematical model is formulated to represent the rotary travel distance and the retrieval lead time for retrieval batch size in an uni-directional carousel system. The rotary travel distance is the distance which the carousel system rotates for retrieval of all items included in a batch. The retrieval lead time is the time interval from retrieval starting time to retrieval finishing time for retrieval of all items included in a batch. The retrieval batch size that the carousel system can be feasible is obtained. A numerical example is shown to explain the solution procedure.
단일 공급자 다수 구매자 다수 제품 공급체인모형에서 최소비용 공급자주기
장석화 ( Suk-hwa Chang ) 대한설비관리학회 2020 대한설비관리학회지 Vol.25 No.1
This paper is to get the cycle time of the vendor with minimum cost in an integrated production and inventory model of single-vendor multi-buyer multi-product supply chain. The vendor is the manufacturer of the product and the buyers are retailers. A manufacturer produces different kinds of products and supplies them to the retailers. The cycle time of the vendor is the elapsed time of two consecutive production start times. All product types have the same cycle time of the vendor. A mathematical model is represented with the cycle time of the vendor and the number of item supply from manufacturer to the retailers during the cycle time of the vendor in a supply chain. The cycle time of the vendor that minimizes the cost in a supply chain is obtained with the cost factors of the manufacturer. The number of item supply from the manufacturer to the retailer is obtained with the ordering cost and inventory holding cost of retailer and inventory holding cost of the manufacturer. A minimum cost solution method is suggested. A solution result is compared with the optimal solution and that of the genetic algorithm through a numerical example.
장석화(Suk-Hwa Chang) 한국산업경영시스템학회 2007 한국산업경영시스템학회지 Vol.30 No.1
This paper addresses the allocation planning of the storage location in a warehouse system that the dedicated storage method is used. In the discrete finite time period model, the demands for storage location of products are dynamic for time periods. The planning is to determine the reallocation time period and the storage location of the products in reallocation time period, which minimizes costs. The cost factors are the reallocation cost, the travel cost within warehouse and the surplus storage location cost. A model is formulated, and the property of optimal solution is characterized. The dynamic programming algorithm is developed, and a numerical example is shown.
장석화(Suk-Hwa Chang) 한국산업경영시스템학회 2005 한국산업경영시스템학회지 Vol.28 No.1
This paper is to analyze the travel distance and the transport size of the vehicle when the AGV carries multiple-load in the tandem automated guided vehicle systems. The size of multiple-load represents the number of load that the AGV can carry simultaneously. The AGV can carry simultaneously multiple-load that load types are different. The transport system of the manufacturing system is a tandem configuration automated guided vehicle system, which is based on the partitioning of all the stations into several non-overlapping single closed loops. Each loop divided has only one vehicle traveling unidirectionally around it. The AGV of each loop has to have sufficient transport capacity that can carryall loads for given unit time. In this paper, the average loaded travel distance and the size of feasible multiple-load of the vehicle are analyzed. A numerical example is shown.
창고시스템에서 보관위치할당 방식에 대한 이동거리와 보관위치 수의 분석
장석화(Suk-Hwa Chang) 한국산업경영시스템학회 2006 한국산업경영시스템학회지 Vol.29 No.2
This paper addresses the analysis of the travel distance and the number of storage location for storage location allocation methods in a warehouse system. The dedicated, randomized, combined and limited storage methods are considered. The combined and the limited storage methods are suggested here, which the combined storage method is to divide the storage locations into the dedicated storage area and the randomized storage area, and the limited storage method is to restrict the storage area of each product. Through a numerical example, the average travel distance between input/output point and the storage locations, and the number of storage location needed in the warehouse are compared between storage location allocation methods. The nearest randomized storage method is shown as the reasonable one in the travel distance and the number of storage location.