• 한국공작기계학회논문집
• /
• 제12권3호
• /
• pp.31-37
• /
• 2003

With the paradigm shifting from the principal of manufacturing efficiency to business globalism and rapid adaptation to its environments, more and more enterprises are being virtually organized as manufacturing network of different units in web. The formation of these enterprise called as Virtual Enterprise(VE) is becoming a growing trend as enterprises concentrating on core competence and economic benefit. 13us paper proposes multi-agent based task assignment system for VE, which attempts to address the selection of individually managed partners and the task assignment to them A case example is presented to illustrate how the proposed system can assign the task to partners.

• International Journal of Aeronautical and Space Sciences
• /
• 제12권2호
• /
• pp.163-174
• /
• 2011

Task assignments of multiple unmanned aerial vehicles (UAVs) are examined. The phrase "task assignment" comprises the decision making procedures of a UAV group. In this study, an on-line decentralized task assignment algorithm is proposed for an autonomous UAV group. The proposed method is divided into two stages: an order optimization stage and a communications and negotiation stage. A genetic algorithm and negotiation strategy based on one-to-one communication is adopted for each stage. Through the proposed algorithm, decentralized task assignments can be applied to dynamic environments in which sensing range and communication are limited. The performance of the proposed algorithm is verified by performing numerical simulations.

• 대한교통학회지
• /
• 제14권3호
• /
• pp.27-44
• /
• 1996

The purpose of the thesis is providing a new formulation for the transit assignment problem. The existing models dealing with the transit assignment problem don't consider the congestion effects due to the insufficient capacity of transit vehicles. Besides, these models don't provide solutions satisfying the Wardrop's user equilibrium conditions. The congestion effects are considered to be concentrated at the transit stops. For the transit lines, the waiting times at the transit stops are dependent on the passenger flows. The new model suggests the route section cost function analogous to the link performance function of the auto assignment to reflect the congestion effects in congested transit network. With the asymmetric cost function, the variational inequality programming is used to obtain the solutions satisfying Wardrop's condition. The diagonalization algorithm is introduced to solve this model. Finally, the results are compared with those of EMME/2.

• 한국국방경영분석학회지
• /
• 제30권1호
• /
• pp.1-14
• /
• 2004

In this paper, we propose a new data-mining-based methodology for military occupational specialty assignment. The proposed methodology consists of two phases, feature selection and man-power assignment. In the first phase, the k-means partitioning algorithm and the optimal variable weighting algorithm are used to determine attribute weights. We address limitations of the optimal variable weighting algorithm and suggest a quadratic programming model that can handle categorical variables and non-contributory trivial variables. In the second phase, we present an integer programming model to deal with a man-power assignment problem. In the model, constraints on demand-supply requirements and training capacity are considered. Moreover, the attribute weights obtained in the first phase for each specialty are used to measure dissimilarity. Results of a computational experiment using real-world data are provided along with some analysis.

• Journal of Mechanical Science and Technology
• /
• 제14권6호
• /
• pp.583-589
• /
• 2000

This paper presents a novel fault isolation filter design method using left eigenstructure assignment scheme proposed by the first author et al. The proposed method shows good performance of fault isolation with an exact eigenstructure assignment and guarantees that the corrupted ${\gamma}$ faults can be isolated simultaneously when the number of available output measurements are equal to or larger than (${\gamma}+1$). A numerical example for the fault isolation filter is also included.

• 대한교통학회지
• /
• 제13권3호
• /
• pp.19-33
• /
• 1995

Conventional traffic assignment techniques usually do not consider traveler's route choice behavior affected by hierachicla strucfture in urban highway system. This study realizes the route choice behavior such that travelers tend to choose more higher level of highway rather than lower level of highway for longer trops. Otherwise, for shorter trips, travelers tend to choose lower level of highway unless they can get sufficient travel time saving by using mojor arterial street or freeway (higher level of highway). Therefore, this study suggests a traffic assignment technique incorrporating route choice behavior related to hierachical highway structure by introducing some perception costs to generalized cost function such as perceptional preference measureemnt for higher level higheay and perceptional penalty when changing to different level of highway. Through simulation analysis, it is shown that the simulation results with the new traffic assignment echnique can be different a lot from the results with the convential method.

• Journal of Mechanical Science and Technology
• /
• 제18권6호
• /
• pp.933-945
• /
• 2004

In this paper, S (stochastic)-eigenvalue concept and its S-eigenvector for linear continuous-time systems with probabilistic uncertainties is proposed. The proposed concept is concerned with the perturbation of eigenvalues due to the probabilistic variable parameters in the dynamic model of a plant. S-eigenstructure assignment scheme via the Sylvester equation approach based on the S-eigenvalue concept is also proposed. The proposed design schemes are illustrated by numerical examples, and applied to the longitudinal dynamics of open-loop-unstable aircraft with possible uncertainties in aerodynamic and thrust effects as well as separate dynamic pressure. These results explicitly characterize how S-eigenvalues in the complex plane may impose stability on S-eigenstructure assignment.

• 무역상무연구
• /
• 제43권
• /
• pp.143-168
• /
• 2009

International Factoring transaction in Korea is different from that of financially advanced countries in terms of legal system and commercial and financial practices. As for the domestic factoring, Korean factors are only involved in advances often on a with recourse basis. With regard to the international factoring, Korean factors do not accommodate whole account receivables from clients (suppliers) but handle on a selective basis. Among Korean banks, KEXIM (Export and Import Bank of Korea) is sole factor for international transactions. Currently KEXIM and several foreign banks handle factoring provide factoring services with limitation to invoice discounting which is largely extended to large corporate names. Therefore this is far different from factoring in Europe and Americas designed for small exporters with non recourse advances. In respect of legal environment, receivable assignment is subject to debtor' acknowledge or approval of such assignment according to Civil Law Act. To remove the legal obstacles, Korean government have prepared new law which allows factor's own notification of assignment (and thereby reimbursement right) to debtor with some evidences.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.65-75
• /
• 2008

Over the last three decades, there are many researches focusing on the practice and theory of RM in airlines. Most of them have dealt with a seat assignment problem for maximizing the total revenue. In this study, we focus on a seat assignment problem in airlines. The seat assignment problem can be modeled as a stochastic programming model which is difficulty to solve optimally. However, with some assumptions on the demand distribution functions and a linear approximation technique, we can transform the complex stochastic programming model to a Linear Programming model. Some computational experiments are performed to evaluate out model with randomly generated data. They show that our model has a good performance comparing to existing models, and can be considered as a basis for further studies on improving existing seat assignment models.

• 대한수학회논문집
• /
• 제17권2호
• /
• pp.321-330
• /
• 2002

Consider the random assignment (or bipartite matching) problem with iid uniform edge costs t(i, j). Let $A_{n}$ be the optimal assignment cost. Just recently does Aldous [2] give a rigorous proof that E $A_{n}$ longrightarrowζ(2). In this paper we establish the upper and lower bounds for Var $A_{n}$ , i.e., there exist two strictly positive but finite constants $C_1$ and $C_2$ such athat $C_1$ $n^{(-5}$2)/ (log n)$^{(-3}$2)/ $\leq$ Var $A_{n}$ $\leq$ $C_2$ $n^{-1}$ (log n)$^2$.EX>.