http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
민병도(Byeong Do Min),이강원(Gang Won Lee),유승동(Seung Dong Yu),한대희(Dae Hee Han),오재건(Jae Geon Oh),이성만(Sung Man Lee),나완용(Wan Yong Na) 한국자동차공학회 2004 한국자동차공학회 춘 추계 학술대회 논문집 Vol.- No.-
The standard time(ST) is very important part of management efficiency and cost in automobile repair industry. There are many methods of work measurement of automobile repair time in korea. So we have studied differences of work measurements. The main goal of this study is to make people in automobile repair industry understand work measurement.
민병도(Byeong Do Min) 대한설비관리학회 2001 대한설비관리학회지 Vol.6 No.2
N/A The objective of this paper is to find out important characteristics and basic theorems for overtimes, while meeting all due dates of orders. This problem is classified into three cases. The first case is when all orders are ready to be processed now; and the second case is that the orders have random ready time and that due-date`s sequences are identical with the sequences of ready time. The third case is the orders have random ready time and that due date sequences are not identical with the sequences of ready time. We do not consider· split production in the first and second case, but in the last case, split production is considered. We first present the mathematical models for three cases. In the first and second case, we prove that if orders are processed as ascending sequences of due-dates , testing feasibility and minimizing total amounts of overtime can be found out. In the third case, we suggest an efficient grouping method for testing feasibility and minimizing overtimes.
유승동 ( Yu Seung Dong ),박범 ( Park Beom ),민병도 ( Min Byeong Do ) 대한설비관리학회 2003 대한설비관리학회지 Vol.8 No.3
N/A The design of driver-vehicle interface has to base on the driver`s compatibility for the high operation performance. The BPM (Blind-Pointing Method) model was developed to extract driver`s mental model in the form of cognitive map for the design of compatible in-vehicle interface. However, in this model, established analysis method could not extract the driver`s detailed cognitive map. So, in this research, objective and detailed analysis method was suggested to complement of the incompleteness of existing analysis method in the BPM (Blind-Pointing Method) model. The K-means clustering analysis was used for the new analysis method, and more detailed cognitive map was extracted by suggested analysis method.
한대희(Dae Hee Han),유승동(Seung Dong Yu),이강원(Gang Won Lee),민병도(Byeong Do Min),오재건(Jae Geon Oh),이성만(Sung Man Lee),나완용(Wan Yong Na) 한국자동차공학회 2004 한국자동차공학회 춘 추계 학술대회 논문집 Vol.- No.-
The standard time(ST) is very important part of management efficiency and cost in automobile repair industry. There are many methods of work measurement of automobile repair time in korea. So we have studied differences of work measurements. The main goal of this study is to make people in automobile repair industry understand work measurement.
민병도,이재봉,임석철 대한설비관리학회 1997 대한설비관리학회지 Vol.2 No.2
In designing automation system, many engineering practitioners have mainly relied upon their own experiences, thereby causing any design changes which significantly increase the length of development period and cost. Moreover, such a experience-based design procedure may fail to satisfy all functional requirements of the user. In this study, a systematic design procedure for low cost automation system using QFD(Quality Function Requirement) is proposed, and illustrated by a case study.
Two-Stage Heuristic Algorithms for the Machine Using a Pick & Place Robot with Rectilinear Geometry
Min, Byeong Do 대한설비관리학회 1998 대한설비관리학회지 Vol.3 No.1
We deal with the machine using a pick & place robot with rectilinear geometry in which work-in-process and part feeders are fixed; and only the pick & place robot moves between the work-in-process and feeders in order to mount the parts on the work-in-process. The problem is to determine the location of parts in the feeders and sequence of mounting on the work-in-process so as to minimize the total Chebyshev travel distance of the pick & place robot. We propose two heuristic algorithms; one is to determine the part locations in the feeders by solving the Linear Assignment Problem, followed by determining the mounting sequence on the work-in-process by solving the Traveling Salesman Problem; and the other is to determine the mounting sequence first, followed by determining the part locations in the feeders. The proposed algorithms are compared with the traditional pairwise exchange algorithm. Numerical results from random problems with 100 mounting locations on the work-in-process shows up 20% reduction of total travel distance, which is equivalent to approximately 10% improvement in terms of throughput of a assembly line.