• Title/Summary/Keyword: Operation Sequence

Search Result 572, Processing Time 0.026 seconds

A Study on the optimal Process Planning and Die design for manufacturing Bolts by multi-former (다단-포머용 볼트류 제작을 위한 최적의 공정 및 금형설계에 관한 연구)

  • 박철우;김철;김영호
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.1307-1311
    • /
    • 2004
  • This paper deals with an automated computer-aided process planning and die design system by which designer can determine operation sequences even if they have a little experience in process planning and die design for axisymmetric products. An attempt is made to link programs incorporating a number of expert design rules with the process variables obtained by commercial FEM softwares, DEFORM and ANSYS, to form a useful package. They can provide a flexible process based on either the reduction in the number of forming sequences by combining the possible two processes in sequence, or the reduction of deviation of the distribution on the level of the required forming loads by controlling the forming ratios. Especially in die design module an optimal design technique and horizontal split die were investigated for determining appropriate dimensions of components of multi-former die set. It is constructed that the proposed method can be beneficial for improving the tool life of die set at practice.

  • PDF

Computer Aided Process Planning of Block Assembly using an Expert System (전문가 시스템을 이용한 블록조립 공정계획)

  • 신동목
    • Journal of Ocean Engineering and Technology
    • /
    • v.17 no.1
    • /
    • pp.67-71
    • /
    • 2003
  • This paper presents the use of an evert system to automate process planning of block assembly, a task that is usually completed manually. In order to determine the sequence of assembly operation, a search method guided by rules, such as merging of related operations, grouping of similar operations, and precedence rules based on know-hows and geometrical reasoning, is used. In this paper, the expert system developed is explained in detail regarding a global database, control strategies, and rule bases. For verification purposes, the evert system has been applied to simple examples. Since the rule bases are isolated from the inference engine in the developed system, it is easy to add more rules in the future.

A Special Protection Scheme Against a Local Low-Voltage Problem and Zone 3 Protection in the KEPCO System

  • Yun, Ki-Seob;Lee, Byong-Jun;Song, Hwa-Chang
    • Journal of Electrical Engineering and Technology
    • /
    • v.2 no.3
    • /
    • pp.294-299
    • /
    • 2007
  • This paper presents a special protection scheme, which was established in the KEPCO (Korea Electric Power Corporation) system, against a critically low voltage profile in a part of the system after a double-circuit tower outage. Without establishing the scheme, the outage triggers the operation of a zone 3 relay and trips the component. This sequence of events possibly leads to a blackout of the local system. The scheme consists of an inter-substation communication network using PITR (Protective Integrated Transmitter and Receiver) for acquisition of the substations' data, and under-voltage load shedding devices. This paper describes the procedure for determining the load shedding in the scheme and the experiences of the implementation.

Toward Global Optimum of Part Ordering in a Flexible Manufacturing System (FMS에서의 투입부품의 최적 순서결정에 관한 연구)

  • Lee, Young-Hae; Iwata, K.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.16 no.2
    • /
    • pp.51-62
    • /
    • 1990
  • One of the important scheduling and control problems that must be solved for the efficient operation of FMS could be the "part ordering problem" which is finding optimal sequence of parts to be released into a manufacturing system. In this paper an approach which solves the problem using simulation-optimization technique will be presented. Currently available heuristic approaches for dispatching rules can only get the near optimum at the local level because of the complexities of the system and the dependencies of its components whereas the proposed approach will try to get the global optimum for a given criterion.

  • PDF

Moving Object Segmentation Using Object Area Tracking Algorithm (움직임 영역 추출 알고리즘을 이용한 자동 움직임 물체 분할)

  • Lee Kwang-Ho;Lee Seung-Ik
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.9
    • /
    • pp.1240-1245
    • /
    • 2004
  • This paper presents the moving objects segmentation algorithms from the sequence images in the stationary backgrounds such as surveillance camera and video phone and so on. In this paper, the moving object area is extracted with proposed object searching algorithm and then moving object is segmented within the moving object area. Also the proposed algorithms have the robustness against noise problems and results show the proposed algorithm is able to efficiently segment and track the moving object area.

  • PDF

