• 한국건설관리학회논문집
• /
• 제5권2호
• /
• pp.211-218
• /
• 2004

다수의 시설물을 보유한 기관에서는 유지보수와 리모델링(M/R) 프로젝트들이 동시에 진행되고 있다. 내부기능인력에 의해 프로젝트를 수행하는 자원제약 환경에서 프로젝트 관리자는 각 프로젝트의 완료일과 기관내 가용한 자원에 대한 제한을 고려하며 프로그램을 계획하고 관리하게 된다. 다중 자원제약 M/R 프로그램의 효과적 관리를 위해 이 논문은 장기적인 프로그램 계획축과 단기적인 일정창으로 구성되는 2단계 계층관리모델을 제안한다. 프로그램 플랜을 위한 연동계획기법은 연속되는 프로젝트 요청의 불확실성에 대처하기 위해 제안되었다. 일정창 속에서 마스터-일정계획을 수립하기 위해 개발된 PCR 일정계획 알고리즘은 M/R 프로그램에서의 작업반내 기능인력의 배치계획을 제공한다. 스프레드쉬트 인터페이스를 활용하여 M/R 프로그램의 일정계획 시스템을 개발하였고, 연속된 3개의 일정창으로 설계된 시뮬레이션 실험을 통해 개발된 일정계획 알고리즘과 기존의 자원제약 일정계획 휴리스틱의 성능을 비교하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권10호
• /
• pp.4748-4765
• /
• 2016

We consider a virtualized cognitive radio (CR) network, where multiple virtual network operators (VNOs) who own different virtual cognitive base stations (VCBSs) share the same physical CBS (PCBS) which is owned by an infrastructure provider (InP), sharing the spectrum with the primary user (PU). The uplink scenario is considered where the secondary users (SUs) transmit to the VCBSs. The PU is protected by constraining the interference power from the SUs. Such constraint is applied by the InP through pricing the interference. A Stackelberg game is formulated to jointly maximize the revenue of the InP and the individual utilities of the VNOs, and then the Stackelberg equilibrium is investigated. Specifically, the optimal interference price and channel allocation for the VNOs to maximize the revenue of the InP and the optimal power allocation for the SUs to maximize the individual utilities of the VNOs are derived. In addition, a low‐complexity ±‐optimal solution is also proposed for obtaining the interference price and channel allocation for the VNOs. Simulations are provided to verify the proposed strategies. It is shown that the proposed strategies are effective in resource allocation and the ±‐optimal strategy achieves practically the same performance as the optimal strategy can achieve. It is also shown that the InP will not benefit from a large interference power limit, and selecting VNOs with higher unit rate utility gain to share the resources of the InP is beneficial to both the InP and the VNOs.

• 산업경영시스템학회지
• /
• 제41권4호
• /
• pp.22-33
• /
• 2018

Recently domestic manufacturing companies have been experiencing worsening profitability and stunted growth due to the long-term economic recession and the rapid rise of developing countries such as China and Southeast Asia. These difficulties force many companies to concentrate their core competencies on new value creation and innovation in order to gain momentum for new growth. Enterprise Resource Planning (ERP) has been considered as one of viable solutions. Among the various modules in ERP, shop floor control function in the production management module is rather limited. In order to overcome this problem, Manufacturing Execution System (MES) has been used as a subsystem which has a strong information gathering power and flexibility. Both systems interact closely with each other. In particular, ERP requires fast, accurate shop floor information at MES. This paper describes how to synchronize relevant information between ERP and MES with theory of constraints (TOC). The processing time information transmitted from the MES workplace is received at the ERP workplace. In the process, the received processing time is causing information distortion in ERP, when the information gathering standard of MES is different from the ERP information interpretation standard. The Drum-Buffer-Rope theory of TOC was applied to resolve this problem, therefore, information synchronization between both systems was made. As a precondition, the standard time of the upper ERP system was rearranged according to the capacity constraints resource. As a result, standard time restructuring has affected changes in labor costs. Standard labor costs have come close to actual ones, and information synchronization of MES transmission data has improved the reliability of standard product costs, such that it enabled various company-wide restructuring actions to be much more effective.

• International Journal of Automotive Technology
• /
• 제6권1호
• /
• pp.71-77
• /
• 2005

This paper presents a systematic approach which determines the optimal period to minimize performance measure subject to the schedulability constraints of a real-time control system by formulating the scheduling problem as an optimal problem. The performance measure is derived from the summation of end-to-end response times of processed I/Os scheduled by the static cyclic method. The schedulability constraint is specified in terms of allowable resource utilization. At first, a uniprocessor case is considered and then it is extended to a distributed system connected through a communication link, local-inter network, UN. This approach is applied to the design of an automotive body control system in order to validate the feasibility through a real example. By using the approach, a set of optimal periods can easily be obtained without complex and advanced methods such as branch and bound (B&B) or simulated annealing.

