• 드라이브 ㆍ 컨트롤
• /
• 제21권1호
• /
• pp.1-7
• /
• 2024

The locking performance of a multi-plate clutch with a mechanical lock-up system is governed by the engagement algorithm. In this paper, a control algorithm to improve the locking performance of the clutch was studied. A 1D dynamic model was constructed and simulated according to the developed algorithm. The developed algorithm was composed of a method in which the locking device is engaged while generating artificial slip on the friction plate by controlling the piston pressure of the clutch. Furthermore, a case study of the parameters within the developed algorithm was conducted to explore combinations that maximize locking performance and analyze trends according to these parameters.

• 한국산업정보학회논문지
• /
• 제19권3호
• /
• pp.49-56
• /
• 2014

툴 프리세터는 수치제어 공작기계용 공구의 테이퍼부를 기준으로 하여 날끝 치수를 사전에 정렬하기 위한 장치로서 여기에는 접촉과 비접촉, 두 가지 방식이 있다. 광학센서 기반 비접촉 방식은 측정의 유연성과 편리함의 이점을 가지고 있다. 본 논문에서는 선형 스케일러와 머신 비전을 도입한 산업용 툴 프리세터 장비 개발을 다룬다. 측정 전에 대상 공구를 기구부에 고정시키고 광학부를 정렬한다. 공구 영상을 취득한 후 제시된 영상처리 알고리즘은선형 스케일러로부터 광학부의 이동 거리를 조합하여 공구의 정밀한 치수를 계산해낸다. 실험 결과, 본 장비의 정밀도가 ${\pm}20um$ 범위내에 있음을 검증하였다.

• 한국산학기술학회논문지
• /
• 제2권1호
• /
• pp.31-35
• /
• 2001

본 논문에서는 스포츠센터, 가정 등에서 활발히 사용되고 있는 런닝머신에 대하여 동적 부하량의 변화가 미치는 영향을 분석하기 위하여 구조해석을 수행하였다. 구조해석을 수행하기 위하여 상용 유한요소해석 코드인 ANSYS를 활용하였으며 최대응력, 최대변형률, 고유진동수를 구하여 런닝머신의 안정성을 평가하였다.

• 한국산학기술학회논문지
• /
• 제14권10호
• /
• pp.4694-4699
• /
• 2013

본 논문은 고압세척기의 성능을 향상시킨 제품개발을 위하여 현장에서 사용되는 고압세척기를 분해하여 측정하였으며 실제형상을 3차원 설계프로그램인 CATIA V5를 사용하여 모델링하였다. 또한 모델링된 고압세척기에 대하여 3차원 유한요소해석 프로그램인 ANSYS를 사용하여 유동해석을 수행하였으며 그 결과를 구조해석의 입력 자료로 활용하여 내부압력에 따른 응력, 변형률, 총변형량을 구하였다. 이러한 결과는 새로운 고압세척기의 제품개발에 활용될 예정이다.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 1999년도 춘계학술대회 발표논문집
• /
• pp.145-153
• /
• 1999

We consider a Direct Input Output Manufacturing System(DIOMS) which has a munber of machine centers placed along a built-in Automated Storage/Retrieval System(AS/RS). The Storage/Retrieval (S/R) machine handles parts placed on pallets for the machine centers located at either one or both sides of the As/Rs. This report studies the operational aspect of DIOMS and determines the optimal operating policy by combining computer simulation and genetic algorithm. The operational problem includes: input sequencing control, dispatching rule of the S/R machine, machine center-based part type selection rule, and storage assignment policy. For each operating policy, several different policies are considered based on the known research results. In this report, using the computer simulation and genetic algorithm we suggest a method which gives the optimal configuration of operating policies within reasonable computation time.

• 대한산업공학회지
• /
• 제22권1호
• /
• pp.37-50
• /
• 1996

This paper presents an EMQ model which determines an economic manufacturing quantity in an unreliable machine. It is assumed that life time of a machine is generally distributed and it requires an instantaneous repair time when a machine fails. Depending on various types of failure rate function of a machine, it is discussed how to determine an EMQ and prove its uniqueness. Variations of an EMQ depending on repair cost are also examined. Through numerical experiments, extensive investigations are carried out on the effects of repair cost and setup cost to an EMQ as well as average cost, and some interesting behaviors are observed.

• 대한산업공학회지
• /
• 제40권3호
• /
• pp.305-312
• /
• 2014

This research deals with a problem that minimizes makespan in a non-identical parallel machine system with sequence and machine dependent setup times and machine dependent processing times. We first present a new mixed integer programming formulation for the problem, and using this formulation, one can easily find optimal solutions for small problems. However, since the problem is NP-hard and the size of a real problem is large, we propose four heuristic algorithms including genetic algorithm based heuristics to solve the practical big-size problems in a reasonable computational time. To assess the performance of the algorithms, we conduct a computational experiment, from which we found the heuristic algorithms show different performances as the problem characteristics are changed and the simple heuristics show better performances than genetic algorithm based heuristics for the case when the numbers of jobs and/or machines are large.

• 한국산학기술학회논문지
• /
• 제14권11호
• /
• pp.5330-5333
• /
• 2013

본 논문은 고압세척기의 성능을 향상시킨 제품개발을 위하여 현장에서 사용되는 고압세척기를 분해하여 측정하였으며 실제형상을 3차원 설계프로그램인 CATIA V5를 사용하여 모델링하였다. 또한 모델링된 고압세척기에 대하여 3차원 유한요소해석 프로그램인 ANSYS를 사용하여 유동해석을 수행하여 내부압력에 따른 유체의 흐름을 구하였다. 이러한 결과는 새로운 고압세척기의 제품개발에 활용될 예정이다.

• 산업경영시스템학회지
• /
• 제11권17호
• /
• pp.39-46
• /
• 1988

This Paper is concerned with a man-multi machine assignment problem to minimize idle time. Assuming different types of semi-automatic machines with deterministic service-processing time, the problem approaches by sequential dependent one operator can handle several machines, where determine optimal range the cost of idle labor and machine time is to be minimized in preparing a work schedule. The Procedure, to establish man-machine assignment model, and it's results are: (1) Objective function to minimize opportunity loss cost, which is happened by idle time, is verified recursive process through heuristic method. (2) The algorithm, is programmed by BASIC language for personal computer, and a numerical example is given to illustrate the heuristic algorithm. This study will be helpful to enhance productivity of Shopflooras a result of increasing the efficiencies of both operator and machine.

• Industrial Engineering and Management Systems
• /
• 제15권1호
• /
• pp.32-40
• /
• 2016

This paper considers a special case of a three machine flow shop scheduling problem in which operation processing time of each job is ordered such that machine 1 has the longest processing time, whereas machine 3, the shortest processing time. The objective of the problem is the minimization of the total completion time. Although the problem is simple, its complexity is yet to be established to our best knowledge. This paper first introduces the problem and presents some optimal properties of the problem. Then, it establishes several special cases in which a polynomial-time optimal solution procedure can be found. In addition, the paper proves that the recognition version of the problem is at least binary NP-complete. The complexity of the problem has been open despite its simple structure and this paper finally establishes its complexity. Finally, a simple and intuitive heuristic is developed and the tight worst case bound on relative error of 6/5 is established.