• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.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.

• Journal of the Korean Home Economics Association
• /
• v.46 no.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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.823-826
• /
• 2007

In ubiquitous environment, mobile devices, which users carry, tend to be resource-constraint, thus resulting in the need for an authentication protocol, which provides light-weight computations as well as strong security. Recently S/Key based protocols, which satisfy such a requirement by achieving light-weight computations, strong authentication and session key exchange, have been proposed. In particular, You and Jung's protocol is more efficient and secure than others. In this paper, we compare and analyze You-Jung with other protocols. Also, we design an authentication scenario and status of mobile devices while implementing the protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.318-323
• /
• 2004

In this paper, we present a reducing power consumption of a scheduling for reuse module selection under the time constraint. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed scheduling of reducing power consumption is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our approach various HLS benchmark environment using chaining and multi-cycling in the scheduling techniques.

• ETRI Journal
• /
• v.38 no.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 KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.249-258
• /
• 2010

The utilization of robot application is growing up in recent years, but there is a constraint to execute various application on the robot because of difference of robot resource. This paper presents the framework in order to solve the resource constraint by sharing resources with other devices near by robot. The framework defines common factors that are needed to collaboration work and provides APIs in order to implement robot application easily. Furthermore, We show the working flow of framework with physical training application using robot by example. The application shows how to collaborated work between robot and other devices through network.

• Industrial Engineering and Management Systems
• /
• v.10 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.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.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• 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.

• Journal of Intelligence and Information Systems
• /
• v.13 no.4
• /
• pp.121-135
• /
• 2007

Constraint directed scheduling techniques, representing problem constraints explicitly and constructing schedules by constrained heuristic search, have been successfully applied to real world scheduling problems that require satisfying a wide variety of constraints. However, there has been little basic research on the representation and optimization of the objective value of a schedule in the constraint directed scheduling literature. In particular, the cost objective is very crucial for enterprise decision making to analyze the effects of alternative business plans not only from operational shop floor scheduling but also through strategic resource planning. This paper aims to explicitly represent and optimize the total cost of a schedule including the tardiness and inventory costs while satisfying non-relaxable constraints such as resource capacity and temporal constraints. Within the cost based scheduling framework, a cost propagation algorithm is presented to update cost information throughout temporal constraints within the same job.