• 제목/요약/키워드: resource constraint

검색결과 206건 처리시간 0.03초

동시공학 환경에서 자원제약이 있는 프로세스 모델의 성능분석에 관한 연구 (A Study on the Performance Analysis of Process Model with Resource Constraints in Concurrent Engineering Environment)

  • 강동진;이상용;유왕진;정용식
    • 산업경영시스템학회지
    • /
    • 제22권51호
    • /
    • pp.231-240
    • /
    • 1999
  • A major concern in Concurrent Engineering is the control and management of workload in a period of process. As a general rule, leveling the peak of workload in certain period is difficult because concurrent processing is comprised of various processes, including overlapping, paralleling looping and so on. Therefore, the workload management with resource constraints is so beneficial that effective methods to analyze design process are momentous. This study presents the Timed Petri Nets approach of precedence logic networks, and provides an alternative for users to analyze constraint processes to resolve conflicts of resources. Another approach to Continuous Time Markov Chain using Stochastic Petri Nets is also proposed. These approaches are expected to facilitate resolving resource constrained scheduling problems more systematically in Concurrent Engineering environment.

  • PDF

국내거주외국인의 생활만족도와 소비생활만족도에 관한 연구 (Life Satisfaction and Consumer Satisfaction of Resident Foreigners in Korea)

  • 김현주;나종연
    • 대한가정학회지
    • /
    • 제46권10호
    • /
    • pp.133-146
    • /
    • 2008
  • This study investgates the factors influencing the levels of consumer satisfaction and life satisfaction of resident foreigners in Korea. The data were collected through a structured self-administered survey and 545 foreigners who lived in Korea for more than 3 months, with age over 20 participated as respondents. A research framework was formulated based on the resource constraint hypothesis and the study investigated the impact of information resource(human, media and internet information source) and consumer resource(monthly income, language ability and consumer proficiency) on the levels of consumer satisfaction and life satisfaction. The results from data analysis can be summarized as follows; First, analysis of consumer problems of resident foreigners in Korea indicated that resident foreigners recognize a burden for residence cost, food expense and education fee. Most of resident foreigners in Korea are found to use small local shops most often indicating they may experience adverse market environment due to resource constraint such as language or psychological barrier, and most of the respondents answered that the most often used payment method was cash. Furthermore, resident foreigners in Korea responded that lack of language service, lack of information provision, inability to use certain goods and services are the common cause of consumer dissatisfaction, as well as price and quality problems. Second, the level of consumer satisfaction (2.96 in 4.0) is higher than the level of life satisfaction (2.63 in 4.0). Third, the level of life satisfaction is significantly influenced by Korean language ability and the level of consumer satisfaction. The level of consumer satisfaction is by the media information source usage and consumer claim experience. Fourth, the level of consumer satisfaction is found to be the variable with the strongest causal relationship with the level of life satisfaction.

유비쿼터스 환경에서 제한적인 능력을 갖는 이동장치를 위한 경량의 인증 프로토콜 구현 (Implementing a Light-Weight Authentication Protocol for Resource-Constraint Mobile Device in Ubiquitous Environment)

  • 임규상;유일선
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2007년도 춘계종합학술대회
    • /
    • pp.823-826
    • /
    • 2007
  • 유비쿼터스 환경에서 사용자가 휴대하는 이동장치는 제한적인 능력을 갖기 때문에 강력한 보안성과 경량의 연산량을 지원하는 인증 프로토콜이 요구된다. 최근에 제안된 S/key 기반의 인증기법들은 경량의 암호화 연산과 함께 강력한 사용자 인증, 세션키 교환을 제공함으로써 이러한 요구사항을 만족한다. 특히, You와 Jung이 제안했던 프로토콜은 효율성과 보안성을 함께 고려할 때 가장 우수하다. 본 논문에서는 You-Jung 기법을 다른 기법들과 비교 분석하고 실제 유비쿼터스 환경에서의 적용을 위해 이동장치 상태변화를 설계하고 프로토콜을 구현한다.

  • PDF

