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

검색결과 106건 처리시간 0.031초

객체기반 예약 스케줄링기법 (The object-based reservation scheduling techniques)

  • 김진봉
    • 한국컴퓨터산업학회논문지
    • /
    • 제8권2호
    • /
    • pp.89-96
    • /
    • 2007
  • 객체기반 예약스케줄링 기법은 제약만족문제(CSP; Constraint Satisfaction Problem)와 객체지향개념(Object-Oriented Concepts)을 기반으로 승무원 객체들이 갖고 있는 사건들을 주어진 제약들에 만족하도록 목표인 운항스케줄 보드에 배정하는 기법이다. 본 논문에서는 객체기반 예약스케줄링기법을 항공운항 스케줄에 적용하여 승무원(운항승무원, 객실승무원)들의 운항 스케줄 만족도를 향상시키고, 승무원들에 대한 인력관리상의 문제점들을 해결하고자 하였다 특히, 승무원들의 운항스케줄에 대한 만족도를 향상시키기 위해서 전체승무원 선호도보드를 이용하였다. 승무원들의 스케줄 우선순위에 따라서 자원(타임 슬롯)을 배정하고, 자원에 대한 승무원들의 선호도 차이를 가질 수 있게 하였다. 보드에 대한 정의와 모든 사건들에 대한 정보를 전역제약으로 사용하고, 승무원들이 가지는 보드의 타임 슬롯들에 대한 선호도를 지역 제약으로 사용하였다. 또한 실제로 항공운항 스케줄링을 모의실험해서 승무원들의 운항 스케줄 만족도를 살펴보았다.

  • PDF

DISCRETE EVENT SYSTEM SIMULATION APPROACH FOR AN OPERATION ANALYSIS OF A HEADEND PROCESS FACILITY

  • Lee, Hyo-Jik;Kim, Sung-Hyun;Park, Byung-Suk
    • Nuclear Engineering and Technology
    • /
    • 제41권5호
    • /
    • pp.739-746
    • /
    • 2009
  • This paper introduces facility operation modeling and simulation based primarily on a discrete event system modeling scheme. Many modern industrial facilities are so complex that their operational status cannot be estimated by simple calculations. In general, a facility can consist of many processes and transfers of material between processes that may be modeled as a discrete event system. This paper introduces the current status of studies on operation modeling and simulation for typical nuclear facilities, along with some examples. In addition, this paper provides insights about how a discrete event system can be applied to a model for a nuclear facility. A headend facility is chosen for operation modeling and the simulation, and detailed procedure is thoroughly described from modeling to an analysis of discrete event results. These kinds of modeling and simulation are very important because they can contribute to facility design and operation in terms of prediction of system behavior, quantification of facility capacity, bottleneck identification and efficient operation scheduling.

Modeling and Scheduling of Cyclic Shops with Time Window Constraints

  • Seo, Jeong-Won;Lee, Tae-Eog
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2000년도 추계학술대회 및 정기총회
    • /
    • pp.161-164
    • /
    • 2000
  • A cyclic shop is a production system that repeatedly produces identical sets of jobs, called minimal part sets, in the same loading and processing sequence. We consider a version of cyclic shop where the operations are processed and unloaded within time limits, so called a time window. We model the shop using an event graph model, a class of Petri nets. To represent the time window constraint, we introduce places with negative time delays. From the shop modeling graph, we develop a linear system model based on the max- plus algebra and characterize the conditions on the existence of a stable schedule.

  • PDF

운송시간의 예측을 통한 물류정체 통제 모형 (Congestion Management with Arrival Estimation of Unit Loads in an Automated Material Handling System)

  • 정재우;허연호
    • 경영과학
    • /
    • 제29권1호
    • /
    • pp.131-141
    • /
    • 2012
  • The automated material handling systems today are playing ever more important roles in semiconductor/LCD fabrication facilities. Recently they became more flexible, intelligent, and speedy than in the past. The facilities have been fully automated because the size and weight of the unit loads used in the facilities were being increased beyond the limits that a human operator can handle. This research develops an efficient procedure to streamline the delivery of unit loads by the automated material handling system (AMHS). For this task, the research employs the event scheduling theory that has been successfully used in the both academia and industry. The developed procedure was applied to an actual LCD fabrication facility and improved the performance of an existing material handling system.

