• Title/Summary/Keyword: line balancing

Search Result 209, Processing Time 0.025 seconds

Adaptive Online Load Balancing Algorithm for Multimedia Service in Cellular Networks (셀룰러 네트워크 상에서 멀티미디어 서비스 제공을 위한 효율적인 온라인 부하분산 기법에 대한 연구)

  • Kim, Sung-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12B
    • /
    • pp.811-817
    • /
    • 2005
  • Efficient bandwidth management is necessary in order to provide high quality service to users in a multimedia wireless/mobile network. In this paper, I propose an on-line load balancing algorithm with preemption. This technique is able to balance the traffic load among cells accommodating heterogeneous multimedia services while ensuring efficient bandwidth utilization. The most important features of my algorithm are its adaptability, flexibility and responsiveness to current network conditions. In addition, my online scheme to control bandwidth adaptively is a cell-oriented approach. This approach has low complexity making it practical for real cellular networks. Simulation results indicate the superior performance of my algorithm.

저궤도 위성용 리튬-이온 배터리의 성능 확보를 위한 Balancing기법에 관한 고찰

  • Lee, Sang-Rok;Im, Seong-Bin;Jeon, Hyeon-Jin
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.37 no.2
    • /
    • pp.188.1-188.1
    • /
    • 2012
  • 인공위성에 사용되는 배터리 기술은 1960년대 최초로 사용된 니켈 카드뮴(NiCd)을 시작으로 발전하기 시작해서 현재는 리튬-이온(Li-Ion)에 이르렀다. 리튬-이온 배터리는 높은 Energy Density(작은 크기와 무게), 낮은 자가 방전율을 가짐과 동시에 메모리 효과가 거의 없다는 장점이 있다. 하지만 리튬-이온 배터리 팩의 성능(Voltage, Capacity, Lifetime)은 사용된 Cell간 특성차이(State of Charge, Total Capacity Difference, Internal Impedance)에 의해 제한된다. 일반적으로 배터리는 원하는 전압과 용량을 확보하기 위해 직렬-병렬 혹은 병렬-직렬 구조를 가지는 팩 형태로 제작 된다. Cell간 특성차이가 존재하는 상태에서 배터리 팩을 사용할 경우 특정 Cell의 과충전 및 과방전이 발생하며 이로 인해 수명이 단축될 수 있고 심한 경우 폭발이 발생할 수 도 있다. 또한 Cell간 특성차이는 배터리팩의 사용가능 용량을 제한하는 효과를 가져 온다. 본 논문에서는 Battery 팩을 구성하는 Cell들에 특성 차이가 존재할 경우 발생할 수 있는 Battery 팩의 수명 단축 및 용량 감소 Mechanism에 대해서 고찰한다. 또한 Cell간 특성차이를 극복하기 위해 실제 위성 운용에 적용될 수 있는 배터리팩의 Balancing 방안과 함께 위성에 장착을 위해 보관중인 4p12s Battery의 Balancing 방안에 대해 고찰하고 Balancing 전후의 Cell간 특성(Voltage Dispersion) 차이 측정결과를 보인다. 이렇게 본 논문에서 소개한 리튬-이온 배터리의 전반적인 Balancing 방안은 추후 인공위성에 적용되는 리튬-이온 배터리의 운용 및 보관에 Guide Line을 제시할 것이라고 판단한다.

  • PDF

A Study of Product Simulation for Establishing the Optimal Production Scheduling of the Panel line in a Shipyard (조선소 판넬라인의 최적 생산계획 수립을 위한 생산 시뮬레이션 연구)

  • Park, Ju-Yong;Kim, Se-Hwan;Choi, Woo-Hyun
    • Journal of Welding and Joining
    • /
    • v.24 no.5
    • /
    • pp.62-66
    • /
    • 2006
  • Panel line is an important process occupying the largest work amount in shipbuilding. In this research product simulation has been carried out to establish the optimal production scheduling. For this purpose a web-based panel line simulator was developed using an object modeling technology and C# language. The balance of work-load and increase in the productivity by the improvement of production facilities and process are the key factors for a good scheduling. In this study SPRT(Shortest Remaining Process Time) rule was applied for the work-load balancing and a good result achieved. To increase the productivity in the stiffener welding stage which is a bottleneck; process, more welding heads and higher welding speed were tested using the developed simulator. The simulation results showed that either more welding head or higher welding speed decreased the total work time. Use of both, however, deteriorated the productivity because of the bottleneck in the following stage. This result points out that the improvement of production facilities and/or process should be evaluated with their influences on the leading and following processing stage.

