• Title/Summary/Keyword: Scheduling System

Search Result 2,161, Processing Time 0.03 seconds

Novel Beamforming and User Scheduling Algorithm for Inter-cell Interference Cancellation

  • Kim, Kyunghoon;Piao, Jinhua;Choi, Seungwon
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.5
    • /
    • pp.346-348
    • /
    • 2016
  • Coordinated multi-point transmission is a candidate technique for next-generation cellular communications systems. We consider a system with multiple cells in which base stations coordinate with each other by sharing user channel state information, which mitigates inter-cell interference (ICI), especially for users located at the cell edge. We introduce a new user scheduling method that considers both ICI and intra-cell orthogonality. Due to the influence of ICI cancellation and the loss reduction of effective channel gain during the beamforming process, the proposed method improves the system sum rate, when compared to the conventional method, by an average of 0.55bps/Hz for different numbers of total users per cell.

PERFORMANCE ANALYSIS OF TWO FINITE BUFFERS QUEUEING SYSTEM WITH PRIORITY SCHEDULING DEPENDENT UPON QUEUE LENGTH

  • Choi Doo-Il
    • Journal of applied mathematics & informatics
    • /
    • v.22 no.1_2
    • /
    • pp.523-533
    • /
    • 2006
  • We analyze two finite buffers queueing system with priority scheduling dependent upon queue length. Customers are classified into two types ( type-l and type-2 ) according to their characteristics. Here, the customers can be considered as traffics such as voice and data in telecommunication networks. In order to support customers with characteristics of burstiness and time-correlation between interarrival, the arrival of the type-2 customer is assumed to be an Markov- modulated Poisson process(MMPP). The service order of customers in each buffer is determined by the queue length of two buffers. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, performance measures such as loss and mean delay are derived.

Stability Improvement of Distributed Power Generation Systems with an LCL-Filter Using Gain Scheduling Based on Grid Impedance Estimations

  • Choi, Dae-Keun;Lee, Kyo-Beum
    • Journal of Power Electronics
    • /
    • v.11 no.4
    • /
    • pp.599-605
    • /
    • 2011
  • This paper proposes a gain scheduling method that improves the stability of grid-connected systems employing an LCL-filter. The method adjusts the current controller gain through an estimation of the grid impedance in order to reduce the resonance that occurs when using an LCL-filter to reduce switching harmonics. An LCL-filter typically has a frequency spectrum with a resonance peak. A change of the grid-impedance results in a change to the resonant frequency. Therefore an LCL-filter needs a damping method that is applicable when changing the grid impedance for stable system control. The proposed method instantaneously estimates the grid impedance and observes the resonant frequency at the same time. Consequently, the proposed method adjusts the current controller gain using a gain scheduling method in order to guarantee current controller stability when a change in the resonant frequency occurs. The effectiveness of the proposed method has been verified by simulations and experimental results.

Novel Beamforming and Scheduling Method for Interference Mitigation at Cell Edge (셀 경계 지역 간섭 완화를 위한 효율적 빔포밍 및 스케쥴링 방법)

  • Kim, Kyung Hoon;Choi, Seung Won
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.4
    • /
    • pp.129-133
    • /
    • 2012
  • Coordinated multi-point transmission (CoMP) is a candidate technique for next generation cellular communications systems. One of the primary elements discussed in LTE-Advanced technology is CoMP, which can improve cell edge user data rate as well as spectral efficiency due to multiple input multiple output - orthogonal frequency division multiplex (MIMO-OFDM). We consider a system with multiple cells in which base stations coordinate with each other by sharing user channel state information (CSI), which mitigates inter cell interference (ICI), especially for users located at the cell edge. We introduce a new user scheduling method of ICI cancellation and the loss reduction of effective channel gain during the beamforming process, the proposed method improves the system sum rate, when compared to the conventional method by an average of 0.55bps/Hz in different number of total users per cell. It also outperforms the conventional method by approximately 0.38bps/Hz using different SNRs.

A Heuristic Algorithm for FMS Scheduling Using the Petri Net (페트리네트를 이용한 FMS스케줄링에 대한 발견적 해법)

  • 안재홍;노인규
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.21 no.2
    • /
    • pp.111-124
    • /
    • 1996
  • The main purpose of this study is to develop an algorithm to solve the scheduling problems of FMS using Petri-net is well suited to model the dynamics of FMS and Petri-net is an ideal tool to formulate scheduling problems with routing flexibility and shared resources. By using the marking of Petri-net, We can model features of discrete even system, such as concurrency, asynchronous, conflict and non-determinism. The proposed algorithm in this paper can handle back-tracking using the marking of Petri-net. The results of the experiment show that marking is one of the best ways that describe exactly movement of the discrete event system. To show the effectiveness of the algorithm suggested here, we compare it with L1 algorithm using the Petri-net through the test on randomly generated test problems.

  • PDF

