• 제목/요약/키워드: Scheduling System

검색결과 2,161건 처리시간 0.037초

경성 내장형 실시간 시스템의 설계 및 구현 (Design and Implementation of Hard Embedded Real-Time System)

  • 인치호
    • 전기전자학회논문지
    • /
    • 제5권2호
    • /
    • pp.164-173
    • /
    • 2001
  • 본 논문은 독립적으로 움직이면서 시간 제약을 만족시키는 새로운 내장형 실시간 시스템을 설계하며 구현하였다. 본 논문에서의 실시간 시스템 커널은 시간적인 요소를 가장 핵심으로 고려하여 설계되었다. 따라서 실시간 커널은 작은 용량을 가지며 빠르게 예측하며, 실시간 스케줄링에 요구되는 많은 변화들을 통해서 실시간 커널에 융통성을 부여한다. 제안한 실시간 커널은 경성 실시간 제약 조건인 인터럽트 지연 시간, 스케줄링의 정확성, 메시지 전달시간을 만족하기 위하여 실시간 커널에는 실시간 태스크 처리와 인터럽트 처리, 타이밍을 처리하도록 하였고 비 실시간 커널은 일반적인 태스크를 처리하도록 하였다. 제안된 실시간 시스템은 RT-Linux, QNX와 인터럽트 지연, 스케줄링 정확성, 메시지 전달시간 등을 비교 분석하여 효율성을 입증하였다.

  • PDF

학습 평가 분석을 이용한 웹기반 코스 스케쥴링 멀티 에이전트 시스템 (A Course Scheduling Multi-Agent System using Learning Evaluation Analysis)

  • 박재표;이광형;이종희;전문석
    • 컴퓨터교육학회논문지
    • /
    • 제7권1호
    • /
    • pp.97-106
    • /
    • 2004
  • 최근 학습자의 요구에 맞는 코스웨어의 주문이 증가하고 있는 추세이며 그에 따라 웹 기반 교육 시스템에 효율적이고 자동화된 교육 에이전트의 필요성이 인식되고 있다. 본 논문에서는 취약성 분석 알고리즘을 이용한 학습자 중심의 코스 스케쥴링 멀티 에이전트 시스템을 제안한다. 제안한 시스템은 먼저 학습자의 학습 평가 결과를 분석하고 학습자의 학습 성취도를 계산하며, 이 성취도를 에이전트의 스케줄에 적응하여 학습자에게 적합한 코스를 제공하고, 학습자는 이러한 코스에 따라 능력에 맞는 반복된 학습을 통하여 적극적인 완전학습을 수행하게 된다.

  • PDF

생산일정계획을 위한 지식 기반 모의실험 (Knowledge Based Simulation for Production Scheduling)

  • 나태영;김승권;김선욱
    • 대한산업공학회지
    • /
    • 제23권1호
    • /
    • pp.197-213
    • /
    • 1997
  • It is not easy to find a good production schedule which can be used in practice. Therefore, production scheduling simulation with a simple dispatching rule or a set of dispatching rules is used. However, a simple dispatching rule may not create a robust schedule, for the same rule is blindly applied to all internal production processes. The presumption is that there might be a specific combination of appropriate rules that can improve the efficiency of a total production system for a certain type of orders. In order to acquire a better set of dispatching rules, simulation is used to examine the performance of various combinations of dispatching rule sets. There are innumerable combination of rule sets. Hence it takes too much computer simulation time to find a robust set of dispatching rule for a specific production system. Therefore, we propose a concept of the knowledge based simulation to circumvent the problem. The knowledge based simulation consists of knowledge bases, an inference engine and a simulator. The knowledge base is made of rule sets that is extracted from both simulation and human intuition obtained by the simulation studies. For a certain type of orders, the proposed system provides several sets of dispatching rules that are expected to generate better results. Then the scheduler tries to find the best by simulating all proposed set of rules with the simulator. The knowledge-based simulator armed with the acquired knowledge has produced improved solutions in terms of time and scheduling performance.

  • PDF

Common Due-Date Assignment and Scheduling with Sequence-Dependent Setup Times: a Case Study on a Paper Remanufacturing System

  • Kim, Jun-Gyu;Kim, Ji-Su;Lee, Dong-Ho
    • Management Science and Financial Engineering
    • /
    • 제18권1호
    • /
    • pp.1-12
    • /
    • 2012
  • In this paper, we report a case study on the common due-date assignment and scheduling problem in a paper remanufacturing system that produces corrugated cardboards using collected waste papers for a given set of orders under the make-to-order (MTO) environment. Since the system produces corrugated cardboards in an integrated process and has sequence-dependent setups, the problem considered here can be regarded as common due-date assignment and sequencing on a single machine with sequence-dependent setup times. The objective is to minimize the sum of the penalties associated with due-date assignment, earliness, and tardiness. In the study, the earliness and tardiness penalties were obtained from inventory holding and backorder costs, respectively. To solve the problem, we adopted two types of algorithms: (a) branch and bound algorithm that gives the optimal solutions; and (b) heuristic algorithms. Computational experiments were done on the data generated from the case and the results show that both types of algorithms work well for the case data. In particular, the branch and bound algorithm gave the optimal solutions quickly. However, it is recommended to use the heuristic algorithms for large-sized instances, especially when the solution time is very critical.

