• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.6
• /
• pp.241-251
• /
• 2002

The effect of sensor faults in direct torque control(DTC) based induction motor drives is analyzed and a new Instrument fault detection isolation scheme(IFDIS) is proposed. The proposed IFDIS, which operated in real-time, detects and isolates the incipient fault(s) of speed sensor and current sensors that provide the feedback information. The scheme consists of an adaptive gain scheduling observer as a residual generator and a special sequential test logic unit. The observer provides not only the estimate of stator flux, a key variable in DTC system, but also the estimates of stator current and rotor speed that are useful for fault detection. With the test logic, the IFDIS has the functionality of fault isolation that only multiple estimator based IFDIS schemes can have. Simulation results for various type of sensor faults show the detection and isolation performance of the IFDIS and the applicability of this scheme to fault tolerant control system design.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.835-842
• /
• 2012

Operating Systems is a discipline which handles abstract concepts and techniques. However, most of OS courses have been textbook-oriented theoretical classes. Theoretical classes lead to the decline in the understanding of a lecture, and hurt their concentration. Many instructors have tried to make use of educational tools to help students understand lectures and arouse interests. This paper describes the design and implementation of a CPU scheduling simulator which shows the operation of process scheduling algorithms visually. The academic achievement evaluation for 2010's students and 2011's and t-test results show that the differences of the correct answer ratio for the exam about CPU scheduling algorithms are meaningful. The survey shows that the simulator is useful as an educational tool which causes the interests and enhances the understanding of a lecture, this teaching method is effective to develop problem solving skills.

• Journal of the military operations research society of Korea
• /
• v.32 no.2
• /
• pp.21-39
• /
• 2006

This paper presents a mixed linear and integer goal programming (GP) model to aid in strategic planning and scheduling of guard soldiers. The proposed model is a general-purpose model, hence can be used to produce an optimal schedule with respect to any user-provided combination of guard post objectives and soldier preferences. We extensively test the usefulness of the model on a real-life dataset from a guard post in the ROK Army with using three objectives set by the guard post and three preferences provided by individual solders. Numerical results and analysis from these experiments show that the proposed guard scheduling model efficiently as well as effectively generates an optimal guard schedule and can also be used for an optimal revision of any existing schedule. In summary, these illustrate that the proposed model can be practically used for optimal planning and scheduling of guard soldiers in guard posts.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.208-210
• /
• 2003

본 논문은 SOC 내에 존재하는 코아들을 테스트하는 과정에서 개별 코아들의 테스트 조건을 기반으로 한 스케듈링을 통해 최적의 Test ing time을 구하는 연구이다. SOC 내에 존재하는 코아들은 주어지는 TAM(Test Access Mechanism) Width에 따라 각코아들의 Width가 달라지고, 최대 Width에서 최소 Width(1)까지 각 Width 별로 Testing time을 계산할 수 있다. 코아들의 각 Width 별 Testing time을 기존의 Rectangle Packing Algorithm을 수정, 보완하여 효율적으로 구성한 수정 Rectangle Packing Algorithm에 적응하여 최적의 Testing time을 구하는 것이 본 논문의 목적이다.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.16-26
• /
• 2001

This paper proposes an extended scheduler model that is an extension of the existing model proposed already in [4, 5], which consists of upper layer task scheduler and lower layer scheduling framework. However, in order to support aperiodic task scheduling, the task scheduler has been divided into two parts, such as periodic task control component and aperiodic task control component. Thus, the proposed model can support various bandwidth-preserving servers that can service aperiodic tasks. The model distinctly separates a classic monolithic kernel scheduler into several kernel components according to their functionality. This enables system developers to implement a new scheduling algorithm or aperiodic task server independent of complex low kernel mechanism, and reconfigure the system at need. In Real-Time Linux [6], we implemented the proposed scheduling framework representative scheduling algorithms, and server bandwidth-preserving servers on purpose to test. Throughout these implementations, we confirmed that a new algorithm or server could be developed independently without updates of complex low kernel modules. In order to verify efficiency of the proposed model, we measured the performance of several aperiodic task servers. The results showed this the performance of model, which even consisted of two hierarchical components and several modules, didnt have such high run-time overhead, and could efficiently support reconfiguration and scheduler development.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.1940-1949
• /
• 2015

This paper presents an Enhanced Particle Swarm Optimization (EPSO) to solve short-term hydrothermal scheduling (STHS) problem with non-convex fuel cost function and a variety of operational constraints related to hydro and thermal units. The operators of the conventional PSO are dynamically controlled using exponential functions for better exploration and exploitation of the search space. The overall methodology efficiently regulates the velocity of particles during their flight and results in substantial improvement in the conventional PSO. The effectiveness of the proposed method has been tested for STHS of two standard test generating systems while considering several operational constraints like system power balance constraints, power generation limit constraints, reservoir storage volume limit constraints, water discharge rate limit constraints, water dynamic balance constraints, initial and end reservoir storage volume limit constraints, valve-point loading effect, etc. The application results show that the proposed EPSO method is capable to solve the hard combinatorial constraint optimization problems very efficiently.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.109-113
• /
• 2002

Steel industry is the most capital intensive and the largest energy consuming industry, which operate huge and complex facilities to supply various steel products as the primary materials to almost every manufacturing industry Major steel products are hot-rolled and cold-rolled coils, plates, and wires that are produced through molten iron making, molten steel making, casting, and rolling. Each process runs in batch between setups and the specifications or bach are different with each other High energy consuming and heavy material handling require careful synchronization or processes, as well. Considering the synchronization or processes, the lot planning and scheduling problem in the integrated steelmaking process rovers the roll grouping with given casts. the sequencing or rolls over time, and the machine assignment and time scheduling or charges and casts. The problem is investigated by dividing it into two cases whether single or parallel machines at the molten steel making and the continuous casting processes. Problem descriptions and solution approaches or each instance are introduced. To test their performance and conformity, implementation or the algorithms and numerical experiments are carried out with real world and constructed data sets.

• Management Science and Financial Engineering
• /
• v.19 no.1
• /
• pp.29-36
• /
• 2013

This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies on the problem, we consider sequence-dependent setup times that depend on the type of job just completed and on the job to be processed. The sequence-dependent setups, commonly found in various manufacturing systems, make the problem much more complicated. To represent the problem more clearly, a mixed integer programming model is suggested, and due to the complexity of the problem, two heuristics, one with individual sequence-dependent setup times and the other with aggregated sequence-dependent setup times, are suggested after analyzing the characteristics of the problem. Computational experiments were done on a number of test instances and the results are reported.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.373-380
• /
• 2007

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over and overlapping as well as demand splitting are considered. Also, maximum number of setups for each time period is not limited. For this LSSP, we have formulated a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we have developed an efficient heuristic algorithm by combining decomposition scheme with local search procedure. Test results show that the developed heuristic algorithm finds good quality (in practice, even better) feasible solutions using far less computation time compared with the CPLEX, a competitive MIP solver.