• Journal of international Conference on Electrical Machines and Systems
• /
• v.3 no.2
• /
• pp.162-168
• /
• 2014

Use of nonlinear loads, such as power converters, fluorescent lamps and adjustable speed motor drives, is expected to grow rapidly. All of these loads inject harmonic currents. This paper presents the active filtering of the harmonic distortion generated by the compact fluorescent lamps (CFL). The Instantaneous active and reactive power theory (the p-q Theory) is used to design the control of parallel active filter. The control scheme has been verified using Matlab/Simulink with SimPower Systems through a set of simulation tests under different load conditions. Also, the tuning of the active power filter is performed to improve the quality of the electrical power supply.

• Journal of international Conference on Electrical Machines and Systems
• /
• v.3 no.4
• /
• pp.472-480
• /
• 2014

The In solar power system, the height and azimuth of the sun are important parameters which control generated power magnitude. The tracking method that controls the daily generation magnitude according to latitude and longitude using the two axles is often used in the existing sunlight tracking system today. In this two-axle PV track control system, the self-load is concentrated on one FRAME. It is influenced of the regular load, snow load and the wind load, etc. It is difficult to set up the system in the conventional building. This research is a development about the small-scale economy track device of independent load-dispersing solar generation system. The position tracking algorithm is through new coordinates transformation calculating the height and azimuth of the sun.

• Proceedings of the KIEE Conference
• /
• 2003.10b
• /
• pp.9-11
• /
• 2003

This paper deals with the comparison of rotor eddy current losses In two types of permanent magnet high-speed machines. The analytical method and two dimensional finite element analysis have been used to evaluate the rotor eddy current loss with the rotor magnetization Pattern. It is shown that the Halbach array produce rotor loss less than parallel magnetization.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.12-15
• /
• 2007

Online parallel machine scheduling problems have been studied by many researchers and enormous results are appeared in the last 40 years. With the development of scheduling theory and application, new online scheduling problems where the partial information is known in advance, that is, semi-online, gained much interest due to their increased application in practice. So we consider the online scheduling of three machines with general eligibility and its semi-online variant where the total processing time is known in advance. For the online and semi-online problems, we develop algorithms with competitive ratio of 5/2 which are shown to be optimal.

• Journal of international Conference on Electrical Machines and Systems
• /
• v.1 no.2
• /
• pp.105-110
• /
• 2012

This paper designs the high-efficiency and the low-cost drive system of the smallsize electric vehicles (EVs). The power circuit for driving the dc motor is designed by considering both the cost and efficiency. In order to reduce the conduction loss of MOTFET and diode for controlling an armature voltage, some MOSFETs and diodes at the armature are in parallel connection. An operating sequence for both the field current and the armature voltage according to the accelerator pedal angle is suggested for changing smoothly the rotating direction of dc motor. Through the simulation studies, the performances of the proposed methods are verified.

• Journal of international Conference on Electrical Machines and Systems
• /
• v.2 no.1
• /
• pp.1-8
• /
• 2013

Surface permanent magnet-type vernier motors with three magnet array-type rotors (parallel magnetized type, repulsion type, and Halbach type) are compared based on the pull-out torque. It was clarified that increasing the rotor radius increases the pull-out torque at a fixed three-phase alternating voltage. The mechanism for the pull-out torque increase on each magnet array type was different, when the effects of the increase were analyzed based on an induced electromotive force and a synchronous reactance. As a result, the design of the Halbach-type rotor was found to be especially effective for achieving high pull-out torque, because this array type achieves a large induced electromotive force $E_0$ and a small synchronous reactance $x_s$.

• Management Science and Financial Engineering
• /
• v.9 no.2
• /
• pp.47-68
• /
• 2003

We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.4
• /
• pp.63-71
• /
• 2003

This paper analyses a deterministic scheduling problem concerned with manufacturing multiple types of components at a pre-assembly stage composed of parallel fabrication machines. Each component part is machined on a fabrication machine specified in advance. The manufactured components are subsequently assembled into products. The completion time of a job(product) is measured by the latest completion time of its all components at the pre-assembly stage. The problem has the objective measure of minimizing the total weighted completion time of a finite number of jobs. Two lower bounds are derived and tested in a branch-and-bound scheme. Also, three constructive heuristic algorithms are developed based on the machine aggregation and greedy strategies. Some empirical evaluation of the performance of the proposed branch-and-bound and heuristic algorithms are also performed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.4
• /
• pp.304-311
• /
• 2003

This paper considers a new variation of scheduling problems where jobs are dispatched in batches. The variation is the case where the batch sequence is fixed. The objective is to minimize the sum of the completion times of the batches. This simple environment has a variety of real world applications such as part kitting and customer order scheduling. We show that this problem is binary NP-complete when there exist two machines. For the same problem, we develop an optimal dynamic programming (DP) algorithm which runs in pseudo-polynomial time. We finally prove the optimality of the DP algorithm.

• IE interfaces
• /
• v.12 no.2
• /
• pp.166-173
• /
• 1999

In this paper, a load balancing problem among operators is considered, when one or more identical machines can be assigned to an operator. The operations of a job are separated into three categories : machine-controlled elements, operator-controlled elements and machine/operator-controlled elements. Machining or forming operations are included into the first category. The second category includes inspection and moving to another machine, and the last category includes setup and loading/unloading operation. The objective is to balance the workloads among operators under the constraints of available machine-time and operator-time. A hierarchical heuristic solution procedure is suggested for allocating jobs to each machine and allocating machines to each operator. The performance of the algorithm is evaluated with various data set.