시간 제약 조건 하에서의 모듈 선택 재사용을 위한 전력 감소 스케줄링 (Reducing Power Consumption of a Scheduling for Reuse Module Selection under the Time Constraint)

  • 최지영;김희석
    • 한국통신학회논문지
    • /
    • 제29권3A호
    • /
    • pp.318-323
    • /
    • 2004
  • 본 논문은 시간 제약 조건 하에서의 모듈 선택 재사용을 이용한 전력 감소 스케줄링을 제안한다. 일반적인 상위 수준 합성에서의 스케줄링은 실제적인 라이브러리의 복잡한 재사용을 허용하지 않는다. 반면 제안한 전력 감소 스케줄링에서는 주어진 사용자 정의 모듈을 실제적인 RT 라이브러리 모듈 재사용과 공유된 자원에서의 스위치 활동의 자원 공유함으로써 설계의 생산성 및 소비 전력을 줄이는데 효율적으로 접근할 수 있다. 또한 비교 실험에서 스케줄링 기법인 체이닝과 멀티사이클링을 이용해 다양한 상위 레벨 벤치마크의 환경에서 최적의 스케줄링의 결과를 얻는다.

Resource Allocation Algorithm for Multi-cell Cognitive Radio Networks with Imperfect Spectrum Sensing and Proportional Fairness

  • Zhu, Jianyao;Liu, Jianyi;Zhou, Zhaorong;Li, Li
    • ETRI Journal
    • /
    • 제38권6호
    • /
    • pp.1153-1162
    • /
    • 2016
  • This paper addresses the resource allocation (RA) problem in multi-cell cognitive radio networks. Besides the interference power threshold to limit the interference on primary users PUs caused by cognitive users CUs, a proportional fairness constraint is used to guarantee fairness among multiple cognitive cells and the impact of imperfect spectrum sensing is taken into account. Additional constraints in typical real communication scenarios are also considered-such as a transmission power constraint of the cognitive base stations, unique subcarrier allocation to at most one CU, and others. The resulting RA problem belongs to the class of NP-hard problems. A computationally efficient optimal algorithm cannot therefore be found. Consequently, we propose a suboptimal RA algorithm composed of two modules: a subcarrier allocation module implemented by the immune algorithm, and a power control module using an improved sub-gradient method. To further enhance algorithm performance, these two modules are executed successively, and the sequence is repeated twice. We conduct extensive simulation experiments, which demonstrate that our proposed algorithm outperforms existing algorithms.

로봇 어플리케이션을 위한 협업 프레임워크 설계 (The Design of Collaboration Framework for Robot Application)

  • 이창묵;권오영
    • 정보처리학회논문지A
    • /
    • 제17A권5호
    • /
    • pp.249-258
    • /
    • 2010
  • 로봇 어플리케이션의 활용도는 사회 전반에서 점차 확대되고 있지만 로봇들의 컴퓨팅 자원 차이로 인해 한 로봇에서 다양한 어플리케이션을 실행하기는 힘든 실정이다. 본 논문에서는 로봇이 주변 장치와의 자원 공유를 통해 자원의 제약을 극복하는 프레임워크를 제안한다. 프레임워크는 협업에 요구되는 공통 구성 요소들을 정의하고 어플리케이션을 쉽게 제작할 수 있는 API를 제공한다. 로봇과 다른 장치가 네트워크로 연결된 환경에서 동작하는 로봇을 이용한 체조 학습 어플리케이션의 예시를 통해 프레임워크의 동작 흐름을 보인다.

A Case Study of Human Resource Allocation for Effective Hotel Management

  • Murakami, Kayoko;Tasan, Seren Ozmehmet;Gen, Mitsuo;Oyabu, Takashi
    • Industrial Engineering and Management Systems
    • /
    • 제10권1호
    • /
    • pp.54-64
    • /
    • 2011
  • The purpose of this study is to optimally allocate the human resources to tasks while minimizing the total daily human resource costs and smoothing the human resource usage. The human resource allocation problem (hRAP) under consideration contains two kinds of special constraints, i.e. operational precedence and skill constraints in addition to the ordinary constraints. To deal with the multiple objectives and the special constraints, first we designed this hRAP as a network problem and then proposed a Pareto multistage decisionbased genetic algorithm (P-mdGA). During the evolutionary process of P-mdGA, a Pareto evaluation procedure called generalized Pareto-based scale-independent fitness function approach is used to evaluate the solutions. Additionally, in order to improve the performance of P-mdGA, we use fuzzy logic controller for fine-tuning of genetic parameters. Finally, in order to demonstrate the applicability and to evaluate the performance of the proposed approach, P-mdGA is applied to solve a case study in a hotel, where the managers usually need helpful automatic support for effectively allocating hotel staff to hotel tasks.

