• Title/Summary/Keyword: generation scheduling

Search Result 263, Processing Time 0.019 seconds

An Adjustable Round Robin Scheduling Algorithm for the High Data Rate Mobile Communication System (고속 이동 통신을 위한 적응 가능한 라운드 로빈 스케줄링 방식)

  • Bae, Jeong-Min;Song, Young-Keum;Kim, Dong-Woo
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.1
    • /
    • pp.27-32
    • /
    • 2007
  • Next-generation wireless networks are expected to support a wide range of services, including high-rate data applications, Various service types request differentiated QoSs(Qualities of Service) such as minimum data rate, accuracy, fairness and so on. Although resources of radio systems are limited, for many applications, it is important that certain QoS targets are required to be met. In this paper, we propose a QoS based scheduling algorithm for next generation systems, based on analyzing previous researches, and we develop the proposed QoS algorithm only for MIMO(multi-Input Multi-Output) systems. Moreover, we subsequently prove that the proposed algorithm optimize throughput relative to prespecified target values and converge to certain throughput.

Outage Performance of Uplink NOMA Systems with CDF Scheduling (CDF 스케쥴링을 적용한 상향링크 NOMA 시스템의 오수신 성능)

  • Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.4
    • /
    • pp.37-42
    • /
    • 2021
  • NOMA (Non-orthogonal multiple Access) system has been focused on the next generation cellular system for higher spectral efficiency. However, this requires user scheduling as the NOMA system is a multi-user system which accesses simultaneously. There are two representative scheduling schemes, proportionate scheduling (FP) and cumulative distribution function (CFD) scheduling. The PF scheduling is applied, the cell edge user is hard to obtain a transmit opportunity. Recently, CDF scheduling is obviously noted that it offers the same possibility of transmission for a user regardless of the location in a cell. We consider an uplink NOMA system with CDF scheduling, and obtain the channel access probabilities, the outage probabilities of the system with different number of users and different kinds of weights through simulation. The results indicate that the likelihood of each user accessing the channel is the same and the probability of failure decreases as the number of users increases. We found that the effect of the probability of failure is negligible as the weight of the cell edge user increases.

Optimal Maintenance Scheduling with the Probabilistic Costing Model (확률적 운전모델에서의 최적전원보수계획)

  • Choi, Ik-Keoun;Shim, Keon-Bo;Lee, Bong-Yong
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.855-858
    • /
    • 1988
  • Two methods for probabilistic maintenance scheduling are developed and compared ; one with operation and supplied-shortage cost and other with risk level of LOLP. Based on the real economic power dispatch, quadratic optimal maintenance conditions are obtained and simple amtrix equations are suggested for solutions. Both methods are compared in a sample system of 26,000 [MW] peak and 32,000 [MW] generation capacity.

  • PDF

Short-Term Generation Scheduling Considering Transmission Line Capacity Limits (선로용량한계를 고려한 단기 발전계획)

  • 김준현;송현선;유인근
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.35 no.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.

  • PDF

A development methodology for heterarchical control of flexible manufacturing systems

  • 한영근
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.776-782
    • /
    • 1995
  • This paper presents a methodology for development of a heterarchical control system in Flexible Manufacturing Systems (FMS) environment. A Petri net based model is applied for development of control software. A real-time scheduling methodology for the heterarchical system is also developed and it is used as a software entity in the overall architecture. The partition of generic and specific modules in control software development is emphasized. The control system performs its control tasks in two stages: (1) generation of generic control code and distribution of them to each controller entity prior to system execution; (2) generation of specific control code according to job arrival and its process plan. The control software and the scheduling algorithm are evaluated by a simulation program.

  • PDF

Optimal Scheduling in Power-Generation Systems with Thermal and Pumped-Storage Hydroelectric Units

  • Kim, Sehun;Rhee, Minho
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.15 no.1
    • /
    • pp.99-115
    • /
    • 1990
  • This paper is concerned with the unit commitment problem in an electric power system with both thermal and pumped-storage hydroelectric units. This is a mixed integer programming problem and the Lagrangean relaxation method is used. We show that the relaxed problem decomposes into two kinds of subproblems : a shortest-path problem for each thermal unit and a minimum cost flow problem for each pumped-storage hydroelectric unit. A method of obtaining an incumbenet solution from the solution of a relaxed problem is presented. The Lagrangean multipliers are updated using both subgradient and incremental cost. The algorithm is applied to a real Korean power generation system and its computational results are reported and compaired with other works.

  • PDF

Smoothly Connected Path Generation and Time-Scheduling Method for Industrial Robot Applications (산업용로봇 작업을 위한 유연한 연결경로 생성과 시간계획)

  • Lee Won-Il;Ryu Seok-Chang;Cheong Joo-No
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.7
    • /
    • pp.671-678
    • /
    • 2006
  • This article proposes a smooth path generation and time scheduling method for general tasks defined by non-smooth path segments in industrial robotic applications. This method utilizes a simple 3rd order polynomial function for smooth interpolation between non-smooth path segments, so that entire task can effectively maintain constant line speed of operation. A predictor-corrector type numerical mapping technique, which correlates time based speed profile to the smoothed path in Cartesian space, is also provided. Finally simulation results show the feasibility of the proposed algorithm.

A Tour Bus Scheduling Method by Greedy Heuristic and Column Generation Techniques (Greedy Heuristic기법과 열 제조에 의한 관광버스 배차방법)

  • Park Sun-Dal;Jang Byeong-Man
    • Journal of the military operations research society of Korea
    • /
    • v.13 no.1
    • /
    • pp.101-115
    • /
    • 1987
  • This paper presents an optimization based heuristic algorithm for a tour bus scheduling problem where buses consist of various kinds of sightseeing and commutation services. First, this algorithm transforms the prolem into a vehicle routing problem on whose nodes denote trips and arcs denote connections between trips. Second, a greedy heuritic routing technique is applied to find a good feasible bus-route set. Then the greedy feasible solution is improved by the simplex method using column generation technique. The algorithm provides a better near-optimal solution which gives much reductions in the total tour distance and the number of tour buses.

  • PDF

Development of Daily Generation Scheduling Program (일간 발전계획 프로그램 개발)

  • Kim, Sung-Soo;Nam, Young-Woo;Kim, Jin-Ho;Park, Jong-Keun;Kim, Sung-Goo;Lee, Hyo-Sang
    • Proceedings of the KIEE Conference
    • /
    • 1998.07c
    • /
    • pp.858-860
    • /
    • 1998
  • Daily generation scheduling system (DGSC) is a main tool in the power system operation. In Korea, a DGSC was developed in 1982 and it was updated continuously. However, as new type of generators and the number of constraints are introduced. it is very difficult to use the old DGSC. This paper presents a proposal for the development of new DGSC. In the Proposed proposal, line flow constraint and dispatch of combined cycle plant are included.

  • PDF

Unit Commitment of a Microgrid Considering Islanded Operation Scenarios (독립운전 시나리오를 고려한 마이크로그리드의 최적 발전기 기동정지 계획)

  • Lee, Si Young
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.6
    • /
    • pp.708-714
    • /
    • 2018
  • Islanded operation of a microgrid can ensure the reliable operation of the system when a large accident occurs in the main grid. However, because the generation capability of a microgrid is typically limited, a microgrid operator should take islanded operation risk into account in scheduling its generation resources. To address this problem, in this paper we have proposed two unit commitment formulations based on the islanding scenario that reflect the expected and worst-case values of the islanded operation risk. An optimal resource scheduling strategy is obtained for the microgrid operator by solving these optimization problem, and the effectiveness of the proposed method is investigated by numerical simulations.