• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.889-900
• /
• 2008

The problem of scheduling n jobs on a single machine is considered when the machine is subject to stochastic breakdowns. The objective is to minimize the weighted squared deviation of job completion times from a common due date. Two versions of the problem are addressed. In the first one the common due date is a given constant, whereas in the second one the common due date is a decision variable. In each case, a general form of deterministic equivalent of the stochastic scheduling problem is obtained when the counting process N(t) related to the machine uptimes is a Poisson process. It is proved that an optimal schedule must be V-shaped in terms of weighted processing time when the agreeable weight condition is satisfied. Based on the V-shape property, two dynamic programming algorithms are proposed to solve both versions of the problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.646-652
• /
• 2015

In this paper, the system-level performance is evaluated for the feedback scheme on the pre-coding matrix index (PMI) and channel quality indication (CQI), which are required for user selection in the multi-user MIMO system. Our analysis demonstrates that the number of users, the number of selected users, and codebook size are the key factors that govern the performance of the best companion grouping (BCG)-based user scheduling. Accordingly, we have confirmed that the probability of forming the co-scheduled user group is determined by these factors, which implies that the number of PMI's and codebook size can be dynamically determined so as to maximize the average system throughput as the number of users varies in the cell.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.103-109
• /
• 2019

The automotive electronic system should provide a method that can be safely performed by loading a number of application programs having time constraints in several electronic control devices. In this paper, we propose a timing protection mechanism for AUTOSAR, which is a real - time operating system specification for automotive field, in order to observe the deadline of each task when scheduling real - time tasks. We propose a dynamic non-preemption algorithm to guarantee a flexible deadline for fixed priority or dynamic priority tasks, and a location where execution time can be monitored for errors, and suggest ways to implement the AUTOSAR time protection mechanism.

• Water Engineering Research
• /
• v.1 no.4
• /
• pp.279-291
• /
• 2000

A mathematical model using dynamic programming approach is applied to an optimal unit commitment problem. In this study, the units are treated as stages instead of as state dimension, and the time dimension corresponds to the state dimension instead of stages. A considerable amount of computer time is saved as compared to the normal approach if there are many units in the basin. A case study on the Lower Colorado River Basin System is presented to demonstrate the capabilities of the optimal scheduling of hydropower units.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.29-38
• /
• 2009

In the computing environment with heterogeneous resources, a job scheduling model is necessary for effective resource utilization and high-speed data processing. And, the job scheduling model has to cope with a dynamic change in the condition of resources. There have been lots of researches on resource estimation methods and heuristic algorithms about how to distribute and allocate jobs to heterogeneous resources. But, existing researches have a weakness for system compatibility and scalability because they do not support the standard language. Also, they are impossible to process jobs effectively and deal with a variety of computing situations in which the condition of resources is dynamically changed in real-time. In order to solve the problems of existing researches, this paper proposes a semantic computing-based dynamic job scheduling model that defines various knowledge-based rules for job scheduling methods adaptable to changes in resource condition and allocate a job to the best suited resource through inference. This paper also constructs a resource ontology to manage information about heterogeneous resources without difficulty as using the OWL, the standard ontology language established by W3C. Experimental results shows that the proposed scheduling model outperforms existing scheduling models, in terms of throughput, job loss, and turn around time.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.147-151
• /
• 2005

CAN(Controller Area Network) is a simple and efficient network system for real time control and measurement. As it is not only good at error detection but also strong in electromagnetic interference, CAN has been widely used all over the industries. Basically, CAN needs a master node in charge of sensor data collection, node scheduling for data transmission to a monitoring system and error detection. According to the number of mater nodes, the CAN system is classified into two type of master system. One is a single master system that has only one master node and the other is a multi-master system where any sensor node can become a master node depending on the system's conditions. While it has the advantage of its fault tolerance, the multi-master system will suffer form the overall performance degradation when a defect is found in the master node. It is because all sensor nodes pertaining to a defective master node lose their position. Moreover, it is difficult and expensive to implement. For a single master system, the whole system will be broken down when a problem happens to a single master. In this paper, a dynamic master system is presented that there are several sub-master nodes of which basic functions are those of other sensor nodes at ordinary times but dynamically changed to replace the failing master node. An effective scheduling algorithm is also proposed to choose an appropriate node among sub-master nodes, where each sub-master node has its precedence value. The performance of the dynamic master system is experimented and analyzed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.1
• /
• pp.85-101
• /
• 1995

Automated Guided Vehicles(AGVs) are widely used in computer integrated manufacturing(CIM) systems for material handling purposes. Although automated guided vehicles provide higher levels of flexibility and computer integrability, the installations are limited in number and one of the critical reasons lies in the complexity involved in the operation. The main objective of this research is to alleviate this problem by proposing efficient integrated operational control methods for AGV-based CIM systems. Particularly, this research is concerned with the mixed problem of dispatching automated guided vehicles and scheduling machines operation. The proposed dynamic heuristic algorithm uses various priority schemes and relevant information concerning the load of the system, the status of queues, and the position of AGVs in the scheduling process. The scheduling decision process is hierarchical in the sense that different decision criteria are applied sequentially to identify the most appropriate part to be served. This algorithm consists of two sections, the section of part selection by AGVs for the next service whenever an AGV completes the current assignment, and the section of part selection by machines for next service whenever a machine completes the current operation. The proposed algorithm has been compared with other scheduling schemes using the performance measure of mean flow-time and mean tardiness. Simulation results indicate that the proposed algorithm can reduce the mean flow-time and mean tardiness significantly.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.207-216
• /
• 1995

Constructing a distributed management system has its own advantages in addressing the issue of implementing a quick responsive management system in dynamically changing environment of enterprise. We suggest a basic scheduling methodology applicable to a distributed production management system. A new concept of "flexible schedule" is introduced as a tool to accommodate dynamically changing situations of job shops. Then a search technique (referred to as CSP-CBA search) is presented to obtain such a schedule for the job shop scheduling problem, which is converted into a constraint satisfaction problem(CSP), by using the constraint based analysis(CBA). This approach is tested on more than 100 test problems. The results show that the suggested approach required shorter CPU time and solved more problems in given time than another fixed schedule method.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.102-105
• /
• 1993

The objective of this study is to solve the operation scheduling problem of plural battery energy storage systems (BESS), and to find useful intonation from its result. Unlike conventional energy storage system, BESS has on hardware characteristics such as high efficiency, fast-acting response and operational loss. Considering rate constraints of thermal unit power as well as hardware characteristics of BESS, the operation scheduling has an intricated problem. In order to solve this optimization problem, we use successive approximations dynamic programming. In two types of operation, the proposed algorithm is applied to test system. one is daily optimal operation, the other weekly optimal operation.

• Proceedings of the KSME Conference
• /
• 2001.06d
• /
• pp.286-291
• /
• 2001

This paper describes an optimal scheduling for ice slurry systems for energy cost saving. The optimization technique applied in the study is the dynamic programming method, for which the state variable is the storage in the ice storage tank and the control variable is the state of chiller's on-off switching. Though the costs during charge period is included in optimization by taking the average cost of ice per hour for slurry making, the time horizon for the simulation is limited building cooling period because accurate charge rate from the ice maker into the ice storage tank cannot be estimated during the charge period. In the operating simulation after optimizing procedure, energy consumption and operating cost for the optimal control are calculated and compared with them for a conventional control with one case of cooling load profile.