• Title/Summary/Keyword: scheduling method

Search Result 1,381, Processing Time 0.027 seconds

Scheduling of Sporadic and Periodic Tasks and Messages with End-to-End Constraints (양극단 제약을 갖는 비주기, 주기 태스크와 메시지 스케줄링)

  • Oh Hoon;Park Hong Seong;Kim Hyoung Yuk
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.2
    • /
    • pp.175-185
    • /
    • 2005
  • The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

Integrated Process Planning and Scheduling for Machining Operation in Shipbuilding (선각 내업 가공작업의 공정계획과 일정계획의 통합화 방안 연구)

  • Cho, Kyu-Kab;Oh, Jung-Soo;Kim, Young-Goo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.10
    • /
    • pp.75-84
    • /
    • 1997
  • This paper describes the development of an integrating method for process planning and scheduling activities for block assembly in shipbuilding. A block is composed of several steel plates and steel sections with the predetermined shapes according to the ship design. The parts which constitute the block are manufac- tured by cutting and/or bending operations, which are termed as machining operation in this paper. The machining operation is the first process for block assembly which influences the remaining block assembly processes. Thus process planning and scheduling for machining operation to manufacture parts for block are very important to meet the assembly schedule in the shipyard. An integrating method for process plan- ning and scheduling is developed by introducing the concept of distributed process planning and scheduling composed of initial planning, alternative planning and final planning stages. In initial planning stage, nesting parts information and machining emthods are generated for each steel plate. In alternative plan- ning stage, machine groups are selected and workcenter dispatching information is generated. In final planning stage, cutting sequences are determined. The integrated system is tested by case study. The result shows that the integrated system is more efficient than existing manual planning system.

  • PDF

Scheduling of Wafer Burn-In Test Process Using Simulation and Reinforcement Learning (강화학습과 시뮬레이션을 활용한 Wafer Burn-in Test 공정 스케줄링)

  • Soon-Woo Kwon;Won-Jun Oh;Seong-Hyeok Ahn;Hyun-Seo Lee;Hoyeoul Lee; In-Beom Park
    • Journal of the Semiconductor & Display Technology
    • /
    • v.23 no.2
    • /
    • pp.107-113
    • /
    • 2024
  • Scheduling of semiconductor test facilities has been crucial since effective scheduling contributes to the profits of semiconductor enterprises and enhances the quality of semiconductor products. This study aims to solve the scheduling problems for the wafer burn-in test facilities of the semiconductor back-end process by utilizing simulation and deep reinforcement learning-based methods. To solve the scheduling problem considered in this study. we propose novel state, action, and reward designs based on the Markov decision process. Furthermore, a neural network is trained by employing the recent RL-based method, named proximal policy optimization. Experimental results showed that the proposed method outperformed traditional heuristic-based scheduling techniques, achieving a higher due date compliance rate of jobs in terms of total job completion time.

  • PDF

Scheduling Considering Bit-Level Delays for High-Level Synthesis (상위수준 합성을 위한 비트단위 지연시간을 고려한 스케줄링)

  • Kim, Ji-Woong;Shin, Hyun-Chul
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.11
    • /
    • pp.83-88
    • /
    • 2008
  • In this paper, a new scheduling method considering bit-level delays for high-level synthesis is proposed. Conventional bit-level delay calculation for high-level synthesis was usually limited for specific resources. However, we have developed an efficient bit-level delay calculation method which is applicable to various resources, in this research. This method is applied to scheduling. The scheduling algorithm is based on list scheduling and executes chaining considering bit-level delays. Furthermore, multi-cycle chaining can be allowed to improve performance under resource constraints. Experimental results on several well-known DSP examples show that our method improves the performance of the results by 14.7% on the average.

Canard-Leading Edge Flap Scheduling for the Maneuverability Enhancement of a Fighter Class Aircraft (전투기급 항공기 기동성 증대를 위한 카나드-앞전플랩 스케줄링)

  • Chung, In-Jae;Kim, Sang-Jin
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.35 no.2
    • /
    • pp.165-170
    • /
    • 2007
  • During the conceptual design phase of a wing-body-canard type fighter class aircraft, as a method of maneuverability enhancement for an aircraft, effects of canard-leading edge flap scheduling have been studied. In this study, corrected supersonic panel method has been used to predict the drag polar characteristics due to canard-leading edge flap deflections in the high speed regime. Utilizing the predicted drag polar curves, the canard-leading edge flap scheduling laws have been established. These scheduling laws are the relation of canard-leading edge flap deflections and the flight conditions to maximize the lift-drag ratio. Based on the results obtained from the canard-leading edge flap scheduling, the present method has shown to be useful to enhance the maneuverability of wing-body-canard type fighter class aircraft.

