• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.35 no.4
• /
• pp.127-135
• /
• 1986

This paper represents a real time algorithm which improves the some drawbacks in the past methods for detection of the QRS conplexes of ECG signals. In the conventional method we can't detect QRS complex and QRS duration more correctly in case of (1) the contaminated ECG with 60Hz noise, muscle noise. (2) the movement of the baseline for a QRS complex. (3) being abnormal QRS complex with prolonging QRS. Therefore, we have proposed a new algorithm which can detect accurate QRS complex detection in case of the contaminated ECG with 60Hz noise, muscle noise, and movement of baseline for QRS complex. Moreover, in case of prolonging QRS we accomplished to detect not only QRS complex but also a single pulse that has a width proportional to QRS duration. This algorithm which is proposed in our paper in our paper in programmed with 6502 assembly language for real time ECG signal processing.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.8 no.12
• /
• pp.7-12
• /
• 1985

Line balancing algorithm can be classified by two class, the analytical method and the heuristic method. In this thesis the study was focused on the determinstic line balancing model of the single model production assembly line balancing which is one of the heuristic method. The algorithm of Tonge, Kilbridge & Wester, Helgeson & Birnie which is using the analytical method was examined with one example. And then the algorithms were compared with using line balancing-efficiency, number of work station, standard deviation and range. The result showed that Helgeson & Birnie algorithm is the most convenient in use. A computer program was run in order to use Helgeson & algorithm more conveniently.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.253-256
• /
• 1997

This paper proposes a control strategy of position and force control in the same direction based on hybrid position/force control. In order to control position and force in the same direction, a weighting matrix is introduced instead of a selection matrix suggested by Raibert and Craig. The major part of the controller output comes from the position controller when a position control error is large, from the force controller when a position control error is large. The proposed algorithm is implemented by the simulation and experiment focusing on the peg-in-hole task where friction exist significantly and is not constant. It also adopts and event control scheme for more efficient performance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.1
• /
• pp.15-39
• /
• 2009

Advanced planning and scheduling (APS) refers to a manufacturing management process by which raw materials and production capacity are optimally allocated to meet demand. APS is especially well-suited to environments where simpler planning methods cannot adequately address complex trade-offs between competing priorities. However, most scheduling problems of APS in the real world face both inevitable constraints such as due date, capability, transportation cost, set up cost and available resources. In this survey paper, we address three crucial issues in APS, including basic scheduling model, job-shop scheduling (JSP), assembly line balancing (ALB) model, and integrated scheduling models for manufacturing and logistics. Several evolutionary algorithms which adapt to the problems are surveyed and proposed; some test instances based on the practical problems demonstrate the effectiveness and efficiency of evolutionary approaches.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.4
• /
• pp.23-35
• /
• 1994

Efficient operation of a component placement machine with a multi-head in a PCB assembly process is considered. The problem consists of two subproblems, which are the optimal allocation of the component tape reels in the rack and the optimal mounting sequence of the components on a printed circuit board. We analyze the problem and propose a heuristic algorithm to solve it. The heuristic can be used for the one head case too. Computational experiences on some real world problems show the effectiveness of the heuristic in terms of speed and solution quality.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.740-745
• /
• 2005

Selective assembly is a method to find out appropriate matching pairs to be assembled to enhance the quality of the product. This study proposes an algorithm to select and match the components with two performance characteristics: at first, the number of matchable mates are calculated for each components. A matchable mate is defined to be the one of which the values of each performance characteristics lie in a rectangular mesh originated from the component under consideration. And the highest priority is given to the item with smallest number of matchable mates. The item of highest priority is matched to the one with smallest number of matchable mates among them. To find out the mates for the unmatched items, the mesh size is enlarged at the next iteration. Beginning with a small mesh, the procedure is repeated until the mesh covers the tolerance intervals of each performance characteristics. A VCR head case is analyzed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.1
• /
• pp.13-13
• /
• 1988

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.2
• /
• pp.31-38
• /
• 1994

We consider a single-machine scheduling problem dealing with the manufacture of components for subsequent assembly into end products. Each product requires both unique components and common components, and each production requires a setup. By making some assumptions on the data and the availability of the components for assembly, Baker provides on efficient dynamic programming algorithm for obtaining the optimal schedule. In this paper we do not impose any requirement on the data, and we solve the more complicated batching and sequencing problem. We suggest a simple heuristic method that is efficient and finds solutions that are optimal or close to the optimal solution.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.583-588
• /
• 1989

In this paper, a modelling methodology for a robotic workcell is proposed and compared with the conventional Petri nets model. Also, a method for managing the cell operation is described through the knowledge base. The knowledge bases for state transition and assembly job information are obtained from the state transition map(STM) and the assembly job tree(AJT), respectively. Using the knowledge base, the system structure is discussed in both managing the cell operation and evaluating the various performance. Finally, a simulation algorithm is presented with the simulation results to show the effectiveness of the proposed modelling approach.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.3
• /
• pp.235-241
• /
• 2007

This paper proposes a self-calibration method of robots those are used in industrial assembly lines. The proposed method is a position compensation using laser sensor and vision camera. Because the laser sensor is cross type laser sensor which can scan a horizontal and vertical line, it is efficient way to detect a feature of vehicle and winding shape of vehicle's body. For position compensation of 3-Dimensional axis, we applied block interpolation method. For selecting feature point, pattern matching method is used and 3-D position is selected by Euclidean distance mapping between 462 feature values and evaluated feature point. In order to evaluate the proposed algorithm, experiments are performed in real industrial vehicle assembly line. In results, robot's working point can be displayed 3-D points. These points are used to diagnosis error of position and reselecting working point.