• 제목/요약/키워드: on line algorithm

검색결과 2,426건 처리시간 0.035초

작업완료시각 추정을 활용한 배치 스케줄링 및 사례 연구 (Batch Scheduling Algorithm with Approximation of Job Completion Times and Case Studies)

  • 김송은;박성현;김수민;박경수;황민형;성종은
    • 산업경영시스템학회지
    • /
    • 제43권4호
    • /
    • pp.23-32
    • /
    • 2020
  • Many small and medium-sized manufacturing companies process various product types to respond different customer orders in a single production line. To improve their productivity, they often apply batch processing while considering various product types, constraints on batch sizes and setups, and due date of each order. This study introduces a batch scheduling heuristic for a production line with multiple product types and different due dates of each order. As the process times vary due to the different batch sizes and product types, a recursive equation is developed based on a flow line model to obtain the upper bound on the completion times with less computational complexity than full computation. The batch scheduling algorithm combines and schedules the orders with same product types into a batch to improve productivity, but within the constraints to match the due dates of the orders. The algorithm incorporates simple and intuitive principles for the purpose of being applied to small and medium companies. To test the algorithm, two case studies are introduced; a high pressure coolant (HPC) manufacturing line and a press process at a plate-type heat exchanger manufacturer. From the case studies, the developed algorithm provides significant improvements in setup frequency and thus convenience of workers and productivity, without violating due dates of each order.

Two-Terminal Numerical Algorithm for Single-Phase Arcing Fault Detection and Fault Location Estimation Based on the Spectral Information

  • Kim, Hyun-Houng;Lee, Chan-Joo;Park, Jong-Bae;Shin, Joong-Rin;Jeong, Sang-Yun
    • Journal of Electrical Engineering and Technology
    • /
    • 제3권4호
    • /
    • pp.460-467
    • /
    • 2008
  • This paper presents a new numerical algorithm for the fault location estimation and arcing fault detection when a single-phase arcing ground fault occurs on a transmission line. The proposed algorithm derived in the spectrum domain is based on the synchronized voltage and current samples measured from the PMUs(Phasor Measurement Units) installed at both ends of the transmission lines. In this paper, the algorithm uses DFT(Discrete Fourier Transform) for estimation. The algorithm uses a short data window for real-time transmission line protection. Also, from the calculated arc voltage amplitude, a decision can be made whether the fault is permanent or transient. The proposed algorithm is tested through computer simulation to show its effectiveness.

Cluster Analysis Algorithms Based on the Gradient Descent Procedure of a Fuzzy Objective Function

  • Rhee, Hyun-Sook;Oh, Kyung-Whan
    • Journal of Electrical Engineering and information Science
    • /
    • 제2권6호
    • /
    • pp.191-196
    • /
    • 1997
  • Fuzzy clustering has been playing an important role in solving many problems. Fuzzy c-Means(FCM) algorithm is most frequently used for fuzzy clustering. But some fixed point of FCM algorithm, know as Tucker's counter example, is not a reasonable solution. Moreover, FCM algorithm is impossible to perform the on-line learning since it is basically a batch learning scheme. This paper presents unsupervised learning networks as an attempt to improve shortcomings of the conventional clustering algorithm. This model integrates optimization function of FCM algorithm into unsupervised learning networks. The learning rule of the proposed scheme is a result of formal derivation based on the gradient descent procedure of a fuzzy objective function. Using the result of formal derivation, two algorithms of fuzzy cluster analysis, the batch learning version and on-line learning version, are devised. They are tested on several data sets and compared with FCM. The experimental results show that the proposed algorithms find out the reasonable solution on Tucker's counter example.

  • PDF

송전선로용 디지털 고장점 표정장치에 관한 연구 (A Study on Digital Fault Locator for Transmission Line)

  • 이경민;박철원
    • 전기학회논문지P
    • /
    • 제64권4호
    • /
    • pp.291-296
    • /
    • 2015
  • Transmission line is exposed to a large area, and then faults are likely to occur than the other component of power system. When a fault occurs on a transmission line, fault locator helps fast recovery of power supply on power system. This paper deals with the design of a digital fault locator for improvement accuracy of the fault distance estimation and a fault occurrence position for transmission line. The algorithm of a fault locator uses a DC offset removal filter and DFT filter. The algorithm utilizes a fault data of GPS time synchronized. The computed fault information is transmitted to the other side substation through communication. The digital fault locator includes MPU module, ADPU module, SIU module, and a power module. The MMI firmware and software of the fault locator was implemented.

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

  • 송원섭;김형수;김여근
    • 한국경영과학회지
    • /
    • 제30권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.

