• 제목/요약/키워드: scheduling algorithm

검색결과 1,770건 처리시간 0.025초

Term-Based Approach를 기초로한 자원제한프로젝트스케줄링 문제의 해결 (Solution of the Resource Constrained Project Scheduling Problem on the Foundation of a Term-Based Approach)

  • 김복선
    • 한국지능시스템학회논문지
    • /
    • 제24권2호
    • /
    • pp.218-224
    • /
    • 2014
  • The logic-based scheduling language RCPSV may be used to model resource-constrained project scheduling problems with variants for minimizing the project completion time. A diagram-based, nonredundant enumeration algorithm for the RCPSV-problem is proposed and the correctness of the algorithm is proved.

저전력 상위 레벨 합성을 위한 레지스터 스케줄링 및 할당알고리듬 (A Register Scheduling and Allocation Algorithm for Low Power High Level synthesis)

  • 최지영;인치호;김희석
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 추계종합학술대회 논문집(2)
    • /
    • pp.188-191
    • /
    • 2000
  • This paper presents a register scheduling and allocation algorithm for high level synthesis. The proposed algorithm executes the low power scheduling to reduce the switching activity using shut down technique which was not unnecessary the calculation through the extraction DFG from VHDL description. Also, the register allocation algorithm determines the minimum register after the life time analysis of all variable. It is minimum the switching activity using graph coloring technique for low power consumption. The proposed algorithm proves the effect through various filter benchmark to adopt a new scheduling and allocation algorithm considering the low power.

  • PDF

HR-WPAN을 위한 Worst-case Guaranteed Scheduling algorithm (Worst-case Guaranteed Scheduling algorithm for HR-WPAN)

  • 김제민;이정규
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.249-251
    • /
    • 2007
  • The proposed LDS(Link-status Dependent Scheduling) algorithm in HR-WPAN up to now aims at doing only throughput elevation of the whole network, when the crucial DEV(Device) is connected with worst-link relatively, throughput of this DEV becomes aggravation, The proposed the WGS(Worst-case Guaranteed Scheduling) _algorithm in this paper guarantees throughput of the DEV which is connected with worst-link in a certain degree as maintaining throughput of all DEVs identically even if a link-status changes, decreases delay of the whole network more than current LDS algorithm Therefore proposed WGS algorithm in this paper will be useful in case of guaranteeing throughput of a DEV which is connected worst-link in a certain degree in a design of HR-WPAN hereafter.

  • PDF

단일공정에서의 가공속도 조절에 의한 생산일정계획 (An Algorithm for Single Machine Scheduling Using The Control of Machining Speed)

  • 박찬웅
    • 한국국방경영분석학회지
    • /
    • 제24권2호
    • /
    • pp.162-169
    • /
    • 1998
  • This study presents an single machine scheduling algorithm minimize lateness of product by controlling machining speed. Generally, production scheduling uses the information of process planning. But the production scheduling algorithm has not considered the control of machining speed in its procedures. Therefore, the purpose of this study is to consider the machining speed in production scheduling algorithm for efficient production scheduling. Machining time and machining cost required to manufacture a piece of a product are expressed as a unimodal convex function with respect to machining speed, so it has minimal point at minimum time speed or the minimum cost speed. Therefore, because of considering the machining cost, the control of machining speed for the algorithm is executed between minimum speed and maximum speed. An example is demonstrated to explain the algorithm.

  • PDF

Task Scheduling and Resource Management Strategy for Edge Cloud Computing Using Improved Genetic Algorithm

  • Xiuye Yin;Liyong Chen
    • Journal of Information Processing Systems
    • /
    • 제19권4호
    • /
    • pp.450-464
    • /
    • 2023
  • To address the problems of large system overhead and low timeliness when dealing with task scheduling in mobile edge cloud computing, a task scheduling and resource management strategy for edge cloud computing based on an improved genetic algorithm was proposed. First, a user task scheduling system model based on edge cloud computing was constructed using the Shannon theorem, including calculation, communication, and network models. In addition, a multi-objective optimization model, including delay and energy consumption, was constructed to minimize the sum of two weights. Finally, the selection, crossover, and mutation operations of the genetic algorithm were improved using the best reservation selection algorithm and normal distribution crossover operator. Furthermore, an improved legacy algorithm was selected to deal with the multi-objective problem and acquire the optimal solution, that is, the best computing task scheduling scheme. The experimental analysis of the proposed strategy based on the MATLAB simulation platform shows that its energy loss does not exceed 50 J, and the time delay is 23.2 ms, which are better than those of other comparison strategies.

