• 산업공학
• /
• 제14권4호
• /
• pp.341-347
• /
• 2001

This paper describes a real-time manufacturing scheduling system on Internet using DBR(Drum-Buffer-Rope) scheduling method. We intend to change company-oriented manufacturing scheduling, which has been used at most manufacturing companies, to customer-oriented manufacturing scheduling. Customers can not only choose product kinds, quantities and order due dates, but also evaluate optimum order due date by themselves in real-time through internet and then the results will be converted into practical manufacturing scheduling. If the company cannot meet the customer order due date, it will offer reliable and accurate information to the customers by suggesting the earliest order due date. To evaluate the customer order due date in real time, companies should be able to estimate their accurate production capacity. This research uses Goldratt's DBR scheduling method to realize that function. The DBR scheduling does not recognize the production capacity of the whole company, but only of the constraint resources which have a great effect on the company throughput. Thus, it can improve the customer service level as well as the profit by performing more dynamic and reliable scheduling through Internet.

• 산업경영시스템학회지
• /
• 제30권1호
• /
• pp.59-65
• /
• 2007

HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

• International Journal of Control, Automation, and Systems
• /
• 제5권3호
• /
• pp.317-323
• /
• 2007

Quality of Service (QoS) in the Internet depends on queuing and sophisticated scheduling in routers. In this paper, we address the issue of managing traffic flows with different priorities. In our reference model, incoming packets are first classified based on their priority, placed into different queues with different capacities, and then multiplexed onto one router link. The fuzzy nature of the information on Internet traffic makes this problem particularly suited to fuzzy methodologies. We propose a new solution that employs a fuzzy inference system to dynamically and efficiently schedule these priority queues. The fuzzy rules are derived to minimize the selected Lyapunov function. Simulation experiments show that the proposed fuzzy scheduling algorithm outperforms the popular Weighted Round Robin (WRR) queue scheduling mechanism.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권10호
• /
• pp.4988-5012
• /
• 2019

As a subset of the Internet of Things, the Internet of Energy (IoE) is expected to tackle the problems faced by the current smart grid framework. Notably, the conventional day-ahead power scheduling of the smart grid should be redesigned in the IoE architecture to take into consideration the intermittence of scattered renewable generations, large amounts of power consumption data, and the uncertainty of the arrival time of electric vehicles (EVs). Accordingly, a day-ahead power scheduling system for the future IoE is proposed in this research to maximize the usage of distributed renewables and reduce carbon emission caused by the traditional power generation. Meanwhile, flexible charging mechanism of EVs is employed to provide preferred charging options for moving EVs and flatten the load profile simultaneously. The simulation results revealed that the proposed power scheduling mechanism not only achieves emission reduction and balances power load and supply effectively, but also fits each individual EV user's preference.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1265-1278
• /
• 2017

Dynamic task scheduling is one of the most popular research topics in the cloud computing field. The cloud scheduler dynamically provides VM resources to variable cloud tasks with different scheduling strategies in cloud computing. In this study, we utilized a valid model to describe the dynamic changes of both computing facilities (such as hardware updating) and request task queuing. We built a novel approach called Policy Iteration Scheduling (PIS) to globally optimize the independent task scheduling scheme and minimize the total execution time of priority tasks. We performed experiments with randomly generated cloud task sets and varied the performance of VM resources using Poisson distributions. The results show that PIS outperforms other popular schedulers in a typical cloud computing environment.

• 대한전자공학회논문지TC
• /
• 제40권12호
• /
• pp.46-58
• /
• 2003