Adaptive Control for the Conventional Mode of Operation of MEMS Gyroscopes

  • Park, Sungsu;Roberto Horowitz
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.39.2-39
    • /
    • 2002
  • This paper presents adaptive add-on control algorithms for theconventional mode of operation of MEMS z-axis gyroscopes. This scheme is realized by adding an outer loop to a conventional force-balancing scheme that includes a parameter estimation algorithm. The parameter adaptation algorithm estimates the angular rate, identifies and compensates the quadrature error, and may permit on-line automatic mode tuning. The convergence and resolution analysis show that the proposed adaptive add-on control scheme prevents the angular rate estimate from being contaminated by the quadrature error, while keeping ideal resolution performance of a conventional force-balancing scheme.

  • PDF

A Study on the Relationship between Cycle Time and Balance Delay (조립생산에 있어서 주기시간과 라인평형 지연관계에 관한 연구)

  • 박명규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.5 no.7
    • /
    • pp.17-24
    • /
    • 1982
  • Most line balancing technique widely used in manufacturing industry is done by balancing to a cycle or operator, time determined to provide the exact number of required units per day. No thought is given to benefit foregone by making slight changes to cycle time to achieve better distribution of the work among operators. This study provides a method to minimize balance delay by the choice of cycle time.

  • PDF

Balancing assembly line in an electronics company

  • 박경철;강석훈;박성수;김완희
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1993.10a
    • /
    • pp.12-19
    • /
    • 1993
  • In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.

  • PDF

Survey of Evolutionary Algorithms in Advanced Planning and Scheduling

  • Gen, Mitsuo;Zhang, Wenqiang;Lin, Lin
    • 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.

An Evolutionary Algorithm for Goal Programming: Application to two-sided Assembly Line Balancing Problems (목표계획법을 위한 진화알고리즘: 양면조립라인 밸런싱 문제에 적용)

  • Song, Won-Seop;Kim, Yeo-Geun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2008.10a
    • /
    • pp.191-196
    • /
    • 2008
  • This paper presents an evolutionary algorithm for goal programming with preemptive priority. To do this, an evolutionary strategy is suggested which search for the solution satisfying the goals in the order of the priority. Two-sided assembly line balancing problems with multiple goals are used to validate the applicability of the algorithm. In the problems, three goals are considered in the following priority order: minimizing the number of mated-stations, achieving the goal level of workload smoothness, and maximizing the work relatedness. The proper evolutionary components such as encoding and decoding method, evaluation scheme, and genetic operators, which are specific to the problem being solved, are designed in order to improve the algorithm's performance. The computational result is reported.

  • PDF

Balancing and Sequencing of Mixed Model Assembly Lines Using A Genetic Algorithm (유전알고리듬을 이용한 혼합모델 조립라인의 작업할당과 투입 순서 결정)

  • 김동묵;김용주;이남석
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2005.05a
    • /
    • pp.523-534
    • /
    • 2005
  • This paper is concerned with the integrated problem of line balancing and model sequencing in mixed model assembly lines(MMALBS), which is important to efficient utilization of the lines. In the problem, we deal with the objective of minimizing the overall line length To apply the GAs to MMALBS problems, we suggest a GA representation which suitable for its problems, an efficient decoding technique for the objective, and genetic operators which produce feasible offsprings. Extensive experiments are carried out to analyze the performance of the proposed algorithm. The computational results show that our algorithm is promising in solution quality.

  • PDF

A Heuristic Method for Assembly Line Balancing of Large-Sized Product (대형제품의 조립라인 밸런싱을 위한 Heuristic 기법)

  • Kim, Y.G.;Kwon, S.H.;Cho, M.R.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.17 no.2
    • /
    • pp.51-61
    • /
    • 1991
  • This paper presents a heuristic method for the Assembly Line Balancing(ALB) of the large-sized product. In the ALB problem of the large-sized product such as bus and truck, the assignments of the Related Task Groups(RTG), the same side tasks, and team tasks should be considered. In this paper, a new concept of the RTG and two kinds of assignment rules are proposed to resolve the above considerations. The first assignment rule allots the RTG with the constraint of the same side tasks to the station while the second allots the RTG to the station, relaxing the above constraint to increase the applicability of the method. An assignment rule for team tasks is also presented. The benefits of the method are to improve work methods, to give more job satisfaction to workers, and to allow greater flexibility in the design of assembly lines.

  • PDF