• Journal of applied mathematics & informatics
• /
• 제26권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.

• 한국통신학회논문지
• /
• 제40권4호
• /
• pp.646-652
• /
• 2015

본 논문은 다중 사용자 MIMO 시스템에서 사용자 선택을 위해 필요한 precoding matrix index (PMI)/channel quality indication (CQI)의 보고 방식에 따른 성능을 분석한다. 이러한 분석을 통해 셀 내의 단말의 수, 선택되는 사용자의 수, 그리고 코드북(codebook)의 크기가 Best Companion Grouping (BCG)방식 스케쥴링의 성능에 복잡하게 영향을 미치는 것을 확인한다. 이에 따라 셀 내의 사용자 수와 코드북의 크기에 따라 동시에 스케쥴링 되는 사용자들의 그룹이 형성될 수 있는 확률이 달라지는 것을 확인할 수 있으며, 피드백 오버헤드가 주어졌을 때 이에 따라 피드백하는 PMI의 수와 사용하는 코드북의 크기를 적응적으로 선택함으로써 시스템의 평균 수율 성능을 최적화할 수 있음을 보였다.

• 한국인터넷방송통신학회논문지
• /
• 제19권1호
• /
• pp.103-109
• /
• 2019

자동차 전장 시스템에는 여러 개의 전자 제어 장치에 시간 제약성을 갖는 다수의 응용프로그램들이 탑재되어 안전하게 수행될 수 있는 방법이 제공 되어야 한다. 본 논문은 자동차 전장용 실시간 운영체제 규격인 AUTOSAR에서 실시간성 태스크의 스케줄링시에 각 태스크의 마감시간을 준수할 수 있는 효율적인 스케줄링 기법은 제시하고, 타이밍 보호 메커니즘을 적용하는 방안을 제안한다. 고정 우선 순위나 동적 우선순위 태스크의 유연한 마감 시간 보장하기 위한 동적 비선점 알고리즘과, 오류 발생에 대한 실행 시간 모니터링 가능 위치를 제시하고, AUTOSAR 타임 보호 매커니즘 구현 방안을 제시하였다.

• Water Engineering Research
• /
• 제1권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.

• 한국시뮬레이션학회논문지
• /
• 제18권2호
• /
• pp.29-38
• /
• 2009

이기종의 자원들로 이루어진 컴퓨팅 환경에서 효율적인 자원 활용과 대용량의 데이터를 고속으로 처리하기 위해서는 실시간으로 변화하는 자원의 상태에 따라 대처 할 수 있는 동적인 작업 스케줄링 모델이 필요하다. 현재 이기종의 자원들에게 작업을 어떻게 분배 및 할당 할 것인지에 대하여 많은 자원 평가 방법 및 휴리스틱 기법들이 연구되었으나 이러한 방법들은 표준언어를 사용하지 않기 때문에 시스템 호환 및 확장에 어려움이 많다. 또한 다양한 자원들의 상태가 실시간으로 동적으로 변화하기 때문에 기존 연구에서 제안한 방법으로는 효율적인 처리가 불가능하거나 자원의 상태 변화에 동적으로 대처할 수 없다. 본 논문은 이러한 기존 연구들의 문제에 대한 해결책으로 W3C에서 제정한 온톨로지 표준 언어인 OWL을 이용하여 자원 온톨로지를 구축함으로써 이기종의 자원 관리를 손쉽게 할 수 있으며, 자원의 동적인 변화에 따라 작업 스케줄링하는 방법을 지식기반의 다양한 규칙들로 정의하여 추론을 통해서 최적의 자원에게 작업을 할당하는 시멘틱 컴퓨팅 기반의 동적 작업 스케줄링 모델을 제안한다. 시뮬레이션 실험 결과는 본 논문에서 제안한 작업 스케줄링 모델이 기존 모델에 비하여 낮은 작업 손실과 높은 작업 처리율 및 짧은 응답시간을 제공함으로써 이기종의 자원들로 구성된 시스템 전반에 걸쳐 안정적이고 고속의 데이터 처리를 제공할 수 있다는 사실을 증명한다.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• 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.

• 대한산업공학회지
• /
• 제21권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.

• 대한산업공학회지
• /
• 제21권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1993년도 하계학술대회 논문집 A
• /
• 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.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집D
• /
• 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.