• Title/Summary/Keyword: Schedule Simulation

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

적응형 의사결정 트리와 최단 경로법을 이용한 기계 진단 및 보전 정책 수립 (Machine Diagnosis and Maintenance Policy Generation Using Adaptive Decision Tree and Shortest Path Problem)

  • 백준걸
    • 한국경영과학회지
    • /
    • 제27권2호
    • /
    • pp.33-49
    • /
    • 2002
  • CBM (Condition-Based Maintenance) has increasingly drawn attention in industry because of its many benefits. CBM Problem Is characterized as a state-dependent scheduling model that demands simultaneous maintenance actions, each for an attribute that influences on machine condition. This problem is very hard to solve within conventional Markov decision process framework. In this paper, we present an intelligent machine maintenance scheduler, for which a new incremental decision tree learning method as evolutionary system identification model and shortest path problem as schedule generation model are developed. Although our approach does not guarantee an optimal scheduling policy in mathematical viewpoint, we verified through simulation based experiment that the intelligent scheduler is capable of providing good scheduling policy that can be used in practice.

Schedule communication routing approach to maximize energy efficiency in wireless body sensor networks

  • Kaebeh, Yaeghoobi S.B.;Soni, M.K.;Tyagi, S.S.
    • Smart Structures and Systems
    • /
    • 제21권2호
    • /
    • pp.225-234
    • /
    • 2018
  • E-Health allows you to supersede the central patient wireless healthcare system. Wireless Body Sensor Network (WBSN) is the first phase of the e-Health system. In this paper, we aim to understand e-Health architecture and configuration, and attempt to minimize energy consumption and latency in transmission routing protocols during restrictive latency in data delivery of WBSN phase. The goal is to concentrate on polling protocol to improve and optimize the routing time interval and schedule communication to reduce energy utilization. In this research, two types of network models routing protocols are proposed - elemental and clustering. The elemental model improves efficiency by using a polling protocol, and the clustering model is the extension of the elemental model that Destruct Supervised Decision Tree (DSDT) algorithm has been proposed to solve the time interval conflict transmission. The simulation study verifies that the proposed models deliver better performance than the existing BSN protocol for WBSN.

A Distributed Sequential Link Schedule Combined with Routing in Wireless Mesh Networks

  • Cha, Jae-Ryong;Kim, Jae-Hyun
    • ETRI Journal
    • /
    • 제34권3호
    • /
    • pp.462-465
    • /
    • 2012
  • This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time division multiple access network for performance comparison. From the simulation results, when the average number of hops is 2.02, 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 28%, 10%, 17%, 27%, and 30%, respectively, compared to the conventional random scheduling scheme.

이종 병렬기계를 가진 2단계 혼합흐름생산시스템의 일정계획 (Scheduling Heuristics for a Two-Stage Hybrid Flowshop with Nonidentical Parallel Machines)

  • 이지수;박순혁
    • 대한산업공학회지
    • /
    • 제25권2호
    • /
    • pp.254-265
    • /
    • 1999
  • We consider two stage hybrid flowshop scheduling problem when there are two non-identical parallel machines at the first stage, and only one machine at the second stage. Several well-known sequence-first allocate-second heuristics are considered first. We then propose an allocate-first sequence-second heuristic to find minimum makespan schedule. The effectiveness of the proposed heuristic algorithm in finding a minimum makespan schedule is empirically evaluated by comparing with easily computable lower bound. The proposed heuristic algorithm as well as the existing heuristics are evaluated by simulation in four cases which have different processing time distribution, and it is found that the proposed algorithm is more effective in every case.

  • PDF

