• Title/Summary/Keyword: On-line balancing

Search Result 136, Processing Time 0.022 seconds

A Study on the Active Balancing for High-Speed Rotors (I): Development of the Active Balancing System (고속 회전체의 능동 밸런싱에 관한 연구 (I): 능동 밸런싱 장치의 개발)

  • Kim, Jong-Soo;Park, Hyun-Kyu;Lee, Soo-Hun
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.19 no.4
    • /
    • pp.140-146
    • /
    • 2002
  • High speed rotating machines can be very sensitive to rotating mass unbalance that is a major source of harmful vibration for many types of rotating machinery. So, the balancing procedure is needed for all high-speed rotating system. To save the time and cost of off-line balancing, many researchers have developed the on-line balancing devices and methods. In this paper, an active balancing device, which is an electro-magnetic type, is developed and the active balancing algorithm using influence coefficient method is also proposed. The active balancing experiment for flexible rotors during operation is performed by an active balancing device. As a result, controlled unbalance responses are below the vibration limit at all rotating speed ranges with critical speed.

Genetic Algorithm for Balancing and Sequencing in Mixed-model U-lines (혼합모델 U라인에서 작업할당과 투입순서 결정을 위한 유전알고리즘)

  • 김동묵
    • Journal of the Korea Safety Management & Science
    • /
    • v.6 no.2
    • /
    • pp.115-125
    • /
    • 2004
  • This paper presents a new method that can efficiently solve the integrated problem of line balancing and model sequencing in mixed-model U-lines (MMULs). Balancing and sequencing problems are important for an efficient use of MMULs and are tightly related with each other. However, in almost all the existing researches on mixed-model production lines, the two problems have been considered separately. A genetic algorithm for balancing and sequencing in mixed-model U line is proposed. A presentation method and genetic operators are proposed. Extensive experiments are carried out to analyze the performance of the proposed algorithm. The computational results show that the proposed algorithm is promising in solution quality.

Balancing and Sequencing in Mixed Model Assembly Lines Using an Endosymbiotic Evolutionary Algorithm (내공생 진화알고리듬을 이용한 혼합모델 조립라인의 작업할당과 투입순서 결정)

  • 김여근;손성호
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.4
    • /
    • pp.109-124
    • /
    • 2001
  • This paper presents a new method that can efficiently solve the integrated problem of line balancing and model sequencing in mixed model assembly lines (MMALs). Line balancing and model sequencing are important for an efficient use of MMALs. The two problems of balancing and sequencing MMALs are tightly related with each other. However, In almost all the existing researches on mixed-model production lines, the two problems have been considered separately. In this research, an endosymbiotic evolutionary a1gorithm, which is a kind of coevolutionary a1gorithm, is adopted as a methodology in order to solve the two problems simultaneously. This paper shows how to apply an endosymbiotic evolutionary a1gorithm to solving the integrated problem. Some evolutionary schemes are used In the a1gorithm to promote population diversity and search efficiency. The proposed a1gorithm is compared with the existing evolutionary algorithms in terms of solution quality and convergence speed. The experimental results confirm the effectiveness of our approach.

  • PDF

Balancing Shopping Mall Strategies on the On-line vs. on the Off-line (인터넷 쇼핑몰의 온라인.오프라인 균형전략에 대한 연구)

  • 조남재;박상혁
    • The Journal of Information Technology and Database
    • /
    • v.7 no.1
    • /
    • pp.83-97
    • /
    • 2000
  • Internet-based retail business spreads rapidly in Korea. Companies are trying to develop and use various strategic capabilities. The strategies employed by those companies include activities related to the design of shopping sites, market positionsing, facilitation of purchasing process, payment mechanism, and the provision of various consumer services. However, the success of these strategies depends on various environmental factors and internal capability of the companies. Especially, balancing activities performed on-line with those performed off-line is suggested to be essential. In this study, we examined three successful Internet shopping mall companies and compared them to draw useful guidelines for balancing shopping mall strategies - on - line vs. off - line. These three companies were selected because they are all considered sucessful by now, but brought different backgrounds.

  • PDF

Mixed Model Assembly Line-Balancing Using Simulation (시뮬레이션을 이용한 혼합모델 조립라인밸런싱)

  • 임석진;김경섭;박면웅;김승권
    • Journal of the Korea Society for Simulation
    • /
    • v.11 no.4
    • /
    • pp.69-80
    • /
    • 2002
  • This study deals with the productivity improvement on a flow production system with the consideration of line-balancing. In a flow production system, similar product models are produced on a same assembly line, the predefined process order and the limitation of total worker number. The system can be increased the work-in -process(WIP) inventory and the worker's idle time. In this study, the worker assignment model is developed to assign evenly workload of process to each product model in such a manner that each process has the different number of worker. This worker assignment model is the mathematical model that determines worker number in each process such that the idle time of processes is reduced and the utilization of worker is improved. We use a simulation technique to simulate the production line proposed by the mathematical model and apply real production line. With the result of simulation, this study analyzes the propriety of production line and proposes the alternatives of new production line

  • PDF