다중 사용자 MIMO 시스템의 사용자 스케쥴링을 위한 동적 피드백 선택 기법 (Dynamic Feedback Selection Scheme for User Scheduling in Multi-user MIMO Systems)

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

궤도 유지보수를 위한 틀림진전 예측 및 일정최적화 (Track Deterioration Prediction and Scheduling for Preventive Maintenance of Railroad)

  • 김대영;이성근;이기우;우병구;이성욱;김기동
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 2008년도 춘계학술대회 논문집
    • /
    • pp.1359-1370
    • /
    • 2008
  • In the track geometry such as rails, sleepers, ballasts and fastener, track deterioration occurs by repetitive train weight and the high-speed railway takes a trend faster than normal. Track deterioration of over threshold value harms ride comfort and furthermore affect in trains safety seriously. An organic and systematic track maintenance system is very important because a trend of the track deterioration effects on track life-cycle and running safety. Also costs of the railway track permanent way and its maintenance are extremely large, forming a significant part of the total infrastructure expenditure. Therefor reasonable and efficient track maintenance has to be planed on a budget. It is required to carry out not only corrective maintenance but preventive maintenance for the track maintenance. In order to perform maintenance jobs in the boundary of the machines and resources given regarding the type and amount jobs, it is necessary to determine feasible or optimal scheduling considering the priority. In this study, the system organization and required functions for the development of track maintenance system supported track deterioration prediction and optimal scheduling are proposed.

  • PDF

확장 나무성장 그래프를 이용한 시스템 온 칩의 테스트 스케줄링 알고리듬 (Test Scheduling Algorithm of System-on-a-Chip Using Extended Tree Growing Graph)

  • 박진성;이재민
    • 대한전자공학회논문지SD
    • /
    • 제41권3호
    • /
    • pp.93-100
    • /
    • 2004
  • 시스템 온 칩의 테스트 스케줄링은 제한된 전력 사용량 내에서 테스트 시간을 최소화하기 위한 방법들 가운데 하나로서 매우 중요하다. 본 논문에서는 테스트 자원들을 선택하여 그룹화하고 코어 기반 시스템 온 칩 전체 전력소비량을 고려하면서 테스트 시간과 전력소모량의 곱의 크기에 기초하여 이들을 배열하여 스케줄링 하는 휴리스틱 알고리듬을 제안한다. 전력소모량은 최대이면서 제한된 전력 소모량을 초과하지 않는 테스트 자원 그룹을 먼저 선택하고 테스트 자원 그룹 내 요소들의 테스트 시작 위치를 테스트 공간의 초기 위치에 배치하여 테스트 자원들의 낭비시간을 최소화한다. ITC02 벤치마크 회로를 사용한 실험을 통해 알고리듬의 유효성을 보인다.

ILOG를 활용한 금형 생산시스템의 일정계획 시스템 개발에 관한 연구 (A Study on Developing a Scheduling System for a Die Manufacturing System Using ILOG)

  • 정한일;정대영;김기동;박찬권;박진우
    • 산업공학
    • /
    • 제13권4호
    • /
    • pp.564-571
    • /
    • 2000
  • Manufacturing companies are implementing a so-called customer-centered supply chain management to have a competitive advantage. In these efforts, collaboration not only within a company but also with suppliers, partners and customers is emphasized. The fast delivery, reducing the total lead-time from development to delivery, is pursued more than ever, though the quality and cost are still importantly regarded. Die manufacturing companies are not exception from these trends, because a die is a necessary tool for almost manufacturing industries. The planning and scheduling system plays an important role in supply chain management. In this study, we address a scheduling problem of a die manufacturing company. The problem is very complex due to many reasons including the uncertainty in environment and the complexity of constraints. Considering the importance of due-date satisfaction and human planners' roles, we designed the solution algorithm and the user interface respectively. In the implementation phase, modeling constructs and basic solution algorithms of ILOG solver and ILOG scheduler are used. In the paper, the problem and the algorithm are described with ILOG constructs, and the experience of use is also addressed.

  • PDF

Architectural Design of Terminal Operating System for a Container Terminal Based on a New Concept

  • Singgih, Ivan Kristianto;Jin, Xuefeng;Hong, Soondo;Kim, Kap Hwan
    • Industrial Engineering and Management Systems
    • /
    • 제15권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.

경쟁적 전력시장에서 송전선로 상정사고를 고려한 선행급전 알고리즘 개선에 관한 연구 (A Study on an Improving Contingency Constrained Pre-Dispatch Algorithm in a Competitive Electricity Market)

  • 김광모;신혜경;강동주;한석만;정구형;김발호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 제38회 하계학술대회
    • /
    • pp.806-807
    • /
    • 2007
  • Systematic studies on the dispatch scheduling algorithm and related constraints can enhance the effectiveness of electricity market operation. When System Operator (SO) establishes a dispatch schedule, the bid information should be preserved in the schedule as much as possible. In this paper, we introduce a new type of sensitivity factor called Line Outage Impact Factor (LOIF) to screen a transmission line causing the most severe outage when scheduling the dispatch. This screening can assure the stable system operation and make an efficient feedback between the SO and market participants. We propose a transmission line contingency constrained Pre-dispatch algorithm using sensitivity indices in a suitable Pre-dispatch scheduling. The proposed algorithm has been tested on sample system and the results show more secure operation against critical contingencies.

  • PDF