An Effective Priority Method Using Generator's Discrete Sensitivity Value for Large-scale Preventive Maintenance Scheduling (발전기 이산 민감도를 이용한 효율적인 우선순위법의 대규모 예방정비계획 문제에의 적용 연구)

  • Park, Jong-Bae;Jeong, Man-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.3
    • /
    • pp.234-240
    • /
    • 1999
  • This paper presents a new approach for large-scale generator maintenance scheduling optimizations. The generator preventive maintenance scheduling problems are typical discrete dynamic n-dimensional vector optimization ones with several inequality constraints. The considered objective function to be minimized a subset of{{{{ { R}^{n } }}}} space is the variance (i.g., second-order momentum) of operating reserve margin to levelize risk or reliability during a year. By its nature of the objective function, the optimal solution can only be obtained by enumerating all combinatorial states of each variable, a task which leads to computational explosion in real-world maintenance scheduling problems. This paper proposes a new priority search mechanism based on each generator's discrete sensitivity value which was analytically developed in this study. Unlike the conventional capacity-based priority search, it can prevent the local optimal trap to some extents since it changes dynamically the search tree in each iteration. The proposed method have been applied to two test systems (i.g., one is a sample system with 10 generators and the other is a real-world lage scale power system with 280 generators), and the results anre compared with those of the conventional capacith-based search method and combinatorial optimization method to show the efficiency and effectiveness of the algorithm.

  • PDF

Multi-functional Fighter Radar Scheduling Method for Interleaved Mode Operation of Airborne and Ground Target (전투기탑재 다기능 레이다의 공대공 및 공대지 동시 운용 모드를 위한 스케줄링 기법)

  • Kim, Do-Un;Lee, Woo-Cheol;Choi, Han-Lim;Park, Joontae;Park, Junehyune;Seo, JeongJik
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.49 no.7
    • /
    • pp.581-588
    • /
    • 2021
  • This paper deals with a beam scheduling method in fighter interleaving mode. Not only the priority of tasks but also operational requirements that air-to-ground and air-to-air search tasks should be executed alternatively are established to maximize high-quality of situational awareness. We propose a real-time heuristic beam scheduling method that is advanced from WMDD to satisfies the requirements. The proposed scheduling method is implemented in a simulation environment resembling the task processing mechanism and measurement model of a radar. Performance improvement in terms of task delay time is observed.

A Study of Job Shop Scheduling for Minimizing Tardiness with Alternative Machines (대체기계가 존재하는 Job Shop 일정계획 환경에서 납기지연을 최소화하는 방법에 관한 연구)

  • Kim, Ki-Dong;Kim, Jae-Hong
    • Journal of Industrial Technology
    • /
    • v.28 no.A
    • /
    • pp.51-61
    • /
    • 2008
  • In these days, domestic manufacturers are faced with managerial difficulties such as the increasing competition in their industry and the increasing power of customers. In this situation, they have to satisfy their customers with high quality of their products and meeting due date of their orders. Production of the order within due date is an important factor for improving enterprise competitiveness. The causes of occurrence of tardiness may be wrong product scheduling, unexpected events in field and so on, a way to minimize tardiness is use of alternative machines, overwork, outsourcing and etc.. In this study, we deal with a scheduling problem that can minimize tardiness using alternative machines. This paper provides a mathematical program and a heuristic method for job shop scheduling for minimizing tardiness with alternative machines. And a proposed heuristic method is verified comparing with optimal solution obtained by ILOG CPLEX.

  • PDF

Scheduling of Combined Cycle Gas Turbine Using Lagrangian Relaxation Method (Lagrangian Relaxation 법을 이용한 복합 화력 발전기의 기동 정지 계획)

  • Nam, Young-Woo;Park, Jong-Keun;Kim, Sung-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.334-336
    • /
    • 2000
  • In Korea, the CCGTs have been installed to about 25% of the total generating capacity. Generally CCGTs determine the System Marginal Prices(SMP) in Cost Based Generation Pool. So the scheduling of CCGTs is very important in daily generation scheduling. This paper describes the scheduling of CCGTs which considers the operating characteristics of them. We use lagrangian relaxation method which decomposes the unit committment problem into the subproblems of the individual unit. In the CCGT subproblem, we define the cost function of CCGT in two way. In Case study, the daily generation scheduling is performed using the data of Korean thermal system.

  • PDF

Scheduling Design and Simulation of Software Components for EPS System based on AUTOSAR (AUTOSAR기반 EPS 시스템 소프트웨어 컴포넌트의 스케줄링 설계 및 시뮬레이션)

  • Park, Gwang-Min;Kum, Dae-Hyun;Son, Byeong-Jeom;Lee, Seong-Hun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.6
    • /
    • pp.539-545
    • /
    • 2010
  • Through the AUTOSAR methodology, the embedded software shall become more flexible, reusable, maintainable than ever. However, it is not mentioned about specific timing constraints of software components in AUTOSAR. There are a few basic principles for mapping runnable entities. At this point, AUTOSAR software design with optimal scheduling method is one of the enabling technologies in vehicle embedded system. This paper presents an approach based on mapping runnable entities and task scheduling design method for EPS (Electric Power Steering) software components, based on AUTOSAR. In addition, the experimental results of concurrent simulation show that the proposed scheduling technique and timing synchronization in the software component design can achieve the improved torque ripple performance and it well suited for EPS application software.