http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
MC-Space 알고리즘을 이용한 역공학 효율성 증대에 관한 연구
황종대(Jong-Dae Hwang),정윤교(Yoon-Gyo Jung),정종윤(Jong-Yoon Jung) 한국생산제조학회 2005 한국공작기계학회 추계학술대회논문집 Vol.2005 No.-
This study deals with the improvement of efficiency in the aspect of accuracy and time reduction in the reverse engineering. For this, two main strategies are applied in this paper. One is the path smoothness strategy, the other is the collision free strategy. Path smoothness strategy adopts modified B-spline algorithm that is constructed with altered control vertices. It allows improvement of accuracy of reverse engineering with faired surface. Collision free strategy adopts configuration space algorithm defined by two parameters which determine the probe posture. It allows a time reduction of reverse engineering without collision. So this two strategies are named, MC-Space algorithm.
시바다 이사오(Isao Shibata),정윤교(Yoon Gyo Jung),정종윤(Jong-Yun Jung),문병준(Byung-Joon Moon) 한국산업경영시스템학회 2002 한국산업경영시스템학회 학술대회 Vol.2002 No.추계
In order to polish complicated-shaped inner surfaces of models, a new polishing method with magnetic congelation liquid was invented, we called this name MAGIC polishing tool. This tool is magnetic fluid at high temperature, can be solidified by cooling. The distribution of abrasives in the liquid can be controlled by magnetic field. Therefore we can make a special polishing tool which has well arranged abrasives inside after cooling. In order to know the fundamental polishing properties of this new polishing tool, brass plate was polished. The polishing tool was pressed and rotated against the brass plate in specified polishing time. After many experiments, it was found that this type of polishing tool provided enough removal rate and surface roughness.
시뮬레이션을 이용한 작업자를 공유하는 병렬기계 작업장에서의 작업완료시간 최소화 문제 분석
문덕희,송성,정종윤 국립7개대학공동논문집간행위원회 2002 공업기술연구 Vol.2 No.-
In a semi-automatic machine shop, an operator usually handles more than one machine at a time, because the operator is free during the automatic running of a machine and he(or she) can serve another machine during that time. In this paper, we assume that there are several parallel machines handled by an operator, and one or more jobs already assigned to each machine. A job is defined as an order for producing given quantities of same part, because the shop adapts batch production. Thus in order to minimize makespan, both the visiting sequence of operator to the machines and the production sequence of jobs in each machine are considered. We suggest five heuristic visiting rules and eight production sequencing rules, because this problem is hard to formulate with mathematical program, and it is known as NP-hard. Thus, forty combinations are evaluated for the performance by numerical examples. Numerical example problems are selected randomly with uniform distributions and the performances of the combinations are evaluated by the simulation models which is developed for calculating makespan.
문덕희,심인보,정종윤 한국경영과학회 2001 한국경영과학회 학술대회논문집 Vol.- No.1(2)
Manufacturing system has been gradually changed from the traditional job shop(or flow shop) system to cellular manufacturing system due to its high flexibility and performance. In practice, there are many factors to be determined for constructing a cellular manufacturing system. The selection of the proper machines and the estimation of the number of machine required should be processed before using GT. After determining the machine-part family, the effective layout should be considered. In this paper, we figure out the major factors influencing on the manufacturing cell design and construct an integrated system model considering the relationship among the factors. The system model is verified by developing a prototype of software.