• Title/Summary/Keyword: on-line scheduling

Search Result 172, Processing Time 0.022 seconds

Capacitated Fab Scheduling Approximation using Average Reward TD(${\lambda}$) Learning based on System Feature Functions (시스템 특성함수 기반 평균보상 TD(${\lambda}$) 학습을 통한 유한용량 Fab 스케줄링 근사화)

  • Choi, Jin-Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.4
    • /
    • pp.189-196
    • /
    • 2011
  • In this paper, we propose a logical control-based actor-critic algorithm as an efficient approach for the approximation of the capacitated fab scheduling problem. We apply the average reward temporal-difference learning method for estimating the relative value functions of system states, while avoiding deadlock situation by Banker's algorithm. We consider the Intel mini-fab re-entrant line for the evaluation of the suggested algorithm and perform a numerical experiment by generating some sample system configurations randomly. We show that the suggested method has a prominent performance compared to other well-known heuristics.

An Efficient Algorithm to Minimize Total Error of the Imprecise Real Time Tasks with 0/1 Constraint (0/1 제약조건을 갖는 부정확한 실시간 태스크들의 총오류를 최소화시키는 효율적인 알고리즘)

  • Song, Gi-Hyeon
    • Journal of the Korea Computer Industry Society
    • /
    • v.7 no.4
    • /
    • pp.309-320
    • /
    • 2006
  • The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In the NORA algorithm, the EDF strategy is adopted in the optional scheduling.<중략> The algorithm, proposed in this paper, can be applied to some applications efficiently such as radar tracking, image processing, missile control and so on.

  • PDF

A Study on the Integrated System and Sensitivity Analysis for Line Capacity Calculation Model (선로용량 계산 모델의 통합과 통합 민감도 분석 체계에 관한 연구)

  • Kim, Mu-Ryong;Kim, Han-Sin;Lee, Chang-Ho;Kim, Bong-Seon;Kim, Dong-Hui;Hong, Sun-Heum
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2005.11a
    • /
    • pp.30-39
    • /
    • 2005
  • Line capacity calculation has been used to determine optimum efficiency and safe train service for train scheduling plan and investment priority order throughout detecting bottleneck section. Because of some problems of Yamagisi and UIC methods for line capacity calculation, developing of the method of line capacity calculation and evaluation for the Korea circumstance is important. This paper deals with the integrated system of TPS(Train Performance Simulator), PES(Parameter Evaluation Simulator), LCS (Line Capacity Simulator) and sensitivity analysis for line capacity calculation model.

  • PDF

An EDF Based Real-Time Scheduling Algorithm for Imprecise Computation (불확정 계산을 위한 EDF 기반의 실시간 스케줄링 알고리즘)

  • Choi, Hwan-Pil;Kim, Yong-Seok
    • The KIPS Transactions:PartA
    • /
    • v.18A no.4
    • /
    • pp.143-150
    • /
    • 2011
  • This paper presents an EDF based scheduling algorithm for scheduling imprecise computation model where each task consists of mandatory part and optional part. Imprecise computation is useful to manage overload condition. In overload situation, some optional parts should be removed. The proposed DOP algorithm removes optional parts of earlier deadline tasks to enhance flexibly for newly arriving tasks. A simulation result shows that DOP has better performance than other algorithms.

Construction of Scheduling Support System for Panel Lines by Digital Manufacturing Simulation (디지털 생산 시뮬레이션 기반의 판넬라인 일정계획지원 시스템 구축)

  • Lee, Kwang-Kook;Choi, Dong-Hwan;Han, Sang-Dong;Park, Ju-Young;Shin, Jong-Gye
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.43 no.2 s.146
    • /
    • pp.228-235
    • /
    • 2006
  • Nowadays, digital manufacturing has been known to be very effective method in manufacturing fields. It is aimed to estimate process time, to improve operation efficiency, and to prevent bottleneck processes in advance of real manufacturing. This paper addresses a scheduling support system for panel hues in a shipyard through digital manufacturing simulation. The proposed system supports operators to make better decisions on the shop-floor scheduling in panel lines. It ,would provide a complete schedule that is at least as good as any schedule currently obtained. Furthermore, it can evaluate the operator's schedule by simulating it with 3-dimensional models before the work orders and schedules are released.

