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

검색결과 2,161건 처리시간 0.027초

승용디젤엔진의 공연비 제어 알고리즘을 위한 모델기반 게인 스케줄링 전략에 대한 연구 (Model-based Gain Scheduling Strategy for Air-to-fuel Ratio Control Algorithm of Passenger Car Diesel Engines)

  • 박인석;홍승우;선우명호
    • 한국자동차공학회논문집
    • /
    • 제23권1호
    • /
    • pp.56-64
    • /
    • 2015
  • This study presents a model-based gain scheduling strategy for PI-based EGR controllers. The air-to-fuel ratio is used as an indirect measurement of the EGR rate. In order to cope with the nonlinearity and parameter varying characteristics of the EGR system, we proposed a static gain model of the EGR system using a new scheduling parameter. With the 810 steady-state measurements, the static gain model achieved 0.94 of R-squared value. Based on the static gain of the EGR system, the PI gains were robustly designed using quantitative feedback theory. Consequently, the gains of the PI controller are scheduled according to the static gain parameter of the EGR path in runtime. The proposed model-based gain scheduling strategy was validated through various operating conditions of engine experiments such as setpoint step responses and disturbance rejections.

FAB-Wide 스케줄링을 통한 반도체 연구라인의 운용 최적화 (The Operational Optimization of Semiconductor Research and Development Fabs by FAB-wide Scheduling)

  • 김영호;이지형;선동석
    • 전기학회논문지
    • /
    • 제57권4호
    • /
    • pp.692-699
    • /
    • 2008
  • Semiconductor research and development(R&D) fabs are very different than production fabs in many ways such as the scales of production, job priority, production methods, and performance measures. Efficient operations of R&D fabs are very important to the development of new product, process stability, high yield, and ultimately company competitiveness. This paper proposes the fab-wide scheduling method for operational optimization of the R&D fabs. Most scheduling systems of semiconductor fabs have only focused on maximizing throughput of each separated areas without considering WIP(works in process) flows of entire fab. In this paper, we proposes the a fab-wide scheduling system which schedules all lots to entire fab equipment at once. We develop the MIP(mixed integer programing) model which allocates the lots to production equipment considering many constraints of all processes and the CP(constraint programming) model which determines the sequences of the lots in the production equipment. The proposed FAB-wide scheduling model is applied to the newly constructed R&D fab. As a result, we have accomplished the system based automated job reservation, decrease of the hot lot delay, increase of the queue time satisfaction, the high throughput by maximizing the batch sizes, decrease of the WIP TAT(Turn Around Time).

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

복수 DBR 기법을 이용한 PCB 생산라인의 효율적인 생산계획 시스템 개발 (Development of an Effective Manufacturing Scheduling System for PCB Manufacturing Line Using Dual DBR Method)

  • 요시다 아쯔노리;박정현
    • 한국산학기술학회논문지
    • /
    • 제10권10호
    • /
    • pp.2935-2944
    • /
    • 2009
  • 중소 PCB 제조업체에서는 외부 생산 환경 변화, 복수개의 제약공정, 많은 공정수, 긴 리드타임, 동일공정 반복생산 등의 특징으로 인하여 효과적인 생산 스케쥴 작성에 많은 어려움을 겪고 있다. 최근 TOC 이론에서 제시하고 있는 DBR기법을 PCB 생산라인에 적용하고자 하는 시도는 진행되고 있으나, 제약공정을 1개만 설정하도록 하는 일반적인 DBR로서는 PCB 생산라인의 특성상 충분한 효과를 기대할 수 없는 현실이다. 따라서 본 논문에서는 PCB 생산라인에서 효과적인 생산스케줄링을 수립하기 위하여 TOC의 DBR기법을 발전시킨 복수 DBR기법을 제시하였다. 또, 실제로 국내 중소 PCB 제조업체에 복수 DBR을 적용하여 제조 리드타임을 20%이상 단축함을 확인하였다.

변합기 공정 개선을 위한 APS(Advanced Planning & Scheduling) 프로세스 설계에 관한 연구 (A Study on the Process Design of Advanced Planning & Scheduling for Transformer Operation Improvement)

  • 황덕형;남승돈;조용욱;오선일;나승훈;강경식
    • 대한안전경영과학회지
    • /
    • 제14권2호
    • /
    • pp.159-166
    • /
    • 2012
  • As enterprises, based on the forecast of the customer's demand and collaboration with the suppliers, establish the integrated system directing supply, production, and distribution for the increase of productivity, Thus, this study intends to find the most urgent and critical factors for the improvement of the information system by externalizing factors affecting the operation of information system, suggest the process to improve the relevant functions of information system, and design the process. As a result of the analysis of the previous studies on the improvement of the information system, many studies were conducted on the improvement of ERP and SCM, yet there was no study conducted targeting about APS (Advanced Planning & Scheduling). Thus, this study chose APS as the subject for the design of the process for the improvement for the information system.

