• 대한안전경영과학회지
• /
• 제3권3호
• /
• pp.221-230
• /
• 2001

The assembly tolerance design methods have applied linear or nonlinear programming methods and used simulation method and search algorithms to optimize the tolerance allocation of each part in an assembly. However, those methods are only considered to the relationship between tolerance and manufacturing cost, which do not consider a quality loss cost for each part tolerance. In this paper, the integrated simulation model used genetic algorithm and the Monte-Carlo simulation method was developed for the allocation of the optimal tolerance considering the manufacturing cost and quality loss cost.

• 산업경영시스템학회지
• /
• 제22권49호
• /
• pp.33-41
• /
• 1999

The original tolerances, which are assigned by designers on the basis of handbooks and experience, cannot always be expected to be optimal or feasible, because they may yield an unacceptable manufacturing costs. So the systematic tolerance design considering manufacturing costs should be done. Therefore, this research analyzes the tolerance within the tolerance design using Monte-Carlo simulation method and sensitivity analysis and using genetic algorithm by tolerance allocation method. The genetic algorithm was developed for allocation of the optimal tolerance under the manufacturing limitation cost.

• 대한산업공학회지
• /
• 제24권2호
• /
• pp.175-183
• /
• 1998

When a product is designed, tolerances must be given to the product so that required functions are guaranteed and production costs are minimized. In this research, a model is suggested which allocates tolerances to components optimally according to the STA(Statistical Tolerance Allocation) method. Taking into account the concept that dimensional errors have characteristics of statistical distributions, this model presents the discrete pseudo-boolean approach for the tolerance optimization by minimizing the tolerance cost and the quality loss cost. In this approach, two methods are proposed for the reduction of the problem scale; 1) a method for converting the minimization model for casts into the maximization model for cost savings, and 2) procedures to reduce the number of constraints and variables.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2005년도 창립60주년 기념 추계 학술대회
• /
• pp.224.1-224.1
• /
• 2005

• 한국광학회지
• /
• 제22권4호
• /
• pp.161-169
• /
• 2011

본 논문에서는 광학 민감도가 큰 IR 광학계의 조립정렬과정에서 목표 성능을 만족시키기 위한 조립정렬 허용범위를 설정하는 방법을 제시하였다. 조립정렬 과정에서 편심측정기를 이용하여 각각의 광학소자에 대한 반사 편심량을 측정할 수 있다. 측정된 값을 이용하여 몬테카를로 시뮬레이션을 수행하였고 이를 이용하여 조립 정렬 이후의 광학계의 성능을 예측하였다. 시뮬레이션 결과와 실제 제작된 광학계의 광학 성능을 비교하여 본 논문에서 제시한 공차 할당 기법의 타당성을 확인하였다.

• 산업공학
• /
• 제16권spc호
• /
• pp.39-44
• /
• 2003

As one of many design variables, the role of dimension tolerances is to restrict the amount of size variation in a manufactured feature while ensuring functionality. In this study, a nonlinear integer model has been modeled to allocate the optimal tolerance to each individual feature at a minimum manufacturing cost. While a normal distribution determines statistically worst tolerances with its symmetrical property in many previous tolerance allocation studies, a asymmetrical distribution is more realistic because its mean is not always coincident with a process center. A nonlinear integer model is modeled to allocate the optimal tolerance to a feature based on a beta distribution at a minimum total cost. The total cost as a function of tolerances is defined by machining cost and quality loss. After the convexity of manufacturing cost is checked by the Hessian matrix, the model is solved by the Complex Method. Finally, a numerical example is presented demonstrating successful model implementation for a nonlinear design case.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.901-905
• /
• 1992

The manual procedure of drafting engineering design is fast becoming obsolete. One of the important areas in CAPP is to automate tolerance assignment which is encountered in mechanical part design. This paper presents an approach for automating tolerance assignment using CAD database and tolerancing database in CAD drawing. The system is consisted of four major functions feasture extraction, feaure inferencing, rule-based tolerance allocation, and automatic upating. Auto CAD R.II is employed as CAD system and a computer progran is developed by using Auto LISP on PC-386.

• 한국CDE학회논문집
• /
• 제16권6호
• /
• pp.397-406
• /
• 2011

Since tolerance allocation in a mobile phone camera manufacturing process greatly affects production cost and reliability of optical performance, a systematic design methodology for allocating optimal tolerances is required. In this study, we proposed the tolerance optimization procedure for determining tolerances that minimize production cost while satisfying the reliability constraints on important optical performance indices. We employed Latin hypercube sampling for evaluating the reliabilities of optical performance and a function-based sequential approximate optimization technique that can reduce computational burden and well handle numerical noise in the tolerance optimization process. Using the suggested tolerance optimization approach, the optimal production cost was decreased by 30.3 % compared to the initial cost while satisfying the two constraints on the reliabilities of optical performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1258-1275
• /
• 2023

Cloud computing is a new technology that has adapted to the traditional way of service providing. Service providers are responsible for managing the allocation of resources. Selecting suitable containers and bandwidth for job scheduling has been a challenging task for the service providers. There are several existing systems that have introduced many algorithms for resource allocation. To overcome these challenges, the proposed system introduces an Optimized Task Scheduling Algorithm with Deep Learning (OTS-DL). When a job is assigned to a Cloud Service Provider (CSP), the containers are allocated automatically. The article segregates the containers as' Long-Term Container (LTC)' and 'Short-Term Container (STC)' for resource allocation. The system leverages an 'Optimized Task Scheduling Algorithm' to maximize the resource utilisation that initially inquires for micro-task and macro-task dependencies. The bottleneck task is chosen and acted upon accordingly. Further, the system initializes a 'Deep Learning' (DL) for implementing all the progressive steps of job scheduling in the cloud. Further, to overcome container attacks and errors, the system formulates a Container Convergence (Fault Tolerance) theory with high-level security. The results demonstrate that the used optimization algorithm is more effective for implementing a complete resource allocation and solving the large-scale optimization problem of resource allocation and security issues.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2240-2254
• /
• 2021

We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.