Virtual Resource Allocation in Virtualized Small Cell Networks with Physical-Layer Network Coding Aided Self-Backhauls

  • Cheng, Yulun;Yang, Longxiang;Zhu, Hongbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권8호
    • /
    • pp.3841-3861
    • /
    • 2017
  • Virtualized small cell network is a promising architecture which can realize efficient utilization of the network resource. However, conventional full duplex self-backhauls lead to residual self-interference, which limits the network performance. To handle this issue, this paper proposes a virtual resource allocation, in which the residual self-interference is fully exploited by employing a physical-layer network coding (PNC) aided self-backhaul scheme. We formulate the features of PNC as time slot and information rate constraints, and based on that, the virtual resource allocation is formulated as a mixed combinatorial optimization problem. To solve the problem efficiently, it is decomposed into two sub problems, and a two-phase iteration algorithm is developed accordingly. In the algorithm, the first sub problem is approximated and transferred into a convex problem by utilizing the upper bound of the PNC rate constraint. On the basis of that, the convexity of the second sub problem is also proved. Simulation results show the advantages of the proposed scheme over conventional solution in both the profits of self-backhauls and utility of the network resource.

Ontology for estimating excavation duration for smart construction of hard rock tunnel projects under resource constraint

  • Yang, Shuhan;Ren, Zhihao;Kim, Jung In
    • 국제학술발표논문집
    • /
    • The 9th International Conference on Construction Engineering and Project Management
    • /
    • pp.222-229
    • /
    • 2022
  • Although stochastic programming and feedback control approaches could efficiently mitigate the overdue risks caused by inherent uncertainties in ground conditions, the lack of formal representations of planners' rationales for resource allocation still prevents planners from applying these approaches due to the inability to consider comprehensive resource allocation policies for hard rock tunnel projects. To overcome the limitations, the authors developed an ontology that represents the project duration estimation rationales, considering the impacts of ground conditions, excavation methods, project states, resources (i.e., given equipment fleet), and resource allocation policies (RAPs). This ontology consists of 5 main classes with 22 subclasses. It enables planners to explicitly and comprehensively represent the necessary information to rapidly and consistently estimate the excavation durations during construction. 10 rule sets (i.e., policies) are considered and categorized into two types: non-progress-related and progress-related policies. In order to provide simplified information about the remaining durations of phases for progress-related policies, the ontology also represents encoding principles. The estimation of excavation schedules is carried out based on a hypothetical example considering two types of policies. The estimation results reveal the feasibility, potential for flexibility, and comprehensiveness of the developed ontology. Further research to improve the duration estimation methodology is warranted.

  • PDF

비용기반 스케쥴링 : Part I, 작업내 비용 전파알고리즘 (Cost-Based Directed Scheduling : Part I, An Intra-Job Cost Propagation Algorithm)

  • 김재경;서민수
    • 지능정보연구
    • /
    • 제13권4호
    • /
    • pp.121-135
    • /
    • 2007
  • 문제의 제약조건을 명확히 표현하고 휴리스틱 탐색에 의하여 스케쥴링을 형성하는 제약조건 중심의 스케쥴링 기법은 실세계의 스케쥴링 문제에 성공적으로 적용되어 왔다. 하지만, 기존의 제약조건 중심의 스케쥴링 연구에서 스케쥴링의 목적을 표현하고 최적화하는데 관련된 연구는 부족한 상황이다. 특히 비용 목적함수는 다양한 비즈니스 계획의 효과를 분석하는 기업의사결정에서 매우 중요 하다고 평가된다. 이 연구의 목적은 자원 용량이나 일시적인 제약조건을 만족하면서 지연비용 및 재고비용을 포함한 스케쥴링의 전체 비용을 명확하게 표현하고 최적화하는 것이다. 비용기반 스케쥴링 프레임워크에서, 동일한 작업 내에 일시적인 제약조건을 만들어 가면서 비용함수를 개선해 나가는 비용 전파 알고리즘을 제시하였다.

  • PDF