A Vertical Line Following Guidance Law Design (수직면 직선추종유도법칙 설계)

  • Whang, Ick-Ho;Cho, Sung-Jin
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.7
    • /
    • pp.1309-1313
    • /
    • 2010
  • In this paper, we propose a novel guidance law for controlling an UAV(Unmanned Air-Vehicle) to follow a reference line in vertical plane. A kinematics model representing the relative motion of the UAV to the reference line is derived. And then LQR(Linear Quadratic Regulator) theory is applied to the model to derive the VLFG(Vertical Line Following Guidance) law. The resultant guidance law forms a gain-scheduling controller scheduled by a simple parameter $\sigma$ which is a function of the UAV's velocity, axial acceleration, gravity, and the slope of the reference line. Also derived is a stability condition for the $\sigma$ variation based on Lyapunov theory. Simulation results show that the proposed guidance law can be applied effectively to UAV guidance algorithm design.

An Efficient On-line Frame Scheduling Algorithm for Video Conferences (화상회의를 위한 효율적인 온-라인 프레임 스케줄링 알고리즘)

  • 안성용;이정아;심재홍
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.7
    • /
    • pp.387-396
    • /
    • 2004
  • In this paper, we propose an algorithm that distributes processor time to the tasks decoding encoded frames with a goal maximizing total QoS (quality of services) of video conference system. An encoded frame has such a characteristic that the QoS of recovered frame image also increases as the processor time given for decoding the frame gets to increase. Thus, the quality of decoded image for each frame can be represented as a QoS function of the amount of service time given to decode. In addition, every stream of video conference has close time-dependency between continuous frames belonging to the same stream. Based on the time-dependency and QoS functions, we propose an on-line frame scheduling algorithm which does not schedule all frames in the system but just a few frames while maximizing total QoS of video streams in the conference. The simulation results show that, as the system load gets to increase, the proposed algorithm compared to the existing EDF algorithm can reduce the quality of decoded frame images more smoothly and show the movements of conference attendees more naturally without short cutting.

PID control with parameter scheduling using fuzzy logic

  • Kwak, Jae-Hyuck;Jeon, Gi-Joon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.449-454
    • /
    • 1994
  • This paper describes new PID control methods based on the fuzzy logic. PID gains are retuned after evaluating control performances of transient responses in terms of performance features. The retuning procedure is based on fuzzy rules and reasoning accumulated from the knowledge of experts on PID gain scheduling. For the case that the retuned PID gains result in worse CLDR (characteristics of load disturbance rejection) than the initial gains, an on-line tuning scheme of the set-point weighting parameter is, proposed. This is based on the fact that the set-point weighting method efficiently reduce either overshoot or undershoot without any degradation of CLDR. The set-point weighting parameter is adjusted at each sampling instant by the fuzzy rules and reasoning. As a result, better control performances were achived in comparison with die controllers tuned by the Z-N (Ziegler-Nichols) parameter tuning formula or by the fixed set-point weighting parameter.

  • PDF

An Approach for Construction of Shipyard Simulation Environment based on Neutral File Format (중립파일 기반의 조선소 시뮬레이션 환경에 관한 연구)

  • Woo, Jong Hun;Hwang, Yoon-Suk;Nam, Jong-Ho
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.53 no.1
    • /
    • pp.18-28
    • /
    • 2016
  • In shipbuilding, the scheduling system is susceptible to sudden changes and thus it turns to be difficult to predict the differences between schedule and production records in advance. A computer-based simulation is commonly utilized to overcome the discrepancies occurred in estimating workloads and resulting processing times. The main drawback of this simulation-based solution is its limited applicability because, in most cases, each shipyard requires specific and customized simulation environment. By standardizing the planning data of the midterm scheduling system, as proposed in this paper, the efficiency of the current simulation model can be enhanced. To present an alternative approach, this paper begins with the analysis of the complex planning data structure of several shipyards and then proceeds to construct a standard data structure based on the neutral format. An interface application is developed for the data transaction and simulation in on-line environment. As a result, a simulation-based production management of shipyards can be achieved by the efficient prediction of planning and scheduling.

A Heuristic Approach for Establishing On-line Real-time Exam Timetables in Cyber Universities (중복시험을 배제할 수 있는 사이버대학의 온라인 실시간 시험 시간표 작성 방안)

  • Park, Chan-Kwon;Kim, Hyoung-Do;Yum, Ji-Hwan
    • Journal of Information Technology Applications and Management
    • /
    • v.14 no.3
    • /
    • pp.227-236
    • /
    • 2007
  • Students in cyber universities can take every course because there are no physical constraints such as class rooms. On the other hand. cyber universities should take a heavy burden to schedule real-time exams in a designated time period. Any two courses a student takes must not be simultaneously allocated to a time slot in such a schedule. It is well known that the complexity of this kind of scheduling problem increases exponentially as the number of courses does. This research provides a heuristic method to make on-line real-time exam timetables with minimal exam time span. It considers the constraint of not allocating courses a student takes to simultaneous exam time and prioritizes courses by the number of students.

  • PDF