• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2013.05a
• /
• pp.105-106
• /
• 2013

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.2
• /
• pp.119-127
• /
• 1990

This paper deals with the production scheduling problems of a dedicated Flexible Manufacturing System. In this work, a new mathematical formulation is proposed and two heuristic algorithms which can generate real-time schedules are suggested. Example problems to demonstrate the good performance and the validity of these two proposed algorithms are also included.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.112-117
• /
• 1992

The Real-time Distributed Control Systems(RDCS) consist of several distributed control processes which share a network medium to exchange their data. Performance of feedback control loops in the RDCS is subject to the network-induced delays from sensor to controller and from controller to actuator. The network-induced delays are directly dependent upon the data sampling times of the control components which share a network medium. In this study, a scheduling algorithm of determining data sampling times is developed using the window concept, where the sampling data from the control components dynamically share a limited number of windows.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.747-749
• /
• 2000

A new scheduling algorithm called the Adaptive Weighted Round Robin with Delay Tolerance (AWRR/DT) is presented. The proposed scheme can reduce the average delay of non-real-time (NRT) class while maintaining the QoS of real-time (RT) classes. Our scheme can also reflect the traffic fluctuation of networks with a small processing burden.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.2
• /
• pp.45-54
• /
• 2008

In this paper, a dynamic GTS scheduling method based on IEEE 802.15.4 is proposed for wireless control system. The proposed method can guarantee a transmission of real-time periodic and sporadic data within the time frame in factory environment. The modified superframe of IEEE 802.15.4 was used to the dynamic scheduling method of real-time mixed traffic(periodic data, sporadic data, and non real-time message). By separating CFP and CAP properly, the sporadic and non real-time messages are transmitted effectively and guarantee real-time transmission within a deadline. The simulation results show the improvement of real-time performance of periodic and sporadic data.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.9-18
• /
• 2002

In this paper, we propose scalable scheduling techniques based on EDF to efficiently integrate hard real-time and multimedia soft real-time tasks in the distributed real-time multimedia database system. Hard tasks are guarangteed based on worst case execution times, whereas multimedia soft tasks are served based on mean execution times. This paper describes a served-based scheme for partitioning the CPU bandwidth among different task classes that coexist in the same system. To handle the problem of class overloads characterized by varying number of tasks and varying task arrival rates, thus scheme shows how to adjust the fraction of the CPU bandwidth assigned to each class. This scheme fixes the maximum time that each hard task can execute in the period of the server, whereas it can dynamically change the bandwidth reserved to each multimedia task. The proposed method is capable of minimizing the mean tardiness of multimedia tasks, without jeopardizing the schedulability of the hard tasks. The performance of this scheduling method is compared with that of similar mechanisms through simulation experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.5
• /
• pp.967-973
• /
• 2009

Recently, as 3rd-generation mobile communication services using high-speed data rate system are widely employed, the demand for a variety of real-time data services such as VoIP service are also increased. Unlike typical data packets, VoIP packets have delay bound and low loss rate requirement. In this paper we propose a new scheduling algorithm that schedule two deferent kinds of packets efficiently, considering the characteristics of VoIP. Basically this algorithm considers both time delay and channel condition and gives priority depending on the time delay. Simulation results show that the proposed algorithm works more efficiently than conventional algorithms.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.278-288
• /
• 2016

Automation ensures accurate and well-organized container transportation in container terminals. This paper addresses operational issues such as equipment scheduling and the coordination between various pieces of equipment in a rail-based automated container terminal. Containers are relayed using multiple types of equipment from road trucks to a vessel and vice versa. Therefore, handshaking is required during a container transfer between different pieces of equipment. Synchronization between the schedules of all the equipment is important to reduce equipment waiting times and the time required for transporting containers, which results in a short turnaround time for a vessel. This paper proposes an integrated control system with the objective of synchronizing the operations of different types of equipment, provides a list of decisions to be made by the control module of each type of equipment, and shows all the required information transfers between control modules. A scheme for the integrated scheduling of multiple types of equipment is proposed. The decisions made by each control module in a real-time fashion are listed with detailed explanations, and the information transfer between managers in a real-time situation at the proposed terminal is described.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.10
• /
• pp.2760-2765
• /
• 2009

Pfair scheduling algorithm, which is an optimal scheduling algorithm in the hard real-time multiprocessor environments, is based on the fixed quantum size. Recently, several methods that determine the maximum quantum size dynamically were proposed in the mode change environments. But these methods considered the case in which the period of a task can only be decreased. In this paper, we consider the case in which the period of a task can be decreased or increased, and propose an improved method that determine the maximum quantum size dynamically in the mode change environments. A simulation shows that the proposed method is effective.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.39-49
• /
• 2007

Since the PF scheduling algorithm[13], which is optimal in the hard real-time multiprocessor environments, several scheduling algorithms have been proposed. All these algorithms assume the fixed unit quantum size, and this assumption has problems in the mode change environments. To settle the problem, we already proposed a method for deciding the optimal quantum size[2]. In this paper, we propose improved methods considering the task set whose utilization e is less than or equal to p/3+1. As far as the numbers of computations used to determine the optimal quantum size are concerned, newly proposed methods are proved to be more efficient than our previous ones.