Duplication with Task Assignment in Mesh Distributed System

  • Sharma, Rashmi;Nitin, Nitin
    • Journal of Information Processing Systems
    • /
    • 제10권2호
    • /
    • pp.193-214
    • /
    • 2014
  • Load balancing is the major benefit of any distributed system. To facilitate this advantage, task duplication and migration methodologies are employed. As this paper deals with dependent tasks (DAG), we used duplication. Task duplication reduces the overall schedule length of DAG along-with load balancing. This paper proposes a new task duplication algorithm at the time of tasks assignment on various processors. With the intention of conducting proposed algorithm performance computation; simulation has been done on the Netbeans IDE. The mesh topology of a distributed system is simulated at this juncture. For task duplication, overall schedule length of DAG is the main parameter that decides the performance of a proposed duplication algorithm. After obtaining the results we compared our performance with arbitrary task assignment, CAWF and HEFT-TD algorithms. Additionally, we also compared the complexity of the proposed algorithm with the Duplication Based Bottom Up scheduling (DBUS) and Heterogeneous Earliest Finish Time with Task Duplication (HEFT-TD).

사무소 건물의 에너지 소비 요소별 절감률 분석 (Analysis of Saving Rates according to Energy Consumption Factors in Office Building)

  • 박병일;양인호
    • 설비공학논문집
    • /
    • 제28권3호
    • /
    • pp.115-122
    • /
    • 2016
  • In this study, 21 energy reduction factors were selected as architecture, system & operation, and lighting and equipment parts to analyze reduction method of the load occurring in office buildings. Energy consumption simulation was performed. In the architecture part, saving rate (1.53%) of "occupant density" factor was the most efficient. In the system and operation part, saving rate (1.28%) of "interior VAV and exterior FPU type" factor was the most efficient. In case of lighting and equipment part, saving rate (12.42%) of "schedule" factor was the most efficient. In the three parts, saving rate of the lighting and equipment part was 27.32%. This was caused by the "schedule" factor. Saving rates of the architecture part and the system and operation part were 3.39% and 1.20%, respectively.

주거건물의 냉방 부하 패턴에 따른 구체축열시스템 운전 방안 (Operating Mode of Thermally Activated Building System (TABS) for Residential Buildings According to their Cooling Load Profile)

  • 박상훈;여명석;유미혜;이유지;정웅준;김광우
    • 한국주거학회논문집
    • /
    • 제23권2호
    • /
    • pp.99-106
    • /
    • 2012
  • Compared to Packaged Terminal Air Conditioning Systems, Radiant Cooling Systems have the advantage of energy saving and thermal comfort. Thermally Activated Building System (TABS) is one of the radiant heating and cooling systems. The main difference between TABS and other radiant systems lies in the usage of the time-lag effect of storing heat energy in the concrete. Current energy usage in summer time is concentrated within a specific time by using Packaged Terminal Air-Conditioner (PTAC). Due to the time-lag effect of TABS, energy usage can be distributed to other time zones. To maximize this effect, it is important to determine the appropriate operating mode, which for TABS is dependent upon the cooling load generated by the occupancy schedule. In this study, occupancy schedules are determined for various residential types. The operating modes of TABS for these residential types are estimated by using a dynamic computational simulation method. The results indicate that the operating modes of TABS can be determined by residential type and occupancy schedule. The load handled ratio by TABS is set up differently according to the cooling load profile obtained from residential type and occupancy schedule. By using TABS, energy consumption could be reduced by 20% compared to PTAC.

Tiered-MAC: 무선 센서 네트워크를 위한 에너지 효율적인 하이브리드 MAC 프로토콜 (Tiered-MAC: An Energy-Efficient Hybrid MAC Protocol for Wireless Sensor Networks)

  • 이한선;정광수
    • 한국정보과학회논문지:정보통신
    • /
    • 제37권1호
    • /
    • pp.42-49
    • /
    • 2010
  • 무선 센서 네트워크에서의 센서 노드는 일반적으로 교체 불가능한 배터리를 전원으로 사용하기 때문에 에너지 효율적인 통신 프로토콜 개발이 가장 중요한 이슈이다. 무선 센서네트워크에서 에너지 효율적인 MAC 프로토콜은 무선 매체의 공유 방식에 따라 주로 경쟁 기반 흑은 스케줄 기반으로 나눌 수 있다. 하지만 경쟁 기반 프로토콜과 스케줄 기반 프로토콜은 상반된 특징을 갖기 때문에 두 가지 프로토콜을 혼합해서 사용할 경우 보다 좋은 성능을 발휘할 수 있다. 본 논문에서는 무선 센서 네트워크 환경에서 센서 노드의 에너지 소모를 줄이고 네트워크의 수명을 최대화하기 위해 Tiered-MAC을 제안한다. Tiered-MAC은 싱크 노드와 센서 노드로 구성되는 계층적 센서 네트워크 구조에서 싱크 노드의 최대 전송 영역은 스케줄 기반의 TDMA를 사용하고, 이외의 영역은 경쟁 기반의 CSMA를 사용함으로써 많은 데이터 트래픽이 집중하여 혼잡상황이 잦은 싱크 노드 주변의 송수신을 관리하여 불필요한 에너지 소비를 줄이도록 설계하였다. NS-2 시뮬레이터를 이용한 실험을 통하여 제안하는 기법이 에너지 효율적으로 동작하는 것을 확인하였다.

