• 한국건축시공학회지
• /
• 제10권4호
• /
• pp.31-39
• /
• 2010

선형 공정계획 방법은 1929년 엠파이어 스테이트 빌딩에서 그래픽한 용도로 사용되면서 현재는 다양한 작업 공간, 현장 작업과 조립 작업에 적용되고 있다. 선형 공정계획 상에 동시적인 크리티칼 패스가 발생하면 자원 관리는 작업흐름의 최적화 문제로 연결되어 유연한 작업생산성과 지속적인 자원의 할당을 하기 위해 적용되고 있다. 그러나 선형 공정계획 모델 연구에서 간과하고 있는 선형 공정계획 모델의 작업 관계성을 고려하는 것이 필요하다. 이에 본 연구는 선형 공정계획 모델에 관한 기존 연구를 분석하여 네트워크 공정표의 관계성을 선형 공정표에 적용할 수 있는 방법을 제시한다. 네트워크 공정표를 선형공정표로 변환 시에 발생하는 작업의 관계성을 고찰하고 건축물의 물리적 층수 변화와 같이 작업공간의 변화에 따라 선형 공정표에 반영되어야 할 선형 공정표상의 액티비티의 이동 문제를 고찰하여 네트워크 공정표를 선형 공정표로 호환할 수 있는 시스템 개발을 위한 기초연구를 제공하는 것이 본 연구의 목적이다.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2010년도 춘계 학술논문 발표대회 1부
• /
• pp.131-133
• /
• 2010

As linear scheduling method has been used since 1929, Empire State Building linear schedule, it is being applied in various fields such as construction and manufacturing. When addressing concurrent critical path occurring on linear schedule of construction, the empirical researches stress the resource management which should be applied for optimizing work flow, flexible work productivity and continuos resource allocation. However, work relationships has been usually overlooked for making the linear schedule from existing network schedule. Therefore, this research analyze the previous researches related to linear scheduling model and then propose the method that can be applied for adopting the relationships of network schedule to the linear schedule.

• 대한산업공학회지
• /
• 제27권2호
• /
• pp.140-149
• /
• 2001

The paper discusses the problem of finding the Origin-Destination(O-D) shortest paths in internodal transportation networks with time-schedule constraints. The shortest path problem on the internodal transportation network is concerned with finding a path with minimum distance, time, or cost from an origin to a destination using all possible transportation modalities. The time-schedule constraint requires that the departure time to travel from a transfer station to another node takes place only at one of pre-specified departure times. The scheduled departure times at the transfer station are the times when the passengers are allowed to leave the station to another node using the relative transportation modality. Therefore, the total time of a path in an internodal transportation network subject to time-schedule constraints includes traveling time and transfer waiting time. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. The effectiveness of the GA approach is evaluated using several test problems.

• ETRI Journal
• /
• 제39권3호
• /
• pp.364-372
• /
• 2017

For the reliability of controllers in a software defined network (SDN), a dynamic and self-learning schedule method (DSL) is proposed. This method is original and easy to deploy, and optimizes the combination of multiple controllers. First, we summarize multiple controllers' combinations and schedule problems in an SDN and analyze its reliability. Then, we introduce the architecture of the schedule method and evaluate multi-controller reliability, the DSL method, and its optimized solution. By continually and statistically learning the information about controller reliability, this method treats it as a metric to schedule controllers. Finally, we compare and test the method using a given testing scenario based on an SDN network simulator. The experiment results show that the DSL method can significantly improve the total reliability of an SDN compared with a random schedule, and the proposed optimization algorithm has higher efficiency than an exhaustive search.

• 한국건축시공학회지
• /
• 제11권1호
• /
• pp.1-8
• /
• 2011

기존의 선형 공정계획은 마스터 스케쥴과 같이 작업분류체계의 대분류 레벨의 작업을 사선의 형태로 표현하는 데 국한하고 수작업으로 작성하였다. 즉, 네트워크 공정표의 정보를 활용하지 못하고 독립적으로 선형 공정표를 작성하여 보고용 또는 전체 공정계획 확인용으로 사용하고 있는 실정이다. 따라서 기존에 축적된 자료가 많은 네트워크 공정표를 기반으로 선형 공정표를 자동으로 생성할 수 있는 시스템 개발이 필요하다. 이에 본 연구는 선형 공정표 구현을 위한 데이터 프로세스 모델, 데이터 플로 다이어그램, 데이터모델을 구축하고 시스템 프로토 타입의 시스템 솔류션 구조, 클래스 다이어그램, 데이터 타입스키마를 개발하고자 한다. 즉, 네트워크 공정표를 선형 공정표로 변환하기 위한 시스템 프로토타입 개발의 선행 연구를 수행하는 것이 본 연구의 목적이다.

• Journal of Communications and Networks
• /
• 제18권2호
• /
• pp.227-237
• /
• 2016

