• Title/Summary/Keyword: Event Scheduling

Search Result 106, Processing Time 0.026 seconds

Two-Level Hierarchical Production Planning for a Semiconductor Probing Facility (반도체 프로브 공정에서의 2단계 계층적 생산 계획 방법 연구)

  • Bang, June-Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.4
    • /
    • pp.159-167
    • /
    • 2015
  • We consider a wafer lot transfer/release planning problem from semiconductor wafer fabrication facilities to probing facilities with the objective of minimizing the deviation of workload and total tardiness of customers' orders. Due to the complexity of the considered problem, we propose a two-level hierarchical production planning method for the lot transfer problem between two parallel facilities to obtain an executable production plan and schedule. In the higher level, the solution for the reduced mathematical model with Lagrangian relaxation method can be regarded as a coarse good lot transfer/release plan with daily time bucket, and discrete-event simulation is performed to obtain detailed lot processing schedules at the machines with a priority-rule-based scheduling method and the lot transfer/release plan is evaluated in the lower level. To evaluate the performance of the suggested planning method, we provide computational tests on the problems obtained from a set of real data and additional test scenarios in which the several levels of variations are added in the customers' demands. Results of computational tests showed that the proposed lot transfer/planning architecture generates executable plans within acceptable computational time in the real factories and the total tardiness of orders can be reduced more effectively by using more sophisticated lot transfer methods, such as considering the due date and ready times of lots associated the same order with the mathematical formulation. The proposed method may be implemented for the problem of job assignment in back-end process such as the assignment of chips to be tested from assembly facilities to final test facilities. Also, the proposed method can be improved by considering the sequence dependent setup in the probing facilities.

Knowledge Structures to Simulate the Spatial Behavior of Intelligent Virtual Humans (지능형 가상인간의 공간적 행동을 모사하기 위한 지식구조)

  • Hong, Seung-Wan;Park, Jong-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.20 no.12
    • /
    • pp.230-240
    • /
    • 2020
  • To develop a virtual world-based immersive tutoring system, we would like to develop a simulation in the spatial aspect to maximize the diversity and realism of the situation. This implementation requires the modeling of virtual space as well as the knowledge and intelligent thinking functions of virtual humans. First, information structures are needed to simulate the hierarchical and multifaceted composition of space and the corresponding knowledge of virtual humans. Specifically, four structures for 2.5D spatial distribution expression, complex spatial relationship expression, object expression, and temporal and spatial representation of events are developed respectively. It then uses these expressed knowledge to develop the spatial thinking function of virtual humans needed to make spatial movement. In general, events have a chain effect on adjacent or connected objects through force, resulting in a variety of situations and reflected in the planning of the next action by the virtual humans involved. For this purpose, the development of events according to historical trends is recorded on the representation structure of time and space. It embodies typical events to demonstrate the feasibility of independent behavior in complex spaces among virtual people.

A Simulation-based Genetic Algorithm for a Dispatching Rule in a Flexible Flow Shop with Rework Process (시뮬레이션 기반 유전알고리즘을 이용한 디스패칭 연구: 재작업이 존재하는 유연흐름라인을 대상으로)

  • Gwangheon Lee;Gwanguk Han;Bonggwon Kang;Seonghwan Lee;Soondo Hong
    • The Journal of Bigdata
    • /
    • v.7 no.1
    • /
    • pp.75-87
    • /
    • 2022
  • This study investigates a dynamic flexible flow shop scheduling problem under uncertain rework operations for an automobile pipe production line. We propose a weighted dispatching rule (WDR) based on the multiple dispatching rules to minimize the weighted sum of average flowtime and tardiness. The set of weights in WDR should be carefully determined because it significantly affects the performance measures. We build a discrete-event simulation model and propose a genetic algorithm to optimize the set of weights considering complex and variant operations. The simulation experiments demonstrate that WDR outperforms the baseline dispatching rules in average flowtime and tardiness.

A Prototype of Distributed Simulation for Facility Restoration Operation Analysis through Incorporation of Immediate Damage Assessment

  • Hwang, Sungjoo;Choi, MinJi;Starbuck, Richmond;Lee, SangHyun;Park, Moonseo
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.339-343
    • /
    • 2015
  • To rapidly recover ceased functionality of a facility after a catastrophic seismic event, critical decisions on facility repair works are made within a limited period of time. However, prolonged damage assessment of facilities, due to massive damage in the surrounding region and the complicated damage judgment procedures, may impede restoration planning. To assist reliable structural damage estimation without a deep knowledge and rapid interactive analysis among facility damage and restoration operations during the approximate restoration project planning phase, we developed a prototype of distributed facility restoration simulations through the use of high-level architecture (HLA) (IEEE 1516). The simulation prototype, in which three different simulations (including a seismic data retrieval technique, a structural response simulator, and a restoration simulation module) interact with each other, enables immediate damage estimation by promptly detecting earthquake intensity and the restoration operation analysis according to estimated damage. By conducting case simulations and experiments, research outcomes provide key insights into post-disaster restoration planning, including the extent to which facility damage varies according to disaster severity, facility location, and structures. Additional insights arise regarding the extent to which different facility damage patterns impact a project's performance, especially when facility damage is hard to estimate by observation. In particular, an understanding of required type and amount of repair activities (e.g., demolition works, structural reinforcement, frame installation, or finishing works) is expected to support project managers in approximate work scheduling or resource procurement plans.

  • PDF