Mobile Resource Reliability-based Job Scheduling for Mobile Grid

  • Jang, Sung-Ho;Lee, Jong-Sik
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권1호
    • /
    • pp.83-104
    • /
    • 2011
  • Mobile grid is a combination of grid computing and mobile computing to build grid systems in a wireless mobile environment. The development of network technology is assisting in realizing mobile grid. Mobile grid based on established grid infrastructures needs effective resource management and reliable job scheduling because mobile grid utilizes not only static grid resources but also dynamic grid resources with mobility. However, mobile devices are considered as unavailable resources in traditional grids. Mobile resources should be integrated into existing grid sites. Therefore, this paper presents a mobile grid middleware interconnecting existing grid infrastructures with mobile resources and a mobile service agent installed on the mobile resources. This paper also proposes a mobile resource reliability-based job scheduling model in order to overcome the unreliability of wireless mobile devices and guarantee stable and reliable job processing. In the proposed job scheduling model, the mobile service agent calculates the mobile resource reliability of each resource by using diverse reliability metrics and predicts it. The mobile grid middleware allocated jobs to mobile resources by predicted mobile resource reliability. We implemented a simulation model that simplifies various functions of the proposed job scheduling model by using the DEVS (Discrete Event System Specification) which is the formalism for modeling and analyzing a general system. We also conducted diverse experiments for performance evaluation. Experimental results demonstrate that the proposed model can assist in improving the performance of mobile grid in comparison with existing job scheduling models.

유전 알고리즘을 이용한 클라우드 환경의 인공지능 워크로드 스케줄링 (Scheduling of Artificial Intelligence Workloads in Could Environments Using Genetic Algorithms)

  • 권석민;반효경
    • 한국인터넷방송통신학회논문지
    • /
    • 제24권3호
    • /
    • pp.63-67
    • /
    • 2024
  • 최근 스마트 물류, 핀테크, 엔터테인먼트 등 다양한 산업 분야의 인공지능 워크로드들이 클라우드 상에서 실행되고 있다. 본 논문은 이기종 GPU 클러스터로 구성된 다중 테넌트 클라우드 시스템에서 다양한 인공지능 워크로드가 실행될 때 발생하는 스케줄링 문제를 다룬다. 전통적인 스케줄링은 이러한 환경에서 GPU 이용률을 크게 저하시켜 시스템의 성능을 떨어뜨린다. 이러한 문제를 해결하기 위해, 본 논문에서는 유전 알고리즘 기반의 최적화 기법을 사용하는 새로운 스케줄링 접근 방식을 제안하고, 이를 프로세스 기반 이벤트 시뮬레이션 프레임워크에 구현하였다. 알리바바의 MLaaS 클러스터에서 수집한 광범위한 인공지능 작업들의 트레이스를 재현하는 실험을 통해 제안하는 스케줄링이 기존 스케줄링에 비해 GPU 이용률을 크게 개선함을 확인하였다.

조선소 옥외 물류의 이산 사건 시뮬레이션에 관한 연구 (A Study on Discrete Event Simulation of Shipyard Outdoor Block Movement)

  • 이춘재;이장현;우종훈;신종계;유철호
    • 대한조선학회논문집
    • /
    • 제44권6호
    • /
    • pp.647-656
    • /
    • 2007
  • Simulation model of outdoor block movement of shipyard is implemented in this paper. The load of the outdoor workshops in a shipyard influences a mid-term planning and scheduling of the shipyard. Since the load analysis is expected in advance before confirming the planning and scheduling, a discrete event simulation (DES) may be a good solution. The accuracy of DES is up to the accurate modeling of Products, Processes, and Resources (PPR) included in a system. PPR in the outdoor system are clearly defined and the simulation model for the outdoor logistics is implemented by modeling the selective PPR with the help of a DES tool which is programmable by users. The simulation model is verified by comparing the results with the real shipyard data. The outputs through the simulation are discussed.