Data collection is a key function for wireless sensor networks. There has been numerous data collection scheduling algorithms, but they fail to consider the deep and complex relationship among network lifetime, sink aggregated information and sample cycle for wireless sensor networks. This paper gives the upper bound on the sample period under the given network topology. An optimal schedule algorithm focusing on aggregated information named OSFAI is proposed. In the schedule algorithm, the nodes in hotspots would hold on transmission and accumulate their data before sending them to sink at once. This could realize the dual goals of improving the network lifetime and increasing the amount of information aggregated to sink. We formulate the optimization problem as to achieve trade-off among sample cycle, sink aggregated information and network lifetime by controlling the sample cycle. The results of simulation on the random generated wireless sensor networks show that when choosing the optimized sample cycle, the sink aggregated information quantity can be increased by 30.5%, and the network lifetime can be increased by 27.78%.

• 한국지능시스템학회논문지
• /
• 제21권6호
• /
• pp.712-717
• /
• 2011

최근 스마트 기기 사용자의 효율적인 일정 관리를 위해 다양한 일정 관리 에이전트들이 연구되고 있지만 아직까지는 일정을 기록하거나 확인해주는 수준에 머물고 있다. 사용자의 일정을 효율적으로 관리하기 위해서는 계획한 일정의 수행 여부 등을 모니터링하여 사용자에게 일정을 제대로 수행할 수 있도록 도움을 주거나, 새로운 일정 수립 시 사용자의 일정 수립 패턴에 적합하게 일정을 계획할 수 있도록 피드백 해 줄 수 있어야 한다. 본 논문에서는 사용자가 일정을 수행하거나 새로운 일정을 계획할 때, 획득된 사용자 컨텍스트를 이용하여 사용자의 행동을 추론하고 사용자의 행동 패턴에 따른 일정 관련 피드백을 제공하는 일정 관리 에이전트를 제안한다. 본 에이전트에서는 수집된 사용자 컨텍스트 정보를 전처리 후 베이지안 네트워크에 적용하여 사용자의 행동을 추론한다. 또한 사용자 일정 수행 여부의 확인 및 새로운 일정 수립에 필요한 피드백을 제공하기 위해 사용자 일정과 위치 및 시간 컨텍스트에 대하여 컨텍스트 트리 패턴 매칭 기법을 적용하였으며, 모바일 환경에서 6주간의 사용자 시뮬레이션을 통해 검증하였다.

• 한국건축시공학회지
• /
• 제12권6호
• /
• pp.558-565
• /
• 2012

Schedule management of construction work is critical to completing construction projects within a given period of time. Many efforts have been made and multiple tools have been developed to support the management of construction projects using smart devices such as smartphones and tablet PCs. This study proposed a method for managing construction schedules via a smart device using Flash. The interactive and graphic properties of Flash enable the development of an app that can allow a field manager to manage schedules easily and efficiently. A prototype was implemented using Adobe Flex Builder, and a sample network was applied in a smartphone. It is convenient for a construction manager to manage construction schedules using the tool because Flash controls graphic components easily. In further studies, network diagrams such as CPM (Critical Path Method) should be developed and applied to the app.

• Architectural research
• /
• 제11권2호
• /
• pp.43-49
• /
• 2009

Since the late 1980s, the schedule technique applied to the construction industry around the world has rapidly changed from the traditional ADM (Arrow Diagramming Method) to the PDM (Precedence Diagramming Method) technique. The main reason for this change is to overcome the limits and inconveniences of the traditional ADM technique. The time-cost trade-off is one of the core scheduling techniques to establish the best optimized combination plan in terms of a relationship between the cost and schedule. However, most of the schedule-related textbooks and research papers have discussed and proposed applications of a time-cost trade-off technique based only on the Finish to Start relationship. Therefore, there are almost no consideration and discussion of problems or restrictions that emerge when the time-cost trade-off technique is applied to the PDM network that has overlapping relationships. This paper proposes the lead-time adjustment method as a methodology for overcoming some restrictions that are encountered when the time-cost trade-off technique is applied to the overlapping relationships of the PDM network.

• Journal of Astronomy and Space Sciences
• /
• 제31권1호
• /
• pp.51-61
• /
• 2014

In this work, the preliminary analysis on both the tracking schedule and measurements characteristics for the spacecraft on the phase of lunar transfer and capture is performed. To analyze both the tracking schedule and measurements characteristics, lunar transfer and capture phases' optimized trajectories are directly adapted from former research, and eleven ground tracking facilities (three Deep Space Network sties, seven Near Earth Network sites, one Daejeon site) are assumed to support the mission. Under these conceptual mission scenarios, detailed tracking schedules and expected measurement characteristics during critical maneuvers (Trans Lunar Injection, Lunar Orbit Insertion and Apoapsis Adjustment Maneuver), especially for the Deajeon station, are successfully analyzed. The orders of predicted measurements' variances during lunar capture phase according to critical maneuvers are found to be within the order of mm/s for the range and micro-deg/s for the angular measurements rates which are in good agreement with the recommended values of typical measurement modeling accuracies for Deep Space Networks. Although preliminary navigation accuracy guidelines are provided through this work, it is expected to give more practical insights into preparing the Korea's future lunar mission, especially for developing flight dynamics subsystem.