• Journal of Communications and Networks
• /
• 제11권2호
• /
• pp.148-156
• /
• 2009

The fixed spectrum assignment policy in today's wireless networks leads to inefficient spectrum usage. Cognitive radio network is a new communication paradigm that enables the unlicensed users to opportunistically use the spatio-temporally unoccupied portions of the spectrum, and hence realizing a dynamic spectrum access (DSA) methodology. Interference temperature model proposed by Federal Communications Commission (FCC) permits the unlicensed users to utilize the licensed frequencies simultaneously with the primary users provided that they adhere to the interference temperature constraints. In this paper, we formulate two NP-hard optimal scheduling methods that meet the interference temperature constraints for cognitive radio networks. The first one maximizes the network throughput, whereas the second one minimizes the scheduling delay. Furthermore, we also propose suboptimal schedulers with linear complexity, referred to as maximum frequency selection (MFS) and probabilistic frequency selection (PFS). We simulate the throughput and delay performance of the optimal as well as the suboptimal schedulers for varying number of cognitive nodes, number of primary neighbors for each cognitive node, and interference temperature limits for the frequencies. We also evaluate the performance of our proposed schedulers under both additive white gaussian noise (AWGN) channels and Gilbert-Elliot fading channels.

• Industrial Engineering and Management Systems
• /
• 제8권3호
• /
• pp.155-161
• /
• 2009

We focus on discrete event systems with a structure of parallel processing, synchronization, and no-concurrency. We use max-plus algebra, which is an effective approach for controller design for this type of system, for modeling and formulation. Since a typical feature of this type of system is that the initial schedule is frequently changed due to unpredictable disturbances, we use a simple model and numerical examples to examine the possibility of applying the concepts of the feeding buffer and the project buffer of critical chain project management (CCPM) on max-plus linear discrete event systems in order to control the occurrence of an undesirable state change. The application of a CCPM-based framework on a max-plus linear discrete event system was proven to be effective.

• 한국건축시공학회지
• /
• 제11권1호
• /
• pp.1-8
• /
• 2011

기존의 선형 공정계획은 마스터 스케쥴과 같이 작업분류체계의 대분류 레벨의 작업을 사선의 형태로 표현하는 데 국한하고 수작업으로 작성하였다. 즉, 네트워크 공정표의 정보를 활용하지 못하고 독립적으로 선형 공정표를 작성하여 보고용 또는 전체 공정계획 확인용으로 사용하고 있는 실정이다. 따라서 기존에 축적된 자료가 많은 네트워크 공정표를 기반으로 선형 공정표를 자동으로 생성할 수 있는 시스템 개발이 필요하다. 이에 본 연구는 선형 공정표 구현을 위한 데이터 프로세스 모델, 데이터 플로 다이어그램, 데이터모델을 구축하고 시스템 프로토 타입의 시스템 솔류션 구조, 클래스 다이어그램, 데이터 타입스키마를 개발하고자 한다. 즉, 네트워크 공정표를 선형 공정표로 변환하기 위한 시스템 프로토타입 개발의 선행 연구를 수행하는 것이 본 연구의 목적이다.

• 한국산림과학회지
• /
• 제82권3호
• /
• pp.292-304
• /
• 1993

이 연구에서는 대단지 산림자원의 수확벌채계획(收穫伐採計劃) 수립을 위한 선행계획 전산모델의 기초체계를 제시하였다. 모델에서 사용한 선형계획수식화모형은 비감소수확(非減少收穫)에 허용증감율을 적용하여 목표림의 유도, 최소 목재공급의 한계 및 최대 벌채면적의 한계와 같은 산림생산 제약조건들을 포함하고 있다. 이 모델에서는 Model I 및 Model II 기법에 의한 선형계획 수식화가 가능하고, Matrix 출력은 MPS 양식에 의한다. 전산모델 개발에 있어서 선형계획기법에 의한 산림자원 경영분석방법론(經營分析方法論)의 타당성(妥當性)은 문헌고찰에 의해 이미 국내에 소개된 바 있는 감반율법(減反率法) 및 이분검색법(二分檢索法)의 해법특성(解法特性)과의 비교고찰(比較考察)을 통해 검토하였다. 또한 제시된 모델체계의 적용성은 대규모 산림자원 경영계획을 수렵하기 위한 사례분석을 통해 검토하였다. 사례분석을 위한 연구대상지로 서울대학교 남부연습림 백운산지역(약 11,000ha)을 선택하여 위에서 제시된 산림생산(山林生産) 제약인자(制約因子)들을 동시에 만족시킬 수 있는 최적벌채계획(最適伐採計劃)을 수립하고, 목재생산 제약인자들의 강도에 대한 영향력을 분석하였다.

• 대한전자공학회논문지SD
• /
• 제46권7호
• /
• pp.22-28
• /
• 2009