확률적 자원제약 스케줄링 문제 해결을 위한 가변 이웃탐색 기반 동적 의사결정 (Dynamic Decisions using Variable Neighborhood Search for Stochastic Resource-Constrained Project Scheduling Problem)

  • 임동순
    • 대한산업공학회지
    • /
    • 제43권1호
    • /
    • pp.1-11
    • /
    • 2017
  • Stochastic resource-constrained project scheduling problem is an extension of resource-constrained project scheduling problem such that activity duration has stochastic nature. In real situation where activity duration is not known until the activity is finished, open-loop based static policies such as activity-based policy and priority-based policy will not well cope with duration variability. Then, a dynamic policy based on closed-loop decision making will be regarded as an alternative toward achievement of minimal makespan. In this study, a dynamic policy designed to select activities to start at each decision time point is illustrated. The performance of static and dynamic policies based on variable neighborhood search is evaluated under the discrete-event simulation environment. Experiments with J120 sets in PSPLIB and several probability distributions of activity duration show that the dynamic policy is superior to static policies. Even when the variability is high, the dynamic policy provides stable and good solutions.

Stochastic Project Scheduling Simulation System (SPSS III)

  • Lee Dong-Eun
    • 한국건설관리학회논문집
    • /
    • 제6권1호
    • /
    • pp.73-79
    • /
    • 2005
  • This paper, introduces a Stochastic Project Scheduling Simulation system (SPSS III) developed by the author to predict a project completion probability in a certain time. The system integrates deterministic CPM, probabilistic PERT, and stochastic Discrete Event Simulation (DES) scheduling methods into one system. It implements automated statistical analysis methods for computing the minimum number of simulation runs, the significance of the difference between independent simulations, and the confidence interval for the mean project duration as well as sensitivity analysis method in What-if analyzer component. The SPSS 111 gives the several benefits to researchers in that it (1) complements PERT and Monte Carlo simulation by using stochastic activity durations via a web based JAVA simulation over the Internet, (2) provides a way to model a project network having different probability distribution functions, (3) implements statistical analyses method which enable to produce a reliable prediction of the probability of completing a project in a specified time, and (4) allows researchers to compare the outcome of CPM, PERT and DES under different variability or skewness in the activity duration data.

다중 무인운반차량 시스템에서의 동적 라우팅과 스케줄링 (Dynamic Routing and Scheduling of Multiple AGV System)

  • 이상훈
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 1999년도 추계학술대회 논문집
    • /
    • pp.100-107
    • /
    • 1999
  • 무인 운반차량 시스템 (AGV System) 의 이용도가 날로 증가함에 따라 시스템의 최적화 및 운영 방법에 관한 많은 연구가 진행되고 있다. 이에 본 연구에서는 AGV System에서 사용하는 Routing 및 Scheduling 정책들을 연구하고 이를 개선할 수 있는 새로운 방안을 모색한 후, 컴퓨터 모델링 기법을 이용한 보다 객관적인 시뮬레이션을 수행하여 최적의 AGV System과 그에 적합한 운영 정책을 제시하는데 그 목적이 있다. 따라서 본 논문은 크게 AGV Routing 과 Scheduling에 관한 연구로 나누어진다. AGV Routing은 AGV의 이동경로를 설정하는 것으로서 충돌 방지 (Collision Avoidance)와 최단경로 탐색 (Minimal Cost Path Find) 이라는 두 개의 주요 알고리즘으로 이루어진다. AGV Scheduling 은 장비의 공정시간과 AGV의 Loading/Unloading, Charging 시간으로 인해 불규칙한 Event 가 일어났을 경우 AGV 각각의 Jop을 알맞게 선정해주는 정책을 말하며 일반적으로 AGV Selection Rule, Charging Rule이 여기에 속한다. 본 연구에서는 이러한 알고리즘들이 반영된 AGV System을 컴퓨터 모델로 구축하여, 기존 시스템에서 사용되고 있는 여러 운영 정책들의 문제점들을 분석하였으며, Multiple AGV System을 최적화 시키는 운영 정책이 보다 객관적으로 제시되었다.

  • PDF