• Title/Summary/Keyword: Operation Scheduling

Search Result 521, Processing Time 0.026 seconds

Real-Time Scheduler with Extended Schedulability Testing for Mach Kernel Reconfiguration (Mach 커널의 재구성을 위한 확장된 스케줄 가능성 검사를 수행하는 실시간 스케줄러)

  • Ryu, Jin-Yeol;Kim, Kwang;Heu, Shin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.507-519
    • /
    • 2000
  • n this paper, we implement the real-time scheduler which performs extended schedulability testing, to reconfigure Mach kernel in which Real-Time scheduling is possible. for this purpose, first, we propose the configuration factors according to requirements of Real-Time operation systems and we analyze a Real-time scheduling algorithm. Second, for the reconfiguration of Mach kernel, we propose the modified data structure through the analysis of Mach kernel environments and scheduling. Third, we suggest the extended scheduling method by analyzing conventional Real-Time scheduling policies. Fourth, we implement the scheduler which executes tasks according to the Earliest-Deadline-First scheduling and the Rate Monotonic scheduling.

  • PDF

Job shop에서 평균처리시간 최소화를 위한 할당 규칙

  • 전태준;박성호
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.310-313
    • /
    • 1996
  • Mathematical programming method for finding optimal solution of job shop scheduling is inadequate to real situation because fo too much computation time. In contrast, dispatching rule is helpful for reducing compuation time but is not guaranted to find optimal solution. The purpose of this paper is to develop a new dispatching rule and procedure to minimize mean flow time whose result is near the optimal solution for job shop scheduling. First step is to select machine which have shortest finishing operation time among the schedulable operations. Second step is to select operation with regard to estimated remaining operation time. The suggested rule is compared with nondelay and MWKR rule for three examples, and is confirmed to be most effective to minimize mean flow time.

  • PDF

Scheduling of the Bottleneck Operation with Capacity-Dependent Processing Time (장비능력에 의존적인 처리시간을 가진 애로공정의 일정계획 수립(몰드변압기 공장을 중심으로))

  • Seo, Jun-Yong;Koh, Jae-Moon
    • IE interfaces
    • /
    • v.14 no.4
    • /
    • pp.385-393
    • /
    • 2001
  • In this paper, a scheme of scheduling a bottleneck operation is presented for production planning of make-to-order. We focus on the problem of capacity-dependent processing time in which processing time of the bottleneck operation is not fixed, but varies with job sequence or equipment capacity. For this, a genetic algorithm is applied for job sequencing with an objective function of mean square of weighted deviation. An experimental study is implemented in power transformer plant and results are compared with those of the EDD rule. It shows that the genetic algorithm is relatively good for most cases.

  • PDF

Operation Scheduling in a Commercial Building with Chiller System and Energy Storage System for a Demand Response Market (냉각 시스템 및 에너지 저장 시스템을 갖춘 상업용 빌딩의 수요자원 거래시장 대응을 위한 운영 스케줄링)

  • Son, Joon-Ho;Rho, Dae-Seok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.8
    • /
    • pp.312-321
    • /
    • 2018
  • The Korean DR market proposes suppression of peak demand under reliability crisis caused a natural disaster or unexpected power plant accidents as well as saving power plant construction costs and expanding amount of reserve as utility's perspective. End-user is notified a DR event signal DR execution before one hour, and executes DR based on requested amount of load reduction. This paper proposes a DR energy management algorithm that can be scheduled the optimal operations of chiller system and ESS in the next day considering the TOU tariff and DR scheme. In this DR algorithm is divided into two scheduling's; day-ahead operation scheduling with temperature forecasting error and operation rescheduling on DR operation. In day-ahead operation scheduling, the operations of DR resources are scheduled based on the finite number of ambient temperature scenarios, which have been generated based on the historical ambient temperature data. As well as, the uncertainties in DR event including requested amount of load reduction and specified DR duration are also considered as scenarios. Also, operation rescheduling on DR operation day is proposed to ensure thermal comfort and the benefit of a COB owner. The proposed method minimizes the expected energy cost by a mixed integer linear programming (MILP).

Development of Scheduling System for Trajectory Based Air Traffic Management (궤적 기반의 항공 교통 관리를 위한 스케줄링 시스템 개발)

  • Oh, Eun-Mi;Eun, Yeonju;Kim, Hyounkyoung;Jeon, Daekeun
    • Journal of Advanced Navigation Technology
    • /
    • v.22 no.5
    • /
    • pp.367-374
    • /
    • 2018
  • A trajectory-based scheduling system is proposed for air traffic management using next generation aviation data communication link. Based on the service concept of 4-dimensional trajectory data link (4DTRAD) using air traffic serveices (ATS) datalink Baseline 2, a procedure for trajectory-based operation of an en-route flight is established and described in detail. To mitigate air traffic controllers' workload which might be caused by various and complicated data utilization, a prototype of the scheduling system, which predicts the aircraft trajectory based on the flight intents received by air traffic service system and provides advisory information for air traffic control, was developed. The simulation environment for trajectory based operation was built to validate the scheduling functionality of the prototype.

A NESTING APPROACH IN DISCRETE EVENT SIMULATION FOR INTEGRATING CONSTRUCTION OPERATION AND SCHEDULE MODELS

  • Chang-Yong Yi;Chan-Sik Park;Doo-Jin Lee;Dong-Eun Lee
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.400-408
    • /
    • 2009
  • Simulation applications for analyzing the productivity of construction operations at operation level and project schedules at project level are crucial methods in project management. The application at two different levels should be very tightly linked to each other in practice. However, appropriate integration at the levels is not achieved in that existing systems do not support to integrate operation models into a schedule model. This paper presents a new approach named to Discrete Event Simulation-Nesting modeling approach, which supports not only productivity analysis at operation level but also schedule management at a project level. The system developed by the authors allows creating operation models at the operation level, maintaining them in operation model library, executing sensitivity analysis to find the behaviors of the operation models when different combination of resources are used as existing DES systems do. On top of the conventional functions, the new system facilitates to find the optimum solution of resource combinations which satisfy the user's interest by computing the hourly productivity and the hourly cost of the operation. By drag-and-dropping an operation model kept in the operation model library, the operation models are integrated into an activity of the schedule model. When a complete schedule model is established by nesting operation models into the schedule model, stochastic simulation based scheduling is executed. A case study is presented to demonstrate the new simulation system and verify the validity of the system.

  • PDF

