• Title/Summary/Keyword: 스케쥴

Search Result 159, Processing Time 0.023 seconds

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

  • 박영홍
    • Journal of the Korea Society for Simulation
    • /
    • v.10 no.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

Development of Rollgap Simulator and Its Application to Draft Schedule Adjustment (롤갭 시뮬레이터의 개발과 패스스케쥴 개선)

  • Ahn Jaehwan;Lee Youngho;Lee In-Woo
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2004.08a
    • /
    • pp.163-172
    • /
    • 2004
  • A fast, accurate model for calculating roll gap variables are critical to the implementation of computer based automation systems for cold rolling mills. Based on the work of Fleck and Johnson, rollgap simulator with non-circular arc model was developed using the influence function. This developed model is capable of predicting values of force, torque and slip which can be applied over the wide range of rolling conditions including cold rolling/DR/temper mill with high execution speed. Friction coefficient was obtained as a function of operation conditions through analyzing measured data. After combination of rollgap simulator with production strategy, draft schedule for No.3 RCM (Reversible Cold Rolling Mill) in Incheon works of Dongbu Steel was developed. This draft schedule will be installed in the setup computer of No.3 RCM replacing old Hitachi model.

  • PDF

Multi-agent System for Education Course Scheduling of Learner-oriented using Weakness Analysis Algorithm (취약성 분석 알고리즘을 이용한 학습자 중심의 교육 코스 스케쥴링 멀티 에이전트 시스템)

  • 김태석;이종희;이근왕;오해석
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.646-648
    • /
    • 2001
  • 전자도서관과 LOD 기술을 접목한 웹기반 교육 시스템의 연구는 몇 년 동안 활발히 진행되어 왔다. 특히, 멀티미디어 기술 및 컴퓨터 통신 기술 개발의 가속화 및 이을 응용한 컨텐츠 개발에 촉진제 역할을 하게된 웹의 탄생은 교수-학습 활동에서의 교육형태로 인식할 수 있는 전환점을 제공하게 되었고, 웹을 기반으로 한 교육(WBI: Web-Based Instruction)이라는 새로운 교수 모형이 제시되기에 이르렀다. 또한, 최근에 학습자의 요구에 맞는 코스웨어 주문이 증가되고 있는 추세이며 그에 따라 웹 기반 교육 시스템의 효율적이고 자동화된 교율 에이전트의 필요성이 인식되어 있다. 그러나 현재 연구되고 있는 많은 교육 시스템들은 학습자 성향에 맞는 코스를 적절히 서비스 해지 못할 뿐 아니라 지속적인 피드백과 학습자가 코스를 학습함에 있어서 취약한 부분을 재학습 할 수 있도록 도와주는 서비스를 제공하지 못하고 있다. 본 논문에서는 학습자의 학습 모니터링과 지속적인 학습평가에 의하여 개인 학습자의 학습 성취도를 계산하여 학습자에게 적합한 코스 스케쥴을 제공해 주는 코스 스케쥴링 멀티 에이전트를 제안하고자 한다.

  • PDF

Mechanism of Course Scheduling of Learner-Oriented Using Weakness Analysis Algorithm (취약성 분석 알고리즘을 이용한 학습자 중심의 코스 스케줄링 기법)

  • Lee, Gi-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.11
    • /
    • pp.3241-3245
    • /
    • 2009
  • In this paper we propose mechanism for course scheduling of learner-oriented using weakness analysis algorithm. The proposed mechanism monitors learner's behaviors constantly evaluates them and calculates his accomplishment. From this accomplishment the schedules the suitable course for the learner. The learner achieves an active and complete learning from the repeated and suitable course.

The Development of the Simulation Input Library (시뮬레이션 입력값 라이브러리 구축)

  • Kang, Su-Hyun;Yu, Ji-Suck;Baek, Seung-Hyo;Cho, Young-Hum;Kim, Kwang-Woo
    • 한국태양에너지학회:학술대회논문집
    • /
    • 2011.04a
    • /
    • pp.287-292
    • /
    • 2011
  • It has found that the using library base on criteria of a foreign country resulted in problem of reliability. In order to obtain reliable result, it was necessary to develop the simulation input library based on domestic condition. So, this study was conducted for making the library in accordance with domestic condition when doing simulation modeling about the exist and new buildings. The range of library were consist of material, facility systems, schedules and weather data. And Energy Plus program was used when making library. We hope that the developed library will contribute to reliability when simulating exist and new buildings.

  • PDF