반고정식 PV 시스템의 운영 스케줄 도출 및 그에 따른 발전 효율 변화 고찰 (Optimal Operation Schedule of Semi-Fixed PV System and Its Effect on PV Power Generation Efficiency)

  • 곽인규;문선혜;허정호
    • 한국태양에너지학회 논문집
    • /
    • 제37권6호
    • /
    • pp.69-77
    • /
    • 2017
  • The amount of solar irradiation obtained by a photovoltaic (PV) solar panel is the major factor determining the power generated by a PV system, and the array tilt angle is critical for maximizing panel radiation acquisition. There are three types of PV systems based on the manner of setting the array tilt angle: fixed, semi-fixed, and tracking systems. A fixed system cannot respond to seasonal solar altitude angle changes, and therefore cannot absorb the maximum available solar radiation. The tracking system continually adjusts the tilt angle to absorb the maximum available radiation, but requires additional cost for equipment, installation, operation, and maintenance. The semi-fixed system is only adjusted periodically (usually seasonally) to obtain more energy than a fixed system at an overall cost that is less than a tracking system. To maximize semi-fixed system efficiency, determining the optimal tilt angle adjustment schedule are required. In this research, we conducted a simulation to derive an optimal operation schedule for a semi-fixed system in Seoul, Korea (latitude $37.5^{\circ}$). We implemented a solar radiation acquisition model and PV genereation model on MATLAB. The optimal operation schedule was derived by changing the number of tilt angle adjustments throughout a year using a Dynamic Algorithm. The results show that adjusting the tilt angle 4 times a year was the most appropriate. and then, generation amount of PV system increased 2.80% compared with the fixed system. This corresponds to 99% compared to daily adjustment model. This increase would be quite valid as the PV system installation area increased.

효율적인 다중 데이타 접근을 위한 방송 스케쥴 생성 (A Broadcast Schedule Generation for Efficient Multiple Data Accesses)

  • 이상돈
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제29권4호
    • /
    • pp.285-296
    • /
    • 2002
  • 이동 컴퓨팅 환경에서 클라이언트가 서버에 요구하는 데이타가 데이타 항목의 집합이라면, 클라이언트 측면에서는 모든 데이타 항목을 얻을 때까지의 소요 시간이 중요하다. 본 논문에서는 클라이언트가 여러 개의 데이타를 한번에 접근하는 환경에서 라이언트가 전체 데이타 항목을 얻는데 소요되는 응답시간을 감소시킬 수 있는 방송 스케줄 생성 기법을 제안한다. 클라이언트에서 요구하는 데이타 항목들이 중복되는 정도에 따라 방송 스케줄에서 데이타 항목들의 상대적인 배치 순서가 중요해지며 클라이언트에서의 데이타 접근 요구가 편중되는 정도에 따라 방송 스케줄 내에서 각 데이타 항목이 방송되는 빈도가 영향을 받는다. 데이타 집합의 중복 정도와 데이타 접근 편중도를 통합적으로 적용함으로써 효과적으로 다중 데이타 접근을 지원하는 계층적 방송 스케줄을 생성하는 기법을 제시하였다. 실험 결과를 통해, 제안 기법이 여러 환경에서 적응적으로 대응하여 기존의 연구 결과에 대해 성능을 개선함을 보였다.