실시간 시스템에서 성능 향상 기법 (Enhanced Technique for Performance in Real Time Systems)

  • 김명준
    • 한국IT서비스학회지
    • /
    • 제16권3호
    • /
    • pp.103-111
    • /
    • 2017
  • The real time scheduling is a key research area in high performance computing and has been a source of challenging problems. A periodic task is an infinite sequence of task instance where each job of a task comes in a regular period. The RMS (Rate Monotonic Scheduling) algorithm has the advantage of a strong theoretical foundation and holds out the promise of reducing the need for exhaustive testing of the scheduling. Many real-time systems built in the past based their scheduling on the Cyclic Executive Model because it produces predictable schedules which facilitate exhaustive testing. In this work we propose hybrid scheduling method which combines features of both of these scheduling algorithms. The original rate monotonic scheduling algorithm didn't consider the uniform sampling tasks in the real time systems. We have enumerated some issues when the RMS is applied to our hybrid scheduling method. We found the scheduling bound for the hard real-time systems which include the uniform sampling tasks. The suggested hybrid scheduling algorithm turns out to have some advantages from the point of view of the real time system designer, and is particularly useful in the context of large critical systems. Our algorithm can be useful for real time system designer who must guarantee the hard real time tasks.

Multiobjective Genetic Algorithm for Scheduling Problems in Manufacturing Systems

  • Gen, Mitsuo;Lin, Lin
    • Industrial Engineering and Management Systems
    • /
    • 제11권4호
    • /
    • pp.310-330
    • /
    • 2012
  • Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.

복수모기지의 항공기 운항계획및 승무계획 문제의 발견적 기법 (Greedy Heuristic Algorithm for a Multidepot Aircraft Scheduling and Crew Scheduling Problem)

  • 장병만;박순달
    • 대한산업공학회지
    • /
    • 제11권2호
    • /
    • pp.155-163
    • /
    • 1985
  • This paper presents a heuristic algorithm for a multidepot aircraft scheduling and crew scheduling with deal-head flights. This algorithm is extended from a Greedy heuristic algorithm for a multi-depot multi-salesman traveling salesman problem. We first transform a given flight schedule into a multi-depot multi-traveling salesman problem, considering aircraft flight policies and crew management constraints. Then we solve this problem by applying a modified Greedy heuristic algorithm.

  • PDF

유전 알고리즘을 이용한 선각 가공 작업일정계획 시스템의 개발에 관한 연구 (Operation Scheduling System for Hull Block Fabrication in Shipbuilding using Genetic Algorithm)

  • 조규갑;김영구;류광렬;황준하;최형림
    • 산업공학
    • /
    • 제11권3호
    • /
    • pp.115-128
    • /
    • 1998
  • This paper presents a development of operation scheduling and reactive operation scheduling system for hull fabrication. The methodology for implementing operation scheduling system is HHGA(Hierarchical Hybrid Genetic Algorithm) which exploits both the global perspective of the genetic algorithm and the rapid convergence of the heuristic search for operation scheduling. The methodology for the reactive operation scheduling is the revised HHGA which consists of manual schedule editor for occurrence of exceptional events and the revised scheduling method used in operation scheduling. As the results of experiment, it has been confirmed that HHGA is able to search good operation scheduling within reasonable time, and the revised HHGA is able to search load-balanced reactive operation scheduling with minimum changes of initial operation schedule within short period of time.

  • PDF

가중치 작업들의 온라인 비선점 마감시한 스케줄링 (Online Non-preemptive Deadline Scheduling for Weighted Jobs)

  • 김재훈;장정환
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제32권2호
    • /
    • pp.68-74
    • /
    • 2005
  • 마감시한 스케줄링에서 작업들은 수행을 완료해야 하는 마감시한을 가진다 스케줄링 알고리즘은 각 시간에 어떠한 작업이 수행되어야 하는 지 결정한다. 수행이 마감시한 안에 완료된 작업들만이 알고리즘의 처리량 또는 이익에 포함된다. 작업들은 임의의 가중치를 가지고 알고리즘의 이익은 완료된 작업들의 가중치의 합으로 주어진다. 스케줄링 알고리즘의 목표는 이익을 최대화하는 것이다. 본 논문에서 우리는 온라인 비선점 스케줄링을 생각한다. 여기서 작업들은 온라인으로 도착하고, 스케줄링 알고리즘은 앞으로 도착할 작업들의 정보를 미리 알 수 없다. 작업들은 스케줄 되고 나서 수행 도중에 멈출 수 없다. 이 문제에 대해서, 우리는 임의의 온라인 알고리즘의 성능의 하한을 구한다. 또한 이 하한과 일치하는 성능을 가지는 최적의 온라인 알고리즘을 제안하다.