전이중 셀룰라 네트워크에서 아웃티지 최소화를 위한 신호 품질과 사용자간 간섭량 기반의 사용자 스케쥴링 알고리즘 (User Scheduling Algorithm Based on Signal Quality and Inter-User Interference for Outage Minimization in Full-Duplex Cellular Networks)

  • 최현호
    • 한국정보통신학회논문지
    • /
    • 제19권11호
    • /
    • pp.2576-2583
    • /
    • 2015
  • 전이중(full-duplex) 셀룰라 네트워크에서 상향링크 사용자는 하향링크 사용자에게 간섭을 유발하므로 같은 무선 자원을 동시에 사용하는 상 하향링크 사용자 쌍을 어떻게 결정하는 지가 시스템 성능에 큰 영향을 미친다. 본 논문에서는 사용자의 서비스의 질을 보장하기 위한 목적으로 아웃티지(outage) 발생의 최소화를 위한 최적화 문제를 제시하고, 낮은 복잡도를 갖는 차선의 사용자 스케쥴링 알고리즘을 제안한다. 제안하는 스케쥴링 방식은 나쁜 신호 품질을 갖는 하향링크 사용자에게 간섭을 덜 미치는 상향링크 사용자를 먼저 선택할 수 있도록 우선권을 주는 방식으로 동작한다. 시뮬레이션 결과 제안하는 사용자 스케쥴링 방식을 사용하는 전이중 시스템은 최적에 가까운 아웃티지 성능을 달성하면서 기존 반이중 모드의 셀룰라 시스템 대비 아웃티지 발생을 현저히 줄인다.

CAN을 이용한 차체 네트웍 시스템에 대한 Holistic 스케줄링 해석 (Holistic Scheduling Analysis of a CAN based Body Network System)

  • 신민석;이우택;선우명호
    • 한국자동차공학회논문집
    • /
    • 제10권5호
    • /
    • pp.114-120
    • /
    • 2002
  • In a distributed real-time control system, it is essential to confirm the timing behavior of all tasks because these tasks of each real-time controller have to finish their processes within the specified time intervals called a deadline. In order to satisfy this objective, the timing analysis of a distributed real-time system such as shcedulability test must be performed during the system design phase. In this study, a simple application of CAN fur a vehicle body network system is formulated to apply to a holistic scheduling analysis, and the worst-case execution time (WCET) and the worst-case end-to-end response time (WCRT) are evaluated in the point of holistic system view.

A Note on the Reversibility of the Two Stage Assembly Scheduling Problem

  • Yoon, Sang-Hum;Lee, Ik-Sun;Sung, Chang-Sup
    • Management Science and Financial Engineering
    • /
    • 제13권1호
    • /
    • pp.25-34
    • /
    • 2007
  • This paper is concerned with proving a conjecture that the two stage assembly system is reversible in deterministic makespan scheduling context. The reversibility means that a job sequence in the assembly system has the same makespan as that of its reverse sequence in the disassembly system which is the reversal of the assembly system. The proposed conjecture shows that the reversibility of serial flowshops can be extended to non-serial and synchronized shops.

HTTP 클라이언트/서버에 기반한 스케쥴링 비서 에이젼트 시스템의 설계 및 구현 (Design and Implementation of a Scheduling Secretary Agent System Based on HTTP Client/Server Mechanism)

  • 박창현;정호열
    • 한국정보처리학회논문지
    • /
    • 제7권3호
    • /
    • pp.862-870
    • /
    • 2000
  • Recently, according to the rapid development of internet and communication technologies, a lot of works based on network techniques have been developed. In relation to this trend, the agent systems that had been studied in the early AI have been being studied greatly in association with the network techniques. This paper present a design model of a secretary agent system in which each secretary agent can manage the schedules of her/his superior, and the descriptions about the implementation of the secretary agent system. In the presented secretary agent system, a database system and a knowledge-based systems are included and cooperated with each secretary agent to provide the ability of manipulating lots of schedule data and making decisions on them. This paper also shows that the presented secretary agent system can behavior like a real secretary through the various superior-secretary-meeting-requester interactions, which is different from the roup scheduling programs or personal scheduling programs.

  • PDF

분산 이기종 시스템에서 리스트 스케줄링 알고리즘을 위한 새로운 프로세서 할당 정책 (A Novel Processor Allocation Policy for List Scheduling in Distributed Heterogeneous Computing System)

  • 윤완오;송인성;윤준철;최상방
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제37권2호
    • /
    • pp.76-89
    • /
    • 2010
  • 분산 이기종 시스템의 성능은 DAG로 주어지는 입력 그래프를 스케줄링 하는 알고리즘의 성능에 좌우된다. 많은 스케줄링 알고리즘 중에 리스트 스케줄링 알고리즘은 낮은 복잡도를 가지면서 우수한 성능을 보이고 있다. 리스트 스케줄링은 태스크 우선순위 결정 단계와 프로세서 할당 단계로 이루어져 있으나 대부분의 연구들은 태스크 우선순위 결정 단계만을 연구하고 있다. 본 논문에서는 기존의 할당 정책과 동일한 복잡도를 가지면서 성능이 향상된 새로운 프로세서 할당 정책인 LIP 정책을 제안한다. 기존의 리스트 스케줄링 알고리즘인 HEFT, HCPT, GCA, PETS의 태스크 우선순위 결정 정책에 본 논문에서 제안한 LIP 정책을 적용하여 실험한 결과 기존의 프로세서 할당 정책인 삽입 정책과 비 삽입 정책보다 성능 향상이 있는 것을 확인할 수 있었다.