RBF Network Based QFT Parameter-Scheduling Control Design for Linear Time-Varying Systems and Its Application to a Missile Control System (시변시스템을 위한 RBF 신경망 기반의 QFT 파라미터계획 제어기법과 alt일 제어시스템에의 적용)

  • 임기홍;최재원
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.199-199
    • /
    • 2000
  • Most of linear time-varying(LTV) systems except special cases have no general solution for the dynamic equations. Thus, it is difficult to design time-varying controllers in analytic ways, and other control design approaches such as robust control have been applied to control design for uncertain LTI systems which are the approximation of LTV systems have been generally used instead. A robust control method such as quantitative feedback theory(QFT) has an advantage of guaranteeing the stability and the performance specification against plant parameter uncertainties in frozen time sense. However, if these methods are applied to the approximated linear time-invariant(LTI) plants which have large uncertainty, the designed control will be constructed in complicated forms and usually not suitable for fast dynamic performance. In this paper, as a method to enhance the fast dynamic performance, the approximated uncertainty of time-varying parameters are reduced by the proposed QFT parameter-scheduling control design based on radial basis function (RBF) networks for LTV systems with bounded time-varying parameters.

  • PDF

Short-term Operation Scheduling Using Possibility Fuzzy Theory on Cogeneration System Connected with Auxiliary Devices (열병합발전시스템에서 가능성 퍼지이론을 적용한 단기운전계획수립)

  • Kim, Sung-Il;Jung, Chang-Ho;Lee, Jong-Beom
    • Journal of Energy Engineering
    • /
    • v.6 no.1
    • /
    • pp.19-25
    • /
    • 1997
  • This paper presents the short-term operation scheduling on cogeneration system connected with auxiliary equipment by using the possibility fuzzy theory. The possibility fuzzy theory is a method to obtain the possibility boundary of the solution from the fuzzification of coefficients. Simulation is carried out to obtain the boundary of heat production in each time interval. Simulation results show the flexible operation boundary to establish effectively operation scheduling.

  • PDF

An Application of the Markov Process to the Management of Hospital Admissions

  • Choo, Hwi-Suck
    • Journal of the Korean Statistical Society
    • /
    • v.4 no.1
    • /
    • pp.79-87
    • /
    • 1975
  • However, the mechanism for producing revised estimate is the principal means of varying the resulting precisions of estimate. Therefore, a scheduling system including physician's revision should be checked by a computer simulation to evaluate possible gains to admissions scheduling accruing from the use of these estimates. The ability to accurately predict bed occupancy has long been an objective of hospital management. If the one were able to anticipate bed accupancy, then the one could more accurately plan for bed needs, schedule personnel, allocate service and supply. We may conclude that even though the Markov chain analysis would not lead to ready-made answers for the scheduling system of elective patients, it can provide the more detailed and systematic knowledgy for the solutions on the weekly base as well as the foundations for long run planning in relative sense.

  • PDF

An Improvement of Algorithms for Assembly-type Flowshop Scheduling Problem with Outsourcing (부품외주를 고려한 조립형 Flowshop 일정계획 해법 개선)

  • Yoon, Sang-Hum;Juhn, Jae-Ho
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.31 no.2
    • /
    • pp.80-93
    • /
    • 2008
  • This paper improves algorithms for an assembly-type flowshop scheduling problem in which each job is to assemble two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced with job-dependent lead time but the other type is fabricated in-house. When both components for a job are prepared, the assembly operation for the job can be started. This problem had been proved to be NP-Complete, so branch-and-bound (B&B) and heuristic algorithms have already been developed. In this paper, we suggest other dominance rules, lowerbound and heutistic algorithms. Also, we develop a new B&B algorithm using these improved bound and dominance rules. The suggested heuristics and B&B algorithm are compared with existing algorithms on randomly-generated test problems.

On Lot-Streaming Flow Shops with Stretch Criterion (로트 스트리밍 흐름공정 일정계획의 스트레치 최소화)

  • Yoon, Suk-Hun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.4
    • /
    • pp.187-192
    • /
    • 2014
  • Lot-streaming is the process of splitting a job (lot) into sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for an n-job, m-machine, lot-streaming flow shop scheduling problem with equal-size sublots in which the objective is to minimize the total stretch. The stretch of a job is the ratio of the amount of time the job spent before its completion to its processing time. NGA replaces the selection and mating operators of genetic algorithms (GAs) by marriage and pregnancy operators and incorporates the idea of inter-chromosomal dominance and individuals' similarities. Extensive computational experiments for medium to large-scale lot-streaming flow-shop scheduling problems have been conducted to compare the performance of NGA with that of GA.