An RPC Scheduling Scheme over Dual Non-Real-Time Connection Structure (이중 비실시간 연결구조 상에서의 실시간 RPC 스케쥴링 기법)

  • Lee, Jeong-Hun;Park, Jae-U;Cheon, Won-Gi
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.1
    • /
    • pp.37-44
    • /
    • 2001
  • 본논문은 이중의 비실시간 네트워크 상에서의 실시간 원격 프로시쥬어 호출(RPC)을 위한 메시지 스케쥴링 기법을 제안하고 평가한다. 제안된 기법은 시간제약 조건을 고려한 메시지 스케쥴에 의해 RPC 트랜잭션의 종료시한 만족도를 향상시키기 위하여 각 네트워크에 메시지 분배 비율을 달리함으로써 부하를 차별화하고 종료시한이 촉박한 메시지는 낮은 부하의 네트워크를 통해 전송한다. 생성 간격 시간 서버실행시간 여유시간 등과 같은 네트워크 인자를 기반으로 SMPL에 의해 수행된 모의실험 결과는 적절한 분할 기준치를 설정했을 때 제안된 기법이 실시간 RPC의 성능을 향상시킬수 있으며 분할 기준치는 통계적 모델에 의해 효율적으로 찾아질수 있음을 보인다.

  • PDF

Improvement of time complexity of Hardware-Software partitioning algorithm using FDS (FDS 응용에 의한 하드웨어 소프트웨어 분할 알고리즘의 시간 복잡도 개선)

  • 오주영;박효선;박도순
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.24-26
    • /
    • 2000
  • 본 논문에서는 FDS를 응용한 하드웨어 분할 방법을 강 제약 조건을 만족하면서 FDS를 응용하는 방법보다 낮은 복잡도의 분할 알고리즘을 제안한다. 기존의 FDS 응용 방법은 힘값 계산에서 종속성에 의해 후위 연산이 받는 영향값을 계산하여야 하므로 이로 인한 시간 복잡도가 가중되었다. 본 논문에서는 이러한 복잡도를 저하시키기 위해 노드의 분포 그래프와 구현에 소요되는 비용, 그리고 해당 파티션에서의 실행시간 등에 의해 상대적 긴박도를 정의하여 분할을 수행하지만, 종속성 검사는 종속성 제약조건에 의한 분포그래프의 변화와 스케쥴에 대해서만 고려되며 힘값 계산에는 고려하지 않는다. 또한, 분할 단계에서 스케쥴링을 함께 고려함으로써 합성 이후에 재 스케쥴링의 부하를 경감할 수 있도록 하였다. 제안 알고리즘 결과는 ILP 결과와 비교 분석하였다.

  • PDF

hierarchical Control and Intelligent Scheduling of Flexible Manufacturing Cell (유연 생산셀의 계층적 제어와 지능형 스케쥴)

  • 서기성;이노성;안인석;박승규;우광방
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.43 no.3
    • /
    • pp.492-503
    • /
    • 1994
  • In this study, the control and scheduling of the flexible manufacturing cell (FMC) is discussed, which can perform the mixed production and relieve the effect of machine failure. The control of the FMC isvery complex task due to the property of multiple jobs and the dynamically changing states. For effective control of proposed FMC, the hierarchical scheme is introduced and the functions of each levels are defined. Especially for the control functions of shop floor level and cell level, the intelligent scheduler is implemented. To show the efficiency of the intelligent scheduler, the production method fo the existing assembly lines was evaluated and compared with the proposed intelligent FMC method. The results from the production performance show that the proposed method is superior to the existing method in various performance indices.

JOB Scheduling Analysis in FMC using TPN (TPN을 이용한 FMC의 JOB 스케쥴링 분석)

  • 안광수
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.3
    • /
    • pp.13-19
    • /
    • 1999
  • In this paper, we suggests a WIP (Work In Process) of FMC (Flexible Manufacturing Cell) analysis methods based on the TPN (Time Petri Nets) unfolding. Unfolding of PN is a partial order-based method for the verification of concurrent system without the state space explosion. The aim of this work is to formulate the general cyclic state scheduling problem to minimize the WIP to satisfy economical constraints. The method is based on unfolding of the original net into the equivalent acyclic description.

A Bicriterion Scheduling Problems with Time/Cost Trade-offs (시간/비용의 트레이드-오프를 고려한 2목적 스케쥴링 문제)

  • 정용식;강동진
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.4 no.2
    • /
    • pp.81-87
    • /
    • 1999
  • This paper discusses a bicriterion approach to sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach, which produces an efficient flintier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the m allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.

  • PDF