• Management Science and Financial Engineering
• /
• 제9권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.

• 설비공학논문집
• /
• 제12권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.

• 한국컴퓨터정보학회논문지
• /
• 제21권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.

• 대한전기학회논문지:전력기술부문A
• /
• 제49권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
• /
• 제5A권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
• /
• 제16권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
• /
• 제6권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.

• 한국전산구조공학회논문집
• /
• 제18권4호통권70호
• /
• pp.445-452
• /
• 2005

본 논문에서는 강박스 거더의 생애주기비용을 최소화하기 위한 방법을 제시하였다. 본 논문에서 고려된 강박스 거더의 생애주기비용은 초기비용, 유지관리비용 및 보수비용으로 구성되었다. 강재 주형의 상태등급곡선과 안전진단 결과 측정된 내하력을 바탕으로 내하력곡선을 추정하였으며, 이 곡선을 이용하여 생애주비용을 고려한 강박스 거더의 최적설계를 수행하였다. 또한 내하력곡선을 통해 강박스 거더의 공용수명과 보수 보강 시기 및 횟수를 결정하고 초기 내하력에 따른 생애주기 동안 발생하는 연간비용을 비교, 분석하였다. 본 논문에서 제안한 생애주기비용을 고려한 강박스 거더의 최적설계를 통하여 기존의 설계에 비해 보다 경제적이며 안전한 설계를 유도할 수 있으리라 판단된다.

• 전기학회논문지
• /
• 제65권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.

• 한국정보통신학회논문지
• /
• 제17권11호
• /
• pp.2521-2526
• /
• 2013

본 논문에서는 공간변조 (Spatial Modulation, SM) 시스템에서 다중안테나 채널 용량을 고려한 송신 안테나 선택 기술을 제안하고 그 성능을 분석한다. 각 송신 안테나에서 수신안테나까지의 채널 벡터의 크기에 기반하여 안테나를 선택하는 기존 기술과 비교할 때, 제안하는 기술은 채널용량 자체를 계산하여 전체적인 공간변조 시스템의 용량 증가를 가져온다. 전체 안테나 중 사용할 안테나의 집합을 선택하는 모든 경우를 비교하여 최적의 안테나 집합을 선택하는 최적 방법 (Optimal)을 제시하고, 추가적으로 계산 복잡도를 줄이면서 최적 성능과 유사한 성능을 제공하는 Sub-Optimal 기술을 함께 제시한다. 시뮬레이션을 통하여 제안한 안테나 선택 방법이 기존의 안테나 선택 방법에 비하여 bit error rate(BER) 측면에서 월등한 성능을 제공함을 확인하였다.