• 대한전기학회논문지
• /
• 제41권1호
• /
• pp.9-17
• /
• 1992

Proper resource allocation is also a very important topic in power system problems, especially in operation and planning. One such is optimal maintenance problem in operation and planning. Least cost and highest reliability should be the subjects to be pursued. A probabilistic operation simulation model developed recently by authors is applied to the proboem of optimal maintenance scheduling. Three different methods are compared, marginal maintenance cost, levelized risk and maintenance space. The method by the marginal maintenance costs shows the least cost, the highest reliability and the highest maintenance outage rates. This latter characteristics may considerably influence the results of genetation planning, because the usual maintenance outages obtained from the other methods have shown to be lower.

• 한국건설관리학회논문집
• /
• 제1권3호
• /
• pp.75-80
• /
• 2000

공간의 분할이 많은 건축공사에서는 반복적 특성으로 인해 공정계획상에 다수의 대안이 존재한다. 공사기간은 각 액티비티의 기간뿐 아니라 반복되는 액티비티의 배열방법에 의해서도 많은 영향을 받는다. 본 연구는 각 액티비티에 적정한 선행 액티비티를 할당함으로써 여유시간을 최소화하는 공정계획기법을 제시하는 것을 목적으로 진행되었다. Line of Balance 기법을 기본으로 하는 기존연구와는 달리 본 연구에서는 AON방식의 네트워크 기법을 기본으로 하여 공간과 자원의 두 축 사이에 액티비티를 배열하였다. 각 액티비티별로 자원과 공간의 양방향으로 가장 적절한 선행 액티비티를 검색하여 여유시간을 최소화한다. 본 연구에서 제시한 액티비티 배열방법을 공동주택공사 건설공사를 대상으로 적용한 결과, 액티비티 배열을 달리함에 따라서 다수의 대안이 존재함을 확인할 수 있었으며 그중 적정대안을 찾아낼 수 있었다. 본 기법은 공동주택공사와 같은 다수의 유사공간으로 구성된 건설공사의 공정 계획에 도움을 줄 수 있을 것으로 판단된다.

• 한국정보처리학회논문지
• /
• 제2권1호
• /
• pp.119-129
• /
• 1995

본 논문에서는 분산 실시간 프로그램의 스케줄가능성 분석 방법을 제안한다. 스케 줄가능성 분석을 위한 여러 가지 방법이 개발되었지만, 이 방법들은 가능한 모든 상 태공간을 추적하거나 고정 우선순위 스케줄 방법을 사용했기 때문에 지수적인 시간 과 공간의 복잡성을 야기한다. 따라서 상태 공간을 줄여서 더 이른 시간단위에서 스케 줄가능성을 조사하는 방법이 필요하다. 본 논문에서 제시한 스케줄가능성 분석 방법은 번역시간에 결정될 수 있는 프로세스들의 최대 수행시간, 주기, 마감시간, 동기화 시 간을 고려하여 동기화 동작 이후에 남는 계산시간과 마감시간의 차이를 계산하여 실시 간 프로세스가 마감시간을 지키는가를 판단하는 새로운 알고리즘을 제안하고, 실험을 통하여 그 성능을 평가한다. 실험에 의하여 Fredette의 방법과 비교하면 약 50퍼센트 정도 더 이른 단위시간에 스케줄이 불가능함을 판단할 수 있다.

• 한국정보통신학회논문지
• /
• 제3권1호
• /
• pp.209-221
• /
• 1999

실시간 스케줄가능성 분석을 위한 여러 가지 방법들이 제안되었지만, 이들은 프로세스의 모든 상태공간을 추적하거나 고정 우선 순위 스케줄링 방법을 사용하기 때문에 시간 및 공간에 대한 복잡성의 증가를 야기한다. 따라서 상태공간의 수를 줄임으로써 보다 빠른 시간에 스케줄가능성을 판단하는 방법이 필요하다. 본 논문에서는 프로세스 대수의 전이규칙을 이용하여 번역시간에 결정될 수 있는 프로세스의 최소 수행시간, 주기, 마감시간, 동기화 시간을 고려하여 실시간 프로세스가 마감시간을 지키는가를 판단하는 개선된 알고리즘을 제안 및 구현한다. 구현 결과를 통하여 모든 상태 공간을 검색하지 않고도 스케줄가능성을 판단하는 효과적인 성능을 보였다.

• 한국산학기술학회논문지
• /
• 제10권7호
• /
• pp.1702-1710
• /
• 2009

본 논문은 rework 발생확률을 고려하는 병렬기계 스케줄링 문제를 위해 문제공간기반 탐색 알고리즘을 제안한다. 각 기계와 작업유형별로 rework 발생확률이 존재하며 이것은 자동화된 공정에서 과거데이터로부터 산출가능하다. 스케줄링 문제의 데이터 벡터 (가공시간, 납기, 셋업시간, rework확률)를 교란시킴으로써 이웃해를 생성하고 이로부터 도출된 해는 EDDR이라는 효과적인 휴리스틱을 이용하여 평가한다. 제안된 알고리즘은 납기지연의 최대값과 rewok 발생 작업수로 평가함으로써 제품의 품질과 납기수준을 동시에 고려할 수 있도록 한다.