Real-time Algorithms to Minimize the Threatening Probability in a Fire Scheduling Problem for Unplanned Artillery Attack Operation (비계획 사격상황에서 적 위협 최소화를 위한 실시간 사격순서 결정 연구)

  • Cha, Young-Ho;Bang, June-Young;Shim, Sangoh
    • Korean Management Science Review
    • /
    • v.34 no.1
    • /
    • pp.47-56
    • /
    • 2017
  • We focus on the Real time Fire Scheduling Problem (RFSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing threatening probability to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We suggest mathematical modeling for RFSP and several heuristic algorithms. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithms outperform the firing method which is generally adopted in the field artillery.

Machine Repair Problem in Multistage Systems (직렬시스템의 수리 및 예비품 지원정책에 관한 연구)

  • Park, Young-Taek
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.15 no.2
    • /
    • pp.93-101
    • /
    • 1989
  • The classic machine repair problem is extended to the case where a number of different machines are arranged in the sequence of operation. The steady-state availability of the system with a series of operating machines is maximized under some constraints such as total cost, available space. In order to find the optimal numbers of spare units and repair channels for each operating machine, the problem is formulated as non-linear integer programming(NLIP) problem and an efficient algorithm, which is a natural extension of the new Lawler-Bell algorithm of Sasaki et al., is used to solve the NLIP problem. A numerical example is given to illustrate the algorithm.

  • PDF

Resistive Switching Characteristics of Ag Doped Ge0.5Se0.5 Solid Electrolyte

  • Kim, Jang-Han;Nam, Ki-Hyun;Chung, Hong-Bay
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2013.02a
    • /
    • pp.478-478
    • /
    • 2013
  • Resistance-change Random Access Memory (ReRAM) memory, which utilizes electrochemical control of metal in thin films of solid electrolyte, shows great promise as a future solid state memory. The technology utilizes the electrochemical formation and removal of metallic pathways in thin films of solid electrolyte. Key attributes are low voltage and current operation, excellent scalability, and a simple fabrication sequence. In this work, we investigated the nature of thin films formed by photo doping of Ag+ ions into chalcogenide materials for use in solid electrolyte of Resistance-change RAM devices and switching characteristics.

  • PDF

A Look-ahead Heuristic Algorithm for Large-scale Part-Machine Grouping Problems (대단위 부품-기계 군집 문제를 위한 Look-ahead 휴리스틱 알고리듬)

  • Baek Jong-Kwan;Baek Jun-Geol;Kim Chang Ouk
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.3
    • /
    • pp.41-54
    • /
    • 2005
  • In this paper, we consider a multi-objective machine cell formation problem. This problem Is characterized as determining part route families and machine cells such that total sum of inter-ceil part movements and maximum machine workload imbalance are simultaneously minimized. Together with the objective function, alternative part routes and the machine sequences of part routes are considered In grouping Part route families. Due to the complexity of the problem, a two-phase heuristic algorithm is proposed. And we developed an n-stage look-ahead heuristic algorithm that generalizes the roll-out algorithm. Computational experiments were conducted to verify the performance of the algorithm.

A High Speed Vision Algorithms for Axial Motion Sensor

  • Mousset, Stephane;Miche, Pierre;Bensrhair, Abdelaziz;Lee, Sang-Goog
    • Journal of Sensor Science and Technology
    • /
    • v.7 no.6
    • /
    • pp.394-400
    • /
    • 1998
  • In this paper, we present a robust and fast method that enables real-time computing of axial motion component of different points of a scene from a stereo images sequence. The aim of our method is to establish axial motion maps by computing a range of disparity maps. We propose a solution in two steps. In the first step we estimate motion with a low level computing for an image point by a detection estimation-structure. In the second step, we use the neighbourhood information of the image point with morphology operation. The motion maps are established with a constant computation time without spatio-temporal matching.

  • PDF