• 제목/요약/키워드: simulation based scheduling

검색결과 606건 처리시간 0.028초

계산 그리드를 위한 서비스 예측 기반의 작업 스케줄링 모델 (Service Prediction-Based Job Scheduling Model for Computational Grid)

  • 장성호;이종식
    • 한국시뮬레이션학회논문지
    • /
    • 제14권3호
    • /
    • pp.91-100
    • /
    • 2005
  • Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes a service prediction-based job scheduling model and present its scheduling algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts the next processing time of each processing component and distributes a job to a processing component with minimum processing time. This paper implements the job scheduling model on the DEVS modeling and simulation environment and evaluates its efficiency and reliability. Empirical results, which are compared to conventional scheduling policies, show the usefulness of service prediction-based job scheduling.

  • PDF

계산 그리드를 위한 서비스 예측 기반의 작업 스케쥴링 모델 (Service Prediction-Based Job Scheduling Model for Computational Grid)

  • 장성호;이종식
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 2005년도 춘계학술대회 논문집
    • /
    • pp.29-33
    • /
    • 2005
  • Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes the service prediction-based job scheduling model and present its algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts a processing time of each processing component and distributes a job to processing component with minimum processing time. This paper implements the job scheduling model on the DEVSJAVA modeling and simulation environment and simulates with a case study to evaluate its efficiency and reliability Empirical results, which are compared to the conventional scheduling policies such as the random scheduling and the round-robin scheduling, show the usefulness of service prediction-based job scheduling.

  • PDF

Integration of process planning and scheduling using simulation based genetic algorithms

  • Min, Sung-Han;Lee, Hong-Chul
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 1998년도 추계학술대회 및 정기총회
    • /
    • pp.199-203
    • /
    • 1998
  • Process planning and scheduling are traditionally regarded as separate tasks performed sequentially. But if two tasks are performed concurrently, greater performance can be achieved. In this study, we propose new approach to integration of process planning and scheduling. We propose new process planning combinations selection method using simulation based genetic algorithms. Computational experiments show that proposed method yield better performance when compared with existing methods.

  • PDF

IMPROVING THE USABILITY OF STOCHASTIC SIMULATION BASED SCHEDULING SYSTEM

  • Tae-Hyun Bae;Ryul-Hee Kim;Kyu-Yeol Song;Dong-Eun Lee
    • 국제학술발표논문집
    • /
    • The 3th International Conference on Construction Engineering and Project Management
    • /
    • pp.393-399
    • /
    • 2009
  • This paper introduces an automated tool named Advanced Stochastic Schedule Simulation System (AS4). The system automatically integrates CPM schedule data exported from Primavera Project Planner (P3) and historical activity duration data obtained from a project data warehouse, computes the best fit probability distribution functions (PDFs) of historical activity durations, assigns the PDFs identified to respective activities, computes the optimum number of simulation runs, simulates the schedule network for the optimum number of simulation runs, and estimates the best fit PDF of project completion times (PCTs). AS4 improves the reliability of simulation-based scheduling by effectively dealing with the uncertainties of the activities' durations, increases the usability of the schedule data obtained from commercial CPM software, and effectively handles the variability of the PCTs by finding the best fit PDF of PCTs. It is designed as an easy-to-use computer tool programmed in MATLAB. AS4 encourages the use of simulation-based scheduling because it is simple to use, it simplifies the tedious and burdensome process involved in finding the PDFs of the many activities' durations and in assigning the PDFs to the many activities of a new network under modeling, and it does away with the normality assumptions used by most simulation-based scheduling systems in modeling PCTs.

  • PDF

조선 선체 생산설계 일정 계획을 위한 상세 이산사건 모델링기반 비즈니스 프로세스 시뮬레이션 (High-level Discrete-event Modeling-based Business Process Simulation for the Scheduling of the Ship Hull Production Design)

  • 손명조;김태완
    • 한국CDE학회논문집
    • /
    • 제18권3호
    • /
    • pp.224-233
    • /
    • 2013
  • For the scheduling and the job assignment of the ship hull production design which is a process-based work, we suggest the simulation-based scheduling using the discrete-event-based business process simulation. First, we analyze the ship hull production design process from the perspective of a job assignment to make it into the simulation model using DEVS (Discrete Event System Specification) which is the representative modeling method for a discrete-event simulation. Based on the APIs of the open-source discrete-event simulation engine, we implement the simulation using the Groovy script. We develop the scenario generator in which the user defines detail information of the construction drawing and its member blocks, and design engineers information, and the various setting for the simulation including the job assignment strategy. We use the XML files from this scenario generator as inputs of simulation so that we can get simulation result in forms of Gantt chart without changes of the simulation model.