최근의 인터넷은 기존의 최선형 서비스구조(best-effort)에서 벗어나 별도의 차별화 된 트래픽 처리와 서비스품질(QoS)을 요구하는 응용들을 지원할 수 있는 네트워크 구조 및 트래픽 엔지니어링 기술을 요구하고있다. 더욱이 유선에서 무선으로 인터넷이 확장되면서 위치-종속적이며 버스트하게 발생되는 에러로 인해 기존의 패킷 스케줄링 방법으로는 정의된 서비스 품질을 제공할 수 없다. 따라서 본 논문에서 무선 인터넷 차별화 서비스 네트워크 환경에서도 정의된 서비스 품질을 제공할 수 있는 WDSPS(Wireless DiffServ Packet Scheduling) 스케줄링 알고리즘을 제안한다. 제안된 스케줄링 알고리즘은 무선망 에러로 생기는 클래스 큐의 블록킹 문제를 해결하고, 차별화 서비스 망에서 요구하는 각 클래스간 패킷 처리율, 패킷 지연, 패킷 손실률 등의 관점에서 차별화 서비스를 제공하며, 클래스 및 플로우간 효율적인 보상 방법으로 서비스 보상이 점진적으로 이루어져 하나의 클래스 및 플로우가 독점적으로 무선자원을 사용하지 못하도록 하였다. 모의 실험에서는 제안된 WDSPS 스케줄링 방법을 사용하여 다양한 무선 환경에서 서비스 클래스간 차별화 된 서비스를 제공하며 전체 서비스 처리율을 향상시킬 수 있음을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.5805-5825
• /
• 2019

Smartphones are important platforms because of their sophisticated computation, communication, and sensing capabilities, which enable a variety of applications in the Internet of Things (IoT) systems. Moreover, advancements in hardware have enabled sensors on smartphones such as environmental and chemical sensors that make sensor data collection readily accessible for a wide range of applications. However, dynamic, opportunistic, and heterogeneous mobility patterns of smartphone users that vary throughout the day, which greatly affects the efficacy of sensor data collection. Therefore, it is necessary to consider phone users mobility patterns to design data collection schedules that can reduce the loss of sensor data. In this paper, we propose a mobility-based weighted adaptive opportunistic scheduling framework that can adaptively adjust to the dynamic, opportunistic, and heterogeneous mobility patterns of smartphone users and provide prioritized scheduling based on various application scenarios, such as velocity, region of interest, and sensor type. The performance of the proposed framework is compared with other scheduling frameworks in various heterogeneous smartphone user mobility scenarios. Simulation results show that the proposed scheduling improves the transmission rate by 8 percent and can also improve the collection of higher-priority sensor data compared with other scheduling approaches.

• 한국시뮬레이션학회논문지
• /
• 제15권2호
• /
• pp.41-50
• /
• 2006

휴대인터넷 서비스가 조만간 제공될 예정이다 하지만 아직까지 다양한 서비스 유형의 패킷에 대한 스케줄링 방법은 명확하게 결정되지 못하고 있다. 한정된 자원인 무선 채널의 효율을 높이려면 서로 다른 QoS를 요구하는 다양한 서비스 유형에 대한 패킷 스케줄링이 필요하다. 본 연구에서는 보다 많은 호를 수용하고 채널 효율을 향상시키기 위하여 개선된 상향링크 스케줄링 방법을 제안한다. 제안하는 방법은 채널의 전송률과 효용을 높이기 위하여 단말의 셀내 위치에 따른 채널 상태를 반영한다. 시뮬레이션 결과에 따르면 제안하는 방법이 상향링크의 수율과 용량 측면에서 좋은 성능을 보임을 알 수 있다.

• 한국경영과학회지
• /
• 제31권3호
• /
• pp.145-154
• /
• 2006

WiBro (Wireless Broadband Internet) system is going to be 9ot down to commercialization. The high portable internet system is able to be connected to the high-speed internet using 2.3 GHz frequency bandwidth, anytime and anywhere. An effective scheduling for UGS, rtPS, nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that are the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities with each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.347-353
• /
• 2005

WiBro (Wireless Broadband Internet) system is going to be commercialized before long. The high portable internet system is abie to be connected to the high-speed internet using 2.3 CHz frequency bandwidth, anytime and anywhere. An effective scheduling for UCS, rtPS. nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that arc the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities With each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.