• 전자공학회논문지S
• /
• 제34S권11호
• /
• pp.25-33
• /
• 1997

The end-to-end rate-based control mechanism is used for the flow control of the ABR service to allow much more flexibility in ATM switching system. To accommodate the ABR service effciently many algorithms such as EFCI, EPRCA, ERICA, and CAPC2 have been proposed for the switch algorithm. ABR cells and related RM cells are received at the ATM switch fabric transparently without any processing. And then cells received from the traffic source are queued in the ABR buffer of switching system. The ABR buffer usually has some thresholds for easy congestion control signal transmission. Whatever we use, therefore, these can be many ABR traffic control algorithms to implement the ABR transfer capability. The genertion of congestion indicate signal for ABR control algorithms is determined by ABR buffer satus. And ABR buffer status is determined by ABR cells transfer ratio in ATM switch fabrics. In this paper, we presented the functional structures for control of the ABR traffic capability, proposed the readout scheduling, cell slot allocation of output link and the buffer allocation model for effective ABR traffic guranteeing with considering CBR/VBR traffics in ATM switch. Since the proposed readout scheduling scheme can provide more avaliable space to ABR buffer than existing readout scheduling scheme, generation rate of a SEND signal, that is, BCN signal in destination node can be increased for ABR call connection. Therefore, the proposed scheme, in this paper, can be appropriate as algorithm for effective ABR traffic service on output link of ATM switching node.

• 제어로봇시스템학회논문지
• /
• 제14권5호
• /
• pp.462-466
• /
• 2008

This paper proposes a stable gain scheduling method of linear time invariant controllers for tracking servo system. In order to read and write the data on the optical disc, the pick-up head should be moved to the exact track quickly and follow the track immediately. Two different controllers are used for each moving and track-following. In pull-in period, a transition period from moving to track-following, the head might slip and miss the target track. This brings on another searching process and increases the total time. One way to avoid slipping is to extend the bandwidth of the track-following controller. But, extending the bandwidth could degrade the following performance. More prevalent way is to use one more controller in this pull-in period and switch to the following controller. In general, however, switching or scheduling of stable controllers cannot guarantee the stability. This paper suggests an scheduling method guaranteeing the overall stability not only in a generalized form but also in special form for SISO system. The sufficient condition is derived from the fact that Q factor of a stable controller should be stay in $RH_{\infty}$ space. In the experiment, the proposed method shows better performance than the switching method such as shorter time and lower current consumption.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권6호
• /
• pp.808-816
• /
• 2016

As the number of CPU/GPU cores and IPs in SOC increases and applications require explosive memory bandwidth, simultaneously achieving good throughput and fairness in the memory system among interfering applications is very challenging. Recent works proposed priority-based thread scheduling and channel partitioning to improve throughput and fairness. However, combining these different approaches leads to performance and fairness degradation. In this paper, we analyze the problems incurred when combining priority-based scheduling and channel partitioning and propose dynamic priority thread scheduling and adaptive channel partitioning method. In addition, we propose dynamic address mapping to further optimize the proposed scheme. Combining proposed methods could enhance weighted speedup and fairness for memory intensive applications by 4.2% and 10.2% over TCM or by 19.7% and 19.9% over FR-FCFS on average whereas the proposed scheme requires space less than TCM by 8%.

• 한국BIM학회 논문집
• /
• 제9권2호
• /
• pp.1-10
• /
• 2019

In this research, schedule optimization is defined as balancing the number of workers while keeping the demand and needs of the project resources, creating the perfect schedule for each activity. Therefore, when one optimizes a schedule, multiple potentials of schedule changes are assessed to get an instant view of changes that avoid any over and under staffing while maximizing productivity levels for the available labor cost. Optimizing the number of workers in the scheduling process is not a simple task since it usually involves many different factors to be considered such as the development of quantity take-offs, cost estimating, scheduling, direct/indirect costs, and borrowing costs in cash flow while each factor affecting the others simultaneously. That is why the optimization process usually requires complex computational simulations/modeling. This research attempts to find an optimal selection of daily maximum workers in a project while considering the impacts of other factors at the same time through OPEN BIM based multiple computer simulations in resource leveling. This paper integrates several different processes such as quantity take-offs, cost estimating, and scheduling processes through computer aided simulations and prediction in generating/comparing different outcomes of each process. To achieve interoperability among different simulation processes, this research utilized data exchanges supported by building SMART-IFC effort in automating the data extraction and retrieval. Numerous computer simulations were run, which included necessary aspects of construction scheduling, to produce sufficient alternatives for a given project.

• 한국우주과학회:학술대회논문집(한국우주과학회보)
• /
• 한국우주과학회 2004년도 한국우주과학회보 제13권2호
• /
• pp.364-367
• /
• 2004

This paper presents the flight software of KoDSat (KSLV-l Demonstration Satellite) which performs demonstrating the KSLV-l (Korea Space Launch Vehicle-l)'s satellite launch capability. The KoDSat Flight Software executes in a single-processor, multi-function flight computer on the spacecraft, the OBC (On Board Computer). The flight software running on the single processor is responsible for all real-time processing associated with: processor startup and hardware initialization, task scheduling, RS422 handling function, command and data handling including uplink command and down-link telemetry, attitude determination and control, battery state of charge monitoring and control, thermal control processing.