• 대한산업공학회지
• /
• 제31권1호
• /
• pp.20-26
• /
• 2005

This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.

• 대한산업공학회지
• /
• 제31권1호
• /
• pp.1-9
• /
• 2005

This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.

• 대한산업공학회지
• /
• 제30권3호
• /
• pp.175-180
• /
• 2004

The machine-part group formation is to group the sets of parts having similar processing requirements into part families, and the sets of machines needed to process a particular part family into machine cells using grid computing. It forms machine cells from the machine-part incidence matrix by means of Self-Organizing Maps(SOM) whose output layer is one-dimension and the number of output nodes is the twice as many as the number of input nodes in order to spread out the machine vectors. It generates machine-part group which are assigned to machine cells by means of the number of bottleneck machine with processing part. The proposed algorithm was tested on well-known machine-part grouping problems. The results of this computational study demonstrate the superiority of the proposed algorithm.

• 산업경영시스템학회지
• /
• 제16권27호
• /
• pp.73-82
• /
• 1993

In this paper, We determine the expected travel time for several forks Storage/Retrieval machine which is allowed multiple stops in aisle. When throughput is increased, We propose adding to fork number of each S/R machine rather than adding to number of S/R machine, We also describe such a model which determines the optimal number of each several forks S/R machine subject to constraints on the hourly throughput and warehouse dimensions. Numerical example is presented to compare warehouse shapes against each single fork, twin forks, triple forks S/R machine for various throughput values.

• 산업공학
• /
• 제12권4호
• /
• pp.532-539
• /
• 1999

The first step to design a cellular manufacturing system is to make part-families and machine-cells. This process is called the machine-part grouping. This paper considers a machine-cell size when grouping machine-cells. By considering a machine-cell size, an unrealistically big size of machine-cell which may be caused by the chaining effect can be avoid. A heuristic algorithm which minimizes the number of inter-cell movement of parts considering a machine-cell size is presented. The effectiveness and performance of the proposed heuristic algorithm are compared with those of several heuristic algorithms previously reported. The comparison shows that the proposed heuristic algorithm is efficient and reliable in minimizing the number of inter-cell movement of parts and also prevents the chaining effect.

• 디지털콘텐츠학회 논문지
• /
• 제19권6호
• /
• pp.1161-1167
• /
• 2018

기계 학습의 발전은 인간만이 할 수 있었던 섬세한 작업들을 기계가 할 수 있도록 이끌었고, 이에 따라 많은 기업체들은 기계 학습 기반의 번역기를 출시하였다. 현재 상용화된 번역기들은 우수한 성능을 보이지만 숫자 번역에서 문제가 발생하는 것을 발견했다. 번역기들은번역할문장에 큰숫자가 있을경우종종숫자를잘못번역하며, 같은문장에서숫자만바꿔번역할 때문장의구조를 완전히바꾸어 번역하기도 한다. 이러한 문제점은오번역의 가능성을 높이기 때문에해결해야 될 사안으로여겨진다. 본 논문에서는 Bidirectional RNN (Recurrent Neural Network), LSTM (Long Short Term Memory networks), Attention mechanism을 적용한 Neural Machine Translation 모델을 사용하여 데이터 클렌징, 사전 크기 변경을 통한 모델 최적화를 진행 하였고, 최적화된 모델에 숫자 기호화 알고리즘을 적용하여 상기 문제점을 해결하는 번역 시스템을 구현하였다. 본논문은 데이터 클렌징 방법과 사전 크기 변경, 그리고 숫자 기호화 알고리즘에 대해 서술하였으며, BLEU score (Bilingual Evaluation Understudy score) 를 이용하여 각 모델의 성능을 비교하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1576-1579
• /
• 1991

This paper discusses on the machine loading and tool allocation (MLTA) problem. Mathematical formulation of the problem is given first. Then a heuristic approach based on Group Technology (GT) is presented to deal with the MLTA problem effectively. By using this approach, part-tool group generation and their assignment to adequate machines can easily be obtained in consideration of the work load on each machine, the number of tool-set replacement, and the total number of cutting tools required through the interactive setting of the desired machine utilization rate.

• Journal of Mechanical Science and Technology
• /
• 제15권11호
• /
• pp.1482-1489
• /
• 2001

Thermally-induced errors originating from machine tool errors have received significant attention recently because high speed and precise machining is now the principal trend in manufacturing proce sses using CNC machine tools. Since the thermal error model is generally a function of temperature, the thermal error compensation system contains temperature sensors with the same number of temperature variables. The minimization of the number of variables in the thermal error model can affect the economical efficiency and the possibility of unexpected sensor fault in a error compensation system. This paper presents a thermal error model with minimum number of variables using a fuzzy logic strategy. The proposed method using a fuzzy logic strategy does not require any information about the characteristics of the plant contrary to numerical analysis techniques, but the developed thermal error model guarantees good prediction performance. The proposed modeling method can also be applied to any type of CNC machine tool if a combination of the possible input variables is determined because the error model parameters are only calculated mathematically-based on the number of temperature variables.

• 한국안전학회지
• /
• 제30권5호
• /
• pp.108-113
• /
• 2015

Plastic injection moulding machine is widely used for many industrial field. It is classified into mandatory safety certification machinery in Industrial Safety and Health Act because of its high hazard. In order to prevent industrial accidents by plastic injection moulding machine, it is necessary for designer to identify hazardous factors and assess the failure modes to mitigate them. This study tabulates the failure modes of main parts of plastic injection moulding machine and how their failure has affect on the machine being considered. Failure Mode & Effect Analysis(FMEA) method has been used to assess the hazard on plastic injection moulding machine. Risk and risk priority number(RPN) has been calculated in order to estimate the hazard of failures using severity, probability and detection. Accidents caused by plastic injection moulding machine is compared with the RPN which was estimated by main regions such as injection unit, clamping unit, hydraulic and system units to find out the most dangerous region. As the results, the order of RPN is injection unit, clamping unit, hydraulic unit and system units. Barrel is the most dangerous part in the plastic injection moulding machine.

• 산업경영시스템학회지
• /
• 제47권1호
• /
• pp.20-27
• /
• 2024

Determining the number of operators who set up the machines in a human-machine system is crucial for maximizing the benefits of automated production machines. A man-machine chart is an effective tool for identifying bottlenecks, improving process efficiency, and determining the optimal number of machines per operator. However, traditional man-machine charts are lacking in accounting for idle times, such as interruptions caused by other material handling equipment. We present an adjusted man-machine chart that determines the number of machines per operator, incorporating idleness as a penalty term. The adjusted man-machine chart efficiently deploys and schedules operators for the hole machining process to enhance productivity, where operators have various idle times, such as break times and waiting times by forklifts or trailers. Further, we conduct a simulation validation of traditional and proposed charts under various operational environments of operators' fixed and flexible break times. The simulation results indicate that the adjusted man-machine chart is better suited for real-world work environments and significantly improves productivity.