• ETRI Journal
• /
• 제30권1호
• /
• pp.1-12
• /
• 2008

In this paper, we propose an efficient single-resource task scheduling algorithm for the Communication, Ocean, and Meteorological Satellite. Among general satellite planning functions such as constraint check, priority check, and task scheduling, this paper focuses on the task scheduling algorithm, which resolves conflict among tasks which have an exclusion relation and the same priority. The goal of the proposed task scheduling algorithm is to maximize the number of tasks that can be scheduled. The rationale of the algorithm is that a discarded task can be scheduled instead of a previously selected one depending on the expected benefit acquired by doing so. The evaluation results show that the proposed algorithm enhances the number of tasks that can be scheduled considerably.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅲ
• /
• pp.1419-1422
• /
• 2003

Multimedia contents what we call Digital Items include various types of resources such as music, speech, text, video, graphics, and so on. The current Adaptation QoS described in the ISO/IEC 21000-7 CD-Part 7: Digital Item Adaptation, however, lacks adaptation methods for audio signals. The goal of this paper is to provide adaptation methods that are necessary to deal with audio signals. Two operations are introduced in order to adapt audio items. One method is to make use of the functionality of Fine Grain Scalability, and the other is intended to drop the channel of audio output channel. This paper provides a DIA description tool that associates the operators with the corresponding values of the constraint and the utility. Furthermore, the operations are evaluated and compared to alternative solutions.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.715-722
• /
• 2005

Disassembly scheduling is the problem of determining the quantity and timing of disassembling used products while satisfying the demand of their parts or components over a planning horizon. The case of single product type with assembly structure is considered for the objective of minimizing the sum of disassembly operation and inventory holding costs. In particular, the resource capacity constraint is explicitly considered. The problem is formulated as an integer programming model, and a two-stage heuristic with construction and improvement algorithms is suggested in this paper. To show the performance of the heuristic, computational experiments are done on a number of randomly generated problems, and the test results show that the algorithm can give near optimal solutions within a very short amount of computation time.

• 한국건설관리학회논문집
• /
• 제5권1호
• /
• pp.53-61
• /
• 2004

리모델링 프로젝트는 기존 자원의 활용이라는 제한조건 안에서 수행되므로 기존 건축물의 구성요소들의 상관관계가 리모델링의 대상과 범위의 선정에 제한조건, 영향요인으로 작용하게 된다. 이러한 리모델링 프로젝트의 특성을 고려하여, 본 연구에서는 리모델링 사업수행시 설계단계에서 건축물 공간을 구성하는 부위의 구성요소간의 상관관계 분석을 통해 시공단계에서 발생하는 다양한 문제로 인한 공기지연, 공사비 증가 등의 문제 발생을 최소화하기 위한 방법으로, 리모델링 설계단계에서 건축시스템의 상관관계를 효율적으로 분석하기 위한 리모델링 건축시스템 상관관계 도식화 모델 및 부위별 적정 대안선정 방법을 제안하였다.

• 전기학회논문지
• /
• 제58권7호
• /
• pp.1263-1269
• /
• 2009

Stable and sustainable power supply means maintaining a certain level of power quality and service while securing energy resource and resolving environmental issues. Distributed generation (DG) has become an essential and indispensable element from environmental and energy security perspectives. It is known that voltage violation is the most important constraint for load variation and the maximum allowable DG. In distribution system, sending voltage from distribution substation is regulated by ULTC (Under Load Tap Changer) designed to maintain a predetermined voltage level. ULTC is controlled by LDC (Line Drop Compensation) method compensating line voltage drop for a varying load, and the sending voltage of ULTC calls for LDC parameters. The consequence is that the feasible LDC parameters considering variation of load and DG output are necessary. In this paper, we design each LDC parameters determining the sending voltage that can satisfy voltage level, decrease ULTC tap movement numbers, or increase DG introduction. Moreover, the maximum installable DG capacity based on each LDC parameters is estimated.

• Journal of Communications and Networks
• /
• 제12권4호
• /
• pp.346-357
• /
• 2010

Opportunistic scheduling provides the capability of resource management in wireless networks by taking advantage of multiuser diversity and by allowing delay variation in delivering data packets. It generally aims to maximize system throughput or guarantee fairness and quality of service (QoS) requirements. In this paper, we develop an extended proportional fair (PF) scheduling policy that can statistically guarantee three kinds of QoS. The scheduling policy is derived by solving the optimization problems in an ideal system according to QoS constraints. We prove that the practical version of the scheduling policy is optimal in opportunistic scheduling systems. As each scheduling policy has some parameters, we also consider practical parameter adaptation algorithms that require low implementation complexity and show their convergences mathematically. Through simulations, we confirm that our proposed schedulers show good fairness performance in addition to guaranteeing each user's QoS requirements.