멀티프로세서가 임베디드 시스템에서 널리 쓰임에 따라 지원되는 전력 최소화 기법을 이용하여 태스크를 수행하기 위해 필요한 에너지의 소모량을 줄여야 할 필요성이 대두된다. 본 논문은 동적 전압 스케일링 및 전력 셧다운을 이용하여 에너지 소모를 최소화 하는 태스크 스케줄링 알고리즘을 멀티프로세서 환경을 위해 제안하였다. 제안된 알고리즘에서는 전력 셧다운시의 에너지 및 타이밍 오버헤드를 고려하여 반복적으로 태스크 할당 및 태스크 순서화를 수행한다. 제안된 반복적인 태스크 스케줄링을 통해 전체 에너지 소모를 줄이는 가장 좋은 해를 얻을 수 있었다. 전체 에너지 소모는 리니어 프로그래밍 모델 및 전력 셧다운의 임계 시간을 고려하여 계산되었다. 실제 어플리케이션으로부터 추출된 표준 태스크 그래프에 기반을 둔 실험 결과를 통해 하드웨어 자원 및 시간제한에 따른 에너지 소모 관계를 분석하였다. 실험 결과를 볼 때 제안된 알고리즘은 기존의 우선권 기반의 태스크 스케줄링에 대해서 의미 있는 성능 향상을 얻을 수 있었다.

• International Journal of Control, Automation, and Systems
• /
• 제6권6호
• /
• pp.915-927
• /
• 2008

Networked control systems(NCSs) have gained increasing attention in recent years due to their advantages and potential applications. The network Quality-of-Service(QoS) in NCSs always fluctuates due to changes of the traffic load and available network resources. To handle the network QoS variations problem, this paper presents an intelligent scheduling control method for NCSs, where the sampling period and the control parameters are simultaneously scheduled to compensate the effect of QoS variation on NCSs performance. For NCSs with network-induced delays and packet dropouts, a discrete-time switch model is proposed. By defining a sampling-period-dependent Lyapunov function and a common quadratic Lyapunov function, the stability conditions are derived for NCSs in terms of linear matrix inequalities(LMIs). Based on the obtained stability conditions, the corresponding controller design problem is solved and the performance optimization problem is also investigated. Simulation results are given to demonstrate the effectiveness of the proposed approaches.

• 융합경영연구
• /
• 제4권1호
• /
• pp.1-8
• /
• 2016

The purpose of this paper is to discuss the methodology of optimizing delivery route scheduling using a capacity integer linear programming problem model developed to a previous case study. The methodology suggests a two-stage decision: the first, automatic, where the manager will obtain guidance generated by the solution of the linear programming model, later they could use post-optimization techniques to fine tune to the best operational solution. This study has the goal to reduce the size of service companies' ground transportation fleets, aiming not only to reduce costs and increase competitive advantages but also to lower levels of air pollution and its consequences, traffic and, therefore, the levels of carbon dioxide, allowing for a reduction in envir onmental disasters.

• 대한산업공학회지
• /
• 제35권1호
• /
• pp.1-14
• /
• 2009

The efficiency of transportation requests fulfillment can be increased through extending the problem of vehicle routing and scheduling by the possibility of subcontracting a part of the requests to external carriers. This problem extension transforms the usual vehicle routing and scheduling problems to the more general integrated operational transportation problems. In this contribution, we analyze the motivation, the chances, the realization, and the challenges of the integrated operational planning and report on experiments for extending the plain Vehicle Routing Problem to a corresponding problem combining vehicle routing and request forwarding by means of different sub-contraction types. The extended problem is formalized as a mixed integer linear programming model and solved by a commercial mathematical programming solver. The computational results show tremendous costs savings even for small problem instances by allowing subcontracting. Additionally, the performed experiments for the operational transportation planning are used for an analysis of the decision on the optimal fleet size for own vehicles and regularly hired vehicles.

• 대한전기학회논문지
• /
• 제35권12호
• /
• pp.594-602
• /
• 1986

This paper proposes an effective algorithm for short-term generation scheduling for the purpose of economic and secure operation of thermal power systems. Especially, in the procedure of solution by Dynamic Programming, Linear Programming is introduced to promote the possibility of optimal solution and the security of power systems, and evaluation of security function is improved by the application of seven step approximation of normal distribution. Several necessary considerations, that is, time dependent start-up and constant down cost of generating units, demand and spinning reserve constraints, minimum up and sown time constraints, the number of possible start-up of a generating unit in a d and the number of generating units which can be started up at the same time at the same bus, are also incoporated to elevate the usability and flexibility of the algorithm. Finally, the effectiveness of the proposed algorithm has been demonstrated by applying to the 6-gen. 21-bus model power system.

• 제어로봇시스템학회논문지
• /
• 제7권7호
• /
• pp.582-588
• /
• 2001

The Multiple Model/Controller IMC(MMC-IMC) is a model-based control method which uses a set of model/controller pairs rather than a single model/controller to handle all possible operating conditions in the IMC control structure. During operation, one model/controller pair that best fit, for current plant situation is chosen by the switching algorithm. The major drawback of the switching controller is the bad transient performance due to the model error and the use fo linear controller for nonlinear plants. In this paper, we propose a method that transient response of the MMC-IMC using two recurrent neural networks. Simulation result shows that the proposed method represents better performance than the usual MMC-IMC`s.