Line Histogram Intensity를 이용한 이동로봇의 장애물 회피 알고리즘 (The Obstacle Avoidance Algorithm of Mobile Robot using Line Histogram Intensity)

  • 류한성;최중경;구본민;박무열;윤경섭;윤석영
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
    • /
    • pp.331-334
    • /
    • 2002
  • In this paper, we present two types of vision algorithm that mobile robot has CCD camera. for obstacle avoidance. This is simple algorithm that compare with grey level from input images. Also, The mobile robot depend on image processing and move command from PC host. we has been studied self controlled mobile robot system with CCD camera. This system consists of digital signal processor, step motor, RF module and CCD camera. we used wireless RF module for movable command transmitting between robot and host PC. This robot go straight until recognize obstacle from input image that preprocessed by edge detection, converting, thresholding. And it could avoid the obstacle when recognize obstacle by line histogram intensity. Host PC measurement wave from various line histogram each 20 Pixel. This histogram Is ( x , y ) value of pixel. For example, first line histogram intensity wave from ( 0, 0 ) to ( 0, 197 ) and last wave from ( 280, 0 ) to ( 280, 197 ). So we find uniform wave region and nonuniform wave region. The period of uniform wave is obstacle region. we guess that algorithm is very useful about moving robot for obstacle avoidance.

  • PDF

시간-주파수 반사파 계측 방법을 이용한 전송선로의 결함 위치 추정 (Estimation of Fault Location on a Transmission Line via Time-Frequency Domain Reflectometry)

  • 최덕선;곽기석;윤태성;박진배
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제54권9호
    • /
    • pp.521-530
    • /
    • 2005
  • In this paper, a new high resolution reflectometry scheme, time-frequency domain reflectometry(TFDR), isproposed to detect and estimate a fault in a transmission line. Traditional reflectometry methodologies have been achieved either in the time domain or in the frequency domain only. However, the TFDR can jump over the performance limits of the traditional reflectometry methodologies because the acquired signal is analyzed in time and frequency domain simultaneously. In the TFDR, the new reference signal and the novel TFDR algorithm are proposed for analyzing the acquired signal in the time-frequency domain. Because the reference signal of Gaussian envelop chirp signal is localized in the time and frequency domain simultaneously, it is suitable to the analysis in the time-frequency domain. In the proposed TFDR algorithm, the time-frequency distribution function and the normalized time-frequency cross correlation function are used to detect and estimate a fault in a transmission line. That algorithm is verified for real-world coaxial cables which are typical transmission line with different types of faults by the TFDR system composed of real instruments. The performance of the TFDR methodology is compared with that o( the commercial time domain reflectomeoy(TDR) experiments, so that concludes the TFDR methodology can detect and estimate the fault with smaller error than TDR methodology.

연계점에서의 복소전력을 이용한 단독운전 판단기법 (Islanding Detection Based on Complex Power at the Intertie)

  • 강용철;차선희;장성일;강해권;김용균;박군철
    • 전기학회논문지
    • /
    • 제57권12호
    • /
    • pp.2167-2172
    • /
    • 2008
  • A large scale embedded generator or a micro-grid is usually interconnected to the grid through the dedicated line. Immediately after the removal of the grid supply, it must be disconnected and remain disconnected until the normal grid supplies are restored. This paper proposes an islanding detection algorithm based on complex power at the intertie. Complex power at the intertie delivered to the grid has a value depending on power flow during normal operation. When loss of mains occurs, complex power at the intertie moves to a value depending on the parameters of the dedicated line. The performance of the proposed algorithm was investigated under various operating and fault conditions. The proposed algorithm can detect an islanding operation even if no power is exchanged prior to loss of mains and discriminate the fault condition from islanding.

지역 복잡도 기반 방법 선택을 이용한 적응적 디인터레이싱 알고리듬 (Adaptive De-interlacing Algorithm using Method Selection based on Degree of Local Complexity)

  • 홍성민;박상준;정제창
    • 한국통신학회논문지
    • /
    • 제36권4C호
    • /
    • pp.217-225
    • /
    • 2011
  • 본 논문에서는 영상의 지역 특성별로 보간 방법을 적응적으로 선택하여 적용하는 효과적인 디인터레이싱 알고리듬을 제안한다. 기존의 알고리듬들의 경우 각기 다른 방법으로 방향성을 구하기 때문에 영상의 지역 특성별로 성능이 다르게 나오는 경우가 있다. 또한, FDD(Fine Directional De-interlacing) 알고리듬의 경우 PSNR(Peak Signal-to-Noise Ratio)은 다른 알고리듬들에 비해 높게 나오지만 계산량이 많다는 단점이 있다. 이를 보안하기 위해 본 논문에서는 여러 영상들에서 계산량은 적으면서 화질 성능은 뛰어난 LA(Line Average), MELA(Modified Edge-based Line Average), LCID(Low-Complexity Interpolation Method for De-interlacing) 알고리듬들 중 지역복잡도 (DoLC, Degree of Local Complexity)별로 효과적인 알고리듬을 학습하여 이를 이용하여 보간을 수행하는 디인터레이싱 방법을 제안한다. 실험 결과 제안하는 방법은 좋은 성능에 비해 계산량이 적은 LCID 알고리듬과 비슷한 계산량을 보이면서 객관적 화질이 우수한 FDD, MELA 알고리듬보다 PSNR로 대표되는 객관적 화질과 주관적 화질 측면에서 우수한 결과를 나타내는 것을 알 수 있다.

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)
    • /
    • 제8권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}$.