User-Level Threads for the ARX Real-Time Operating System (ARX 실시간 운영체계를 위한 사용자 레벨 쓰레드)

  • Seo, Yang-Min;Park, Jung-Keun;Hong, Seong-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.65-67
    • /
    • 1998
  • 내장 실시간 시스템이 높은 우선순위의 비동기적 이벤트를 적시에 처리하면서 필수적으로 적은 비용의 선점 다중쓰레드를 지원해야한다. 사용자 레벨 쓰레드는 커널 레벨 쓰레드 보다 적은 비용의 유연한 추상적 기법들을 제공하지만, 기존의 실시간 시스템에서는 스케줄링과 시그날(signal) 처리가 단순하다는 이류로 커널 레벨 쓰레드가 선호 되어왔다. 본 논문에서는 내장 실시간 시스템에 적합한 새로운 사용자 레벨 다중 쓰레드 방식을 제안한다. 이 기법은 가상 쓰레드(virtual threads)와 개선된 스케줄링 이벤트 업콜(scheduling event upcall) 메카니즘을 기반으로 한다. 가상 쓰레드는 사용자 레벨 쓰레드에게 커널 레벨의 실행 환경을 제공할 수 있도록 사용자 레벨 쓰레드를 커널 레벨로 형상화한 것이다. 이 쓰레드는 필요에 의해 잠시동안 사용자 레벨 쓰레드에 묶이는 소동적인 존재이다. 스케줄링 이벤트 업콜 메카니즘은 쓰레드 블록킹과 타이머 만기와 같은 커널 이벤트를 유저 프로세서에게 전달할 수 있게 한다. 본 논문의 개선된 업콜 방식은 scheduler activation과 시그날과 같은 전통적인 업콜 구조에서 예측하기 힘든 요소들을 배제했다. 순간적인 시스템의 과부하 상황에서도 이벤트를 놓치지 않으면서 커널과 유저 프로세서의 비싼 동기화 작업들을 피할 수 있도록 하는 잠금(lock)이 필요 없는 이벤트 큐를 상용한다. 본 기법은 서울대학교 실시간 운영체계 실험실에서 구현한 ARX위에 완벽하게 구현되었다. ARX 사용자 레벨 쓰레드가 사용자 레벨 쓰레드의 장점을 손상하지 않으면서 솔라리스와 윈도즈98과 같은 상용 운영체제의 커널 쓰레드보다 성능이 우수함을 실험적 비교에 의해서 입증한다.분에서 uronic acid를 분리동정하였을 때 점미는 0.90%, 백미는 0.66%, 흑미는 1.8%로서 흑미에서 uronic acid 함량이 두 배 이상으로 나타났다. 흑미의 uronic acid 함량이 가장 많이 용출된 분획은 sodium hydroxide 부분으로서 hemicellulose구조가 polyuronic acid의 형태인 것으로 사료된다. 추출획분의 구성단당은 여러 곡물연구의 보고와 유사하게 glucose, arabinose, xylose 함량이 대체로 높게 나타났다. 점미가 수가용성분에서 goucose대비 용출함량이 고르게 나타나는 경향을 보였고 흑미는 알칼리가용분에서 glucose가 상당량(0.68%) 포함되고 있음을 보여주었고 arabinose(0.68%), xylose(0.05%)도 다른 종류에 비해서 다량 함유한 것으로 나타났다. 흑미는 총식이섬유 함량이 높고 pectic substances, hemicellulose, uronic acid 함량이 높아서 콜레스테롤 저하 등의 효과가 기대되며 고섬유식품으로서 조리 특성 연구가 필요한 것으로 사료된다.리하였다. 얻어진 소견(所見)은 다음과 같았다. 1. 모년령(母年齡), 임신회수(姙娠回數), 임신기간(姙娠其間), 출산시체중등(出産時體重等)의 제요인(諸要因)은 주산기사망(周産基死亡)에 대(對)하여 통계적(統計的)으로 유의(有意)한 영향을 미치고 있어 $25{\sim}29$세(歲)의 연령군에서, 2번째 임신과 2번째의 출산에서 그리고 만삭의 임신 기간에, 출산시체중(出産時體重) $3.50{\sim}3.99kg$사이의 아이에서 그 주산기사망률(周産基死亡率)이 각각 가장 낮았다. 2. 사산(死産)과 초생

  • PDF

Direction-Embedded Branch Prediction based on the Analysis of Neural Network (신경망의 분석을 통한 방향 정보를 내포하는 분기 예측 기법)

  • Kwak Jong Wook;Kim Ju-Hwan;Jhon Chu Shik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.1
    • /
    • pp.9-26
    • /
    • 2005
  • In the pursuit of ever higher levels of performance, recent computer systems have made use of deep pipeline, dynamic scheduling and multi-issue superscalar processor technologies. In this situations, branch prediction schemes are an essential part of modem microarchitectures because the penalty for a branch misprediction increases as pipelines deepen and the number of instructions issued per cycle increases. In this paper, we propose a novel branch prediction scheme, direction-gshare(d-gshare), to improve the prediction accuracy. At first, we model a neural network with the components that possibly affect the branch prediction accuracy, and analyze the variation of their weights based on the neural network information. Then, we newly add the component that has a high weight value to an original gshare scheme. We simulate our branch prediction scheme using Simple Scalar, a powerful event-driven simulator, and analyze the simulation results. Our results show that, compared to bimodal, two-level adaptive and gshare predictor, direction-gshare predictor(d-gshare. 3) outperforms, without additional hardware costs, by up to 4.1% and 1.5% in average for the default mont of embedded direction, and 11.8% in maximum and 3.7% in average for the optimal one.