http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
자동창고 설계를 위한 최적화 모델 및 해법에 관한 연구
나윤균 한국산업경영시스템학회 1995 한국산업경영시스템학회지 Vol.18 No.34
A cost minimization model for designing AS/RS (Automated Storage/Retrieval Systtems) has been developed under the S/R (Storage/Retrieval) machine throughput rate and total storage capacity requirements. The objective function includes S/R machine cost storage rack cost, and interface conveyor cost. Since the model is a nonlinear integer programming problem which is very hard to solve with large problem size, the model is simplified using previous research results to be solved exactly and a simultion procedure is combined to verify that throughput rate requirements are satisfied.
나윤균 수원대학교 산업기술연구소 1998 산업기술연구소논문집 Vol.13 No.-
A solution procedure to minimize total carousel related costs has been developed under total storage capacity requirements. In addition to carousel facility costs and carousel operating costs, penalty costs due to job delay are included in the total carousel related costs. The job delay costs are dependent upon the size of a carousel which determines the number of carousels, storage item assignment to each carousel, and the item positions in a carousel. When the storage/retrieval requirements for each storage item is equal, an optimal algorithm has been developed. When the storage/retrieval requirements is unequal, a heuristic solution procedure has been developed because of the complexity of the problem.
나윤균 수원대학교 산업기술연구소 1997 산업기술연구소논문집 Vol.12 No.-
In a commercial facsimile network system, a simulation analysis has been performed using SIMAN V due to the unavailability of theoretical models. Analyzed are a priority rule and the multiple-place transmission request effects on service time delay. The result shows that a priority rule has an effect on the reduction of service time delay. Reduction of service time delay is larger in single-place transmission requests than in multiple-place transmission request as the proportion of multiple-place transmission requests increases.
작업처리능력 제약하에서 저장캐러셀의 최소비용 설계를 위한 연구
나윤균 수원대학교 산업기술연구소 2002 산업기술연구소논문집 Vol.17 No.-
A solution procedure to minimize the number of storage carousels has been developed under the carousel throughput rate and total storage capacity requirements. The number of carousles can be reduced by increasing the throughput rate of carousels which depends upon the size of carousels. Since the problem is hard to solve optimally, the following solution procedure is proposed: With a fixed number of carousels, the numbers of vertical and horizontal bins are first determined to meet throughput rate requirements, and the numbers are modified to meet the range constraints. When the feasible numbers of vertical and horizontal bins cannot be found increase the number of carousels by the try to find the numbers again.
羅閏均 수원대학교 산업기술연구소 1994 산업기술연구소논문집 Vol.9 No.-
In designing AS/RS (Automated Storage/Retrieval Systems) an optimization model whose objective function includes S/R (Storage/Retrieval) machine cost, storage rack cost, and interface conveyor cost has been developed under the S/R machine throughput rate and total storage capacity requirements. The model is a nonlinear integer programming problem, which is very hard to solve with large problem size. Using the previous research result which shows that the optimal height of the AS/RS is the maximum height allowed, a solution approach is suggested.
Tool Copy Decision Problem in FMS
羅閏均 수원대학교 산업기술연구소 1992 산업기술연구소논문집 Vol.7 No.-
본 연구에서는 FMS에서의 생산성 극대화를 위한 방안으로 한 작업물이 어느 기계에 할당하면 다른 기계로 이동하지 않고 모든 필요한 공정을 수행받는 정책을 사용하였다. 이 정책의 효과적인 수행을 위해서는 공구의 이동을 최소화하여 공구 이송에 소요되는 시간을 줄이는 것이 필수적으로서, 전체 공구의 수가 제한되어 있는 경우에 각 기계들의 작업 부하의 균형을 일정한 범위 내에서 유지하면서 공구의 이동을 최소화하는 공구들의 숫자를 결정하기 위한 비선형 정수계획 모델을 제시하였다. 문제의 복잡성으로 인하여 근사해를 구하기 위한 발견적 기법을 수학적 모델에 근거하여 개발하였다.
나윤균 수원대학교 산업기술연구소 2000 산업기술연구소논문집 Vol.15 No.-
When a storage module has been given, a solution procedure has been developed to determine if it is economical to reduce the size of the storage module and increase the number of storage aisles assigned for each S/R machine. By reducing the size of the storage module, cycle time for each operation and the corresponding operation cost may be reduced, while additional rail cost and interface conveyor cost are added. Comparing these reduced and added costs, the reduction scale of the given storage module for cost minimization has been determined
나윤균,오근태 수원대학교 산업기술연구소 2005 산업기술연구소논문집 Vol.20 No.-
Presented is a fast image search algorithm that can significantly reduce similarity calculation compared to a full comparison of every database image. For fast searches a tree is constructed by successfully dividing nodes into the desired depth level by working from the root to the leaf nodes using the k-means algorithm. When the query is completed, we traverse the tree top-down by minimizing the route taken between the query image and node controid until we meet the undivided nodes. Within undivided nodes, the algorithm of triangle inequality is used to find the images most similar to the query.
나윤균 수원대학교 산업기술연구소 2003 산업기술연구소논문집 Vol.18 No.-
For the storage carousel system design a solution procedure to minimize the total cost including job-delay cost and overtime cost has been proposed. Job-delay cost occurs when a retrieval job exceeds certain amount of time and overtime cost may be caused when throughput requirement cannot be fulfilled. A simulation model has been developed to estimate job-delay cost and overtime cost due to the intractability of the problem. With a given number or carousels, the optimal carousel module size is round and the corresponding total cost is estimated using the simulation model. Increasing the number or carousels one by one the procedure is repeated until a solution is round.