FMS 스케쥴링을 위한 Priority 함수의 자동 생성에 관한 연구

  • 김창욱;신호섭;장성용;박진우
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1997.04a
    • /
    • pp.93-99
    • /
    • 1997
  • Most of the past studies on FMS scheduling problems may be classified into two classes, namely off-line scheduling and on-line scheduling approach. The off-line scheduling methods are used mostly for FMS planning purposes and may not be useful real time control of FMSs, because it generates solutions only after a relatively long period of time. The on-line scheduling methods are used extensively for dynamic real-time control of FMSs although the performance of on-line scheduling algorithms tends vary dramatically depending on various configurations of FMS. Current study is about finding a better on-line scheduling rules for FMS operations. In this study, we propose a method to create priority functions that can be used in setting relative priorities among jobs or machines in on-line scheduling. The priority functions reflect the configuration of FMS and the user-defined objective functions. The priority functions are generated from diverse dispatching rules which may be considered a special priority functions by themselves, and used to determine the order of processing and transporting parts. Overall system of our work consists of two modules, the Priority Function Evolution Module (PFEM) and the FMS Simulation Module (FMSSM). The PFEM generates new priority functions using input variables from a terminal set and primitive functions from a function set by genetic programming. And the FMSSM evaluates each priority function by a simulation methodology. Based on these evaluated values, the PFEM creates new priority functions by using crossover, mutation operation and probabilistic selection. These processes are iteratively applied until the termination criteria are satisfied. We considered various configurations and objective functions of FMSs in our study, and we seek a workable solution rather than an optimum or near optimum solution in scheduling FMS operations in real time. To verify the viability of our approach, experimental results of our model on real FMS are included.

  • PDF

Flow Scheduling in OBS Networks Based on Software-Defined Networking Control Plane

  • Tang, Wan;Chen, Fan;Chen, Min;Liu, Guo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.1-17
    • /
    • 2016
  • The separated management and operation of commercial IP/optical multilayer networks makes network operators look for a unified control plane (UCP) to reduce their capital and operational expenditure. Software-defined networking (SDN) provides a central control plane with a programmable mechanism, regarded as a promising UCP for future optical networks. The general control and scheduling mechanism in SDN-based optical burst switching (OBS) networks is insufficient so the controller has to process a large number of messages per second, resulting in low network resource utilization. In view of this, this paper presents the burst-flow scheduling mechanism (BFSM) with a proposed scheduling algorithm considering channel usage. The simulation results show that, compared with the general control and scheduling mechanism, BFSM provides higher resource utilization and controller performance for the SDN-based OBS network in terms of burst loss rate, the number of messages to which the controller responds, and the average latency of the controller to process a message.

A Rational Operation Scheduling Using Evolutionary Algorithm on Industrial Cogeneration System (산업용 열병합발전시스템에서 진화 알고리즘을 이용한 합리적 운전계획 수립에 관한 연구)

  • Choi, Kwang-Beom;Jeong, Ji-Hoon;Lee, Jong-Beom
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.49 no.10
    • /
    • pp.494-501
    • /
    • 2000
  • This paper describes a strategy of a daily optimal operational scheduling in cogeneration system for paper mill. The cogeneration system selected to establish the scheduling consists of three units and several auxiliary devices. One unit generates electrical and thermal energy using the back pressure turbine. The rest two units generate the energy using the extraction condensing turbine. Three auxiliary boilers, two waste boilers and three sludge incinerators operate to supply energy to the loads with three units. The cogeneration system is able to supply enough the thermal energy to the thermal load, however it can not sufficiently supply the electrical power to the electrical load. Therefore the insufficient electric energy is compensated by buying electrical energy from utility. When the operational scheduling is performed considering the environmental problem. This paper shows the simulation results for daily operational scheduling obtained using the evolutionary algorithm. This results reveal that the proposed modeling and strategy can be effectively applied to cogeneration system for paper mill.

  • PDF

A Study on Single Machine Scheduling with a Rate-Modifying Activity and Time-Dependent Deterioration After the Activity (복구조정 활동과 복구조정 후 시간경과에 따라 퇴화하는 작업시간을 갖는 단일기계의 일정계획에 관한 연구)

  • Kim, Byung Soo;Joo, Cheol Min
    • Korean Management Science Review
    • /
    • v.30 no.1
    • /
    • pp.15-24
    • /
    • 2013
  • We consider the single machine scheduling problem with a rate-modifying activity and time-dependent deterioration after the activity. The class of scheduling problems with rate-modifying activities and the class of scheduling problems with time-dependent processing times have been studied independently. However, the integration of these classes is motivated by human operators of tasks who has fatigue while carrying out the operation of a series of tasks. This situation is also applicable to machines that experience performance degradation over time due to mal-position or mal-alignment of jobs, abrasion of tools, and scraps of operations, etc. In this study, the integration of the two classes of scheduling problems is considered. We present a mathematical model to determine job-sequence and a position of a rate-modifying activity for the integration problem. Since the model is difficult to solve as the size of real problem being very large, we propose genetic algorithms. The performance of the algorithms are compared with optimal solutions with various problems.