• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.8
• /
• pp.48-53
• /
• 2001

In order to increase productivity and efficiency, high-speed rotating machines become popular these days. The high-speed rotating machine is likely to vibrate and cause machine failure even though it has small unbalance. Therefore, a balancing technique is studied in this paper. Off-line balancing methods are inadequate to solve unbalance vibration problem occurring in the field due to flexible rotor effect, faster tool change, and shorter spin-up and down, etc. An active balancing is suggested to allow re-balancing of the entire rotating assembly in the machine when a tool is changed. This paper shows how to identify the dynamics of the system using influence coefficient and suggest an active balancing technique based on influence coefficient method for high-speed spindle system.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.217-228
• /
• 1994

This paper presents a new integer formulation (Type III ALB) for a single model assembly line balancing problem. The objective of the formulation is to minimize the total idle time, which is defined as the product of the number of work stations and the cycle times minus the total work content. This formulation considers currently existing Type I (minimizing the number of work stations for a given cycle time) and type II (minimizing the cycle time for a given number of work stations) formulations as its special cases and provides the global minimum solutions of the cycle time and the number of work stations. This information would be of great value to line designers involved in designing new assembly lines and rebalancing old lines under flexible conditions. Solution methods based on combination of Type I and Type II approaches are also suggested and compared.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.83-101
• /
• 1998

Assembly U-lines are increasingly accepted in industry, especially just-in-time production systems, for the efficient utilization of workforce. In this paper, we present an integer programming formulation and a branch-and-bound method for balancing the U-line with the objective of minimizing the number of workstations with a fixed cycle time. In the mathematical model, we provide the method that can reduce the number of variables and constraints. The proposed branch-and-bound method searches the optimal solution based on a depth-first-search. To efficiently search for the optimal solutions to the problems, an assignment rule is used in the method. Bounding strategies and dominance rules are also utilized. Some problems require a large amount of computation time to find the optimal solutions. For this reason. some heuristic fathoming rules are also proposed. Extensive experiments with test-bed problems in the literature are carried out to show the performance of the proposed method. The computational results show that our method is promising in solution quality.

• Journal of Power Electronics
• /
• v.12 no.4
• /
• pp.567-577
• /
• 2012

This paper introduces a new scheme to balance the DC bus voltages of a cascaded H-bridge converter which is used as a Distribution Static Synchronous Series Compensator (D-SSSC) in electrical distribution network. The aim of D-SSSC is to control the power flow between two feeders from different substations. As a result of different cell losses and capacitors tolerance the cells DC bus voltage can deviate from their reference values. In the proposed scheme, by individually modifying the reference PWM signal for each cell, an effective balancing procedure is derived. The new balancing procedure needs only the line current sign and is independent of the main control strategy, which controls the total DC bus voltages of cascaded H-bridge. The effect of modulation index variation on the capacitor voltage is analytically derived for the proposed strategy. The proposed method takes advantages of phase shift carrier based modulation and can be applied for a cascaded H-bridge with any number of cells. Also the system is immune to loss of one cell and the presented procedure can keep balancing between the remaining cells. Simulation studies and experimental results validate the effectiveness of the proposed method in the balancing of DC bus voltages.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.9-13
• /
• 2007

This paper proposes a policy on efficient load balancing that can reduce the network game server load burdened by surging number of users. The study adopted a contents-based clustering technique. Recently, skyrocketing number of clients in on-line games causes overloads on specific game servers, and the consequent server-instability brings the worst situation: a server failure. To cope with this problem, one can install more high-powered servers or be equipped with back-up servers, which is often inefficient in terms of cost performance. To solve this problem, the present study examined the technology enhancing the performance and efficiency of game servers by reducing the loads of specific game servers. In doing this, this study used the clustering technology to compose game servers classified by their contents and carried out appropriate load balancing to numerous clients with load balancers in each region.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.157-162
• /
• 2010

The cart-pole balancing problem is a pseudo-standard benchmark problem from the field of control methods including genetic algorithms, artificial neural networks, and reinforcement learning. In this paper, we propose a novel approach by using online reinforcement learning(OREL) to solve this cart-pole balancing problem. The objective is to analyze the learning method of the OREL learning system in the cart-pole balancing problem. Through experiment, we can see that approximate faster the optimal value-function than Q-learning.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.72-72
• /
• 1995

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.737-740
• /
• 1996

This paper suggests a boltzman machine neural network model to determine model input sequences in line balancing process of mixed model assembly line. We first present a proper energy function, next determine the value of parameters using simulation process.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.469-469
• /
• 1996

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.89-96
• /
• 2022

This paper suggests heuristic algorithm for single-model cross-over assembly line balancing problem that is a kind of NP-hard problem. The assembly line balance problem is mainly applied with metaheuristic methods, and no algorithm has been proposed to find the exact solution of polynomial time, making it very difficult to apply in practice. The proposed bi-directional clustering algorithm computes the minimum number of worker m^* = ⌈W/c⌉ and goal cycle time c^* = ⌈W/m^*⌉ from the given total assembling time W and cycle time c. Then we assign each workstation i=1,2,…,m^* to T_i=c^* ±α≤ c using bi-directional clustering method. For 7 experimental data, this bi-directional clustering algorithm same performance as other methods.