A Genetic Algorithm for Two-sided Assembly Line Balancing (양면 조립라인 밸런싱을 위한 유전알고리듬)

  • Kim, Yeo-Keun;Kim, Yong-Ju;Kim, Jun-Hyuk;Kwak, Jai-Seung
    • IE interfaces
    • /
    • v.12 no.1
    • /
    • pp.132-142
    • /
    • 1999
  • Two-sided (left- and right-sided) assembly lines in practice can provide several advantages over one-sided lines in terms of the required line length, throughput time, cost of tools and fixtures, and so on. This paper considers two-sided assembly line balancing with the objective of minimizing line length. The balancing problem is more complicated than that of one-sided lines due to sequence-dependency of tasks assigned to a pair of directly facing workstations. This paper shows how genetic algorithm can be used to solve two-sided assembly line balancing. For this, an encoding and a decoding method suitable to the problem are presented. Proper genetic operators and an evalutation function are also employed. Extensive computational experiments are carried out to show the efficacy of the proposed algorithm. The results show that the algorithm is viable and promising in solution quality and computation time.

  • PDF

A Markov Decision Process (MDP) based Load Balancing Algorithm for Multi-cell Networks with Multi-carriers

  • Yang, Janghoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3394-3408
    • /
    • 2014
  • Conventional mobile state (MS) and base station (BS) association based on average signal strength often results in imbalance of cell load which may require more powerful processor at BSs and degrades the perceived transmission rate of MSs. To deal with this problem, a Markov decision process (MDP) for load balancing in a multi-cell system with multi-carriers is formulated. To solve the problem, exploiting Sarsa algorithm of on-line learning type [12], ${\alpha}$-controllable load balancing algorithm is proposed. It is designed to control tradeoff between the cell load deviation of BSs and the perceived transmission rates of MSs. We also propose an ${\varepsilon}$-differential soft greedy policy for on-line learning which is proven to be asymptotically convergent to the optimal greedy policy under some condition. Simulation results verify that the ${\alpha}$-controllable load balancing algorithm controls the behavior of the algorithm depending on the choice of ${\alpha}$. It is shown to be very efficient in balancing cell loads of BSs with low ${\alpha}$.

Mixed-product flexible assembly line balancing based on a genetic algorithm (유전알고리듬에 기반을 둔 혼합제품 유연조립라인 밸런싱)

  • Song Won Seop;Kim Hyeong Su;Kim Yeo Keun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.1
    • /
    • pp.43-54
    • /
    • 2005
  • A flexible assembly line (FAL) is a production system that assembles various parts in unidirectional flow line with many constraints and manufacturing flexibilities. In this research we deal with a FAL balancing problem with the objective of minimizing the maximum workload allocated to the stations. However, almost all the existing researches do not appropriately consider various constraints due to the problem complexity. Therefore, this study addresses a balancing problem of FAL with many constraints and manufacturing flexibilities, unlike the previous researches. We use a genetic algorithm (GA) to solve this problem. To apply GA to FAL. we suggest a genetic representation suitable for FAL balancing and devise evaluation method for individual's fitness and genetic operators specific to the problem, including efficient repair method for preserving solution feasibility. After we obtain a solution using the proposed GA. we use a heuristic method for reassigning some tasks of each product to one or more stations. This method can improve workload smoothness and raise work efficiency of each station. The proposed algorithm is compared and analyzed in terms of solution quality through computational experiments.

On the Generation of Line Balanced Assembly Sequences Based on the Evaluation of Assembly Work Time Using Neural Network (신경회로망기법에 의한 조립작업시간의 추정 및 라인밸런싱을 고려한 조립순서 추론)

  • 신철균;조형석
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.2
    • /
    • pp.339-350
    • /
    • 1994
  • This paper presents a method for automatic generation of line balanced assembly sequences based on disassemblability and proposes a method of evaluating an assembly work time using neural networks. Since a line balancing problem in flexible assembly system requires a sophisticated planning method, reasoning about line balanced assembly sequences is an important field of concern for planning assembly lay-out. For the efficient inference of line balanced assembly sequences, many works have been reported on how to evaluate an assembly work time at each work station. However, most of them have some limitations in that they use cumbersome user query or approximated assembly work time data without considering assembly conditions. To overcome such criticism, this paper proposes a new approach to mathematically verify assembly conditions based on disassemblability. Based upon the results, we present a method of evaluating assembly work time using neural networks. The proposed method provides an effective means of solving the line balancing problem and gives a design guidance of planning assembly lay-out in flexible assembly application. An example study is given to illustrate the concepts and procedure of the proposed scheme.

Job Route Selection Expert System for Workload Balancing in Flexible Flow Line (유연생산라인의 부하평준화를 위한 작업흐름선택 전문가시스템)

  • 함호상;한성배
    • Journal of Intelligence and Information Systems
    • /
    • v.2 no.1
    • /
    • pp.93-107
    • /
    • 1996
  • A flexible flow line(FFL) consists of several groups of identical machines. All work-orders flow along the same path through successive machine groups. Thus, we emphasized the balancing of workloads between machine groups in order to maximize total productivity. On the other hand, many different types of work-orders, in varying batch or lot sizes, are produced simultaneously. The mix of work-orders, their lot sizes, and the sequence in which they are produced affect the amount of workload. However, the work-orders and their lot sizes are prefixed and cannot be changed. Because of these reasons, we have developed an optimal route selection model using heuristic search and Min-Max algorithm for balancing the workload between machine groups in the FFL.

  • PDF