Event-Driven Real-Time Simulation Based On The RM Scheduling and Lock-free Shared Objects

  • Park, Hyun Kyoo
    • 한국국방경영분석학회지
    • /
    • 제25권1호
    • /
    • pp.199-214
    • /
    • 1999
  • The Constructive Battle Simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under real-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. Conventionally, scheduling and resource allocation activities which have timing constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rate monotonic scheduling.

  • PDF

이산적 시뮬레이션 모델을 이용한 생산 스케쥴 (APPLICATION OF DISCRETE EVENT SIMULATION TO PRODUCTION SCHEDULING)

  • 박영홍
    • 한국시뮬레이션학회논문지
    • /
    • 제10권1호
    • /
    • pp.1-12
    • /
    • 2001
  • This article describes the application of discrete event simulation in a process industry (coffee manufacturing) as a daily production-scheduling tool. A large number of end products (around 300), sporadic demand, and limited shelf life of coffee (90 days) make it difficult to generate feasible production schedules manually. To solve this problem, an integrated system was developed incorporating discrete event simulation methodology into scheduling process. The integrated system is comprised of two components: a scheduling program and a simulation model. The scheduling program is used to generate daily schedules for roasting, grinding, and packing coffee. The simulation model uses the generated schedules to simulate the production of coffee and regenerates a modified production schedule. In this paper, each of the components will be described in detail, evaluated in terms of performance factors, and validated with a set of real production data. Although this article focuses on a specific system, we will share our experiences and Intuitions gained and encourage other process industries to develop simulation-based scheduling tools.

  • PDF

주문 생산 방식을 따르는 혼합 흐름 공정에서의일정계획에 관한 연구 (Scheduling Methods for a Hybrid Flowshopwith Dynamic Order Arrival)

  • 이근철
    • 대한산업공학회지
    • /
    • 제32권4호
    • /
    • pp.373-381
    • /
    • 2006
  • This paper considers a scheduling problem for a hybrid flowshop with dynamic order arrival. A hybrid flowshop is an extended form of a flowshop, which has serial stages like a flowshop but there can be more than one machine at each stage. In this paper, we propose a new method for the problem of scheduling with the objective of minimizing mean tardiness of orders which arrive at the shop dynamically. The proposed method is based on the list scheduling approach, however we use a more sophisticated method to prioritize lots unlike dispatching rule-based methods. To evaluate the performance of the proposed method, a simulation model of a hybrid flowshop-type production system is constructed. We implement well-known dispatching rules and the proposed methods in the simulation model. From a series of simulation tests, we show that the proposed methods perform better than other methods.

시뮬레이션을 이용한 치과의원의 예약정책과 스케줄링 규칙 평가 (Evaluation of Appointment Policy and Scheduling Rule for a Dental Clinic Based on Computer Simulation)

  • 이종기;김명기;하병현
    • 한국병원경영학회지
    • /
    • 제16권4호
    • /
    • pp.161-182
    • /
    • 2011
  • In today's competitive dental markets, it is of paramount importance to improve service quality and at the same time to use scarce resource efficiently. In this study, we present appointment policies and scheduling rules for private dental clinics to reduce the waiting time of patients and to increase the revenue by utilizing resource more effectively. This study validates the proposed appointment policies and scheduling rules based on simulation models. We show that the bottleneck-based appointment policy is the most effective among appointment policies, followed by the multiple-block appointment one. The shortest processing time among scheduling rules contributes most to the performance of the appointment system.

  • PDF

WGridSP: 그리드 컴퓨팅을 위한 웹 기반 스케줄링 플랫폼 (WGridSP: A Web-based Scheduling Platform for Grid Computing)

  • 강오한;강상성
    • 정보처리학회논문지A
    • /
    • 제13A권5호
    • /
    • pp.381-386
    • /
    • 2006
  • 본 논문에서는 웹 기반의 그리드 컴퓨팅 환경에서 시스템을 모델링하고 스케줄링 기법을 시뮬레이션 할 수 있는 그리드 스케줄링 플랫폼을 설계하고 구현하였다. 구현한 웹기반 그리드 스케줄링 플랫폼은 자바 환경의 그리드 스케줄링 툴킷인 GridSim을 시뮬레이션 도구로 활용하였으며, 자원 모델링, 작업 모델링, 알고리즘 컴파일, 시뮬레이션, 성능분석을 웹 환경에서 빠르게 수행할 수 있다. 구축한 스케줄링 플랫폼은 향후 그리드 연구에 기반구조로 활용될 수 있으며, 스케줄링 기법의 성능 분석을 위한 도구로 사용될 수 있다.