• 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.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.12 no.6
• /
• pp.570-580
• /
• 2000

The performance simulation of refrigeration system for the automotive vehicles was peformed, in which the refrigerant was HFC-l34a as an alternative to CFC-12. The coefficient of performance of the system for HFC-l34a was lower than that for CFC-12 operated in the same operating and design conditions. The optimal design conditions were obtained as a function of optimum capacity ratios of condenser and evaporator.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.6
• /
• pp.47-53
• /
• 2016

This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.12
• /
• pp.575-580
• /
• 2000

Switching of the transmission lines(T/L) is one of the ways for suppressing the short circuit capacity. This paper presents the extended optimal power flow(OPF) to the problem of selecting the T/Ls to be open. The constraints of the short circuit currents within limits are added to the inequalities of OPF. Also, the overload on the other lines due to switching of T/Ls is avoided by the linearized inequalities. The number of the open lines can be minimized by incorporating into the objective function of OPF in order to maintain reliability. The method of an effective calculation of the extended OPF is also proposed in this paper, which makes the two parts decoupled. The one concerning the generation dispatch is solved in the first place by the conventional method. Secondly, the other concerning the line-switching is optimized by the proposed formulation.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.1
• /
• pp.9-15
• /
• 2005

In the operation of distribution systems, DGs (Distributed Generations) are installed as an alternative to extension and the establishment of substations, transmission and distribution lines according to the increasing power demand. In the operation planning of DGs, determining optimal capacity and allocation achieves economical profitability and improves the reliability of power distribution systems. This paper proposes a determining method for the optimal number, size and allocation of DGs in order to minimize the operation costs of distribution systems. Capacity and allocation of DGs for economical operation planning duration are determined to minimize total cost composed with power buying cost, operation cost of DGs, loss cost and outage cost using the GA (Genetic Algorithm).

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1261-1270
• /
• 2020

The physical security layer of industrial wireless sensor networks in the event of an eavesdropping attack has been investigated in this paper. An optimal sensor selection scheme based on the maximum channel capacity is proposed for transmission environments that experience Nakagami fading. Comparing the intercept probabilities of the traditional round robin (TRR) and optimal sensor selection schemes, the system secure performance is analyzed. Simulation results show that the change in the number of sensors and the eavesdropping ratio affect the convergence rate of the intercept probability. Additionally, the proposed optimal selection scheme has a faster convergence rate compared to the TRR scheduling scheme for the same eavesdropping ratio and number of sensors. This observation is also valid when the Nakagami channel is simplified to a Rayleigh channel.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.18 no.4 s.70
• /
• pp.445-452
• /
• 2005

This paper presents a design method to minimize Life Cycle Cost (LCC) of steel box girders. The LCC considered in this paper includes initial cost, expected life-cycle maintenance cost and repair cost. A load carrying capacity curve is derived from a condition grade curve of steel girders and load tarrying capacity that is measured in safety diagnostic test. And then, optimal design of steel box girders is performed on the basis of load carrying capacity curve. In this paper time and number of times for repair of steel girders are determined based on the calculated load carrying capacity curve. Also, annual costs considering real discount rate are compared and analyzed in various cases. It is concluded that the optimal design of steel box gilders considering LCC by the presented method will lead to more economical and safer girders than conventional design.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.1949-1957
• /
• 2016

Rapid Expansion of EVs(Electric Vehicles) is inevitable trends, to comply with eco-friendly energy paradigm according to Paris Agreement and to solve the environment problems such as global warming. In this paper, we analyze the limit point of transformer acceptable capacity as the increase of power demand considering EVs supply in the near future. Through the analysis of transformer utilization, we suggest methods to analyze the spare capacity of transformer for the case of optimal efficiency operation and emergency operation respectively. We have the results of 18.4~29% spare capacity for the charging infrastructure to the rated capacity of transformer by analyzing the existing sample apartments. It is analyzed that the acceptable number of EVs is 0.09~0.14 for optimal efficiency operation and 0.06~0.13 for emergency operation. Therefore, it is analyzed the power demand of EV will exceed the existing transformer spare capacity in 7~8 years as the annual growth rate of EVs is prospected 112.5% considering current annual growth rate of EVs and the government EV supply policy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2521-2526
• /
• 2013

In this paper, a novel spatial modulation (SM) with transmit antenna selection (TAS) based on maximizing channel capacity is proposed. Comparing to the conventional TAS technique, the proposed TAS considers the channel capacity of the MIMO channel with antenna selection. The optimal antenna set selection is applied to SM by taking account of the all possible sets, and then, a sub-optimal antenna set selection is also proposed for reducing the computational complexity of the optimal method. Computer simulations show that the proposed TAS significantly outperforms the existing SM scheme based on the magnitude of the channel vectors in terms of bit error rate (BER) in various environments.