• 한국경영과학회지
• /
• 제16권2호
• /
• pp.13-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• 호남수학학술지
• /
• 제14권1호
• /
• pp.107-121
• /
• 1992

In this paper, we consider an iterative algorithm for solving a new class of quasi complementarity problems of finding $u{\epsilon}R^{n}$ such that $g(u){\in}K(u)$, $Tu+A(u){\in}K^{*}(u)$, and < g(u), Tu + A(u) >=0, where T, A and g are continuous mappings from $R^{n}$ into itself and $K^{*}(u)$ is the polar cone of the convex cone K(u) in $R^{n}$. The algorithms considered in this paper are general and unifying ones, which include many existing algorithms as special cases for solving the complementarity problems. We also study the convergence criteria of the general algorithms.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제15권3호
• /
• pp.229-243
• /
• 2008

This paper is intended to clarify and verify two representation algorithms computing representations of elements of free groups generated by two linear fractional transformations. Moreover in practice some parts of the two algorithms are modified for computational efficiency. In particular the justification of the algorithms has been rigorously done by showing how both algorithms work correctly and efficiently according to inputs with some properties of the two linear fractional transformations.

• East Asian mathematical journal
• /
• 제17권1호
• /
• pp.57-70
• /
• 2001

In this paper, we introduce a class of generalized quasivariational inclusions for fuzzy mappings and show its equivalence with a class of fixed point problems. Using this equivalence, we develop the Mann and Ishikawa type perturbed iterative algorithms for this class of generalized quasivariational inclusions. Further, we prove the existence of solutions for the class of generalized quasivariational inclusions and discuss the convergence criteria for the perturbed algorithms.

• 대한산업공학회지
• /
• 제16권2호
• /
• pp.119-127
• /
• 1990

This paper deals with the production scheduling problems of a dedicated Flexible Manufacturing System. In this work, a new mathematical formulation is proposed and two heuristic algorithms which can generate real-time schedules are suggested. Example problems to demonstrate the good performance and the validity of these two proposed algorithms are also included.

• 대한수학회지
• /
• 제47권4호
• /
• pp.767-788
• /
• 2010

In this paper, we propose two limited memory BFGS algorithms with a nonmonotone line search technique for unconstrained optimization problems. The global convergence of the given methods will be established under suitable conditions. Numerical results show that the presented algorithms are more competitive than the normal BFGS method.

• 대한수학회논문집
• /
• 제11권3호
• /
• pp.575-584
• /
• 1996

We investigate how the code automorphism groups can be used to study such combinatorial objects as codes, finite projective planes and Hadamard matrices. For this purpose, we write down a computer program for computing code automorphisms in PASCAL language. Then we study the combinatorial properties using those code automorphism group algorithms and the relationship between combinatorial objects and codes.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.138-143
• /
• 1989

In considering the singularities of robot, singularity avoidance control of robot wrist is very important. Because it is more difficult structurally to exclude the wrist singularity than the arm singularity. Since control policies with Jacobian may bring about mathematical singularities, control policies with Euler parameters that never cause mathematical singularities are necessary. In this research, singular status of robot wrist was analyzed and control algorithms for 3 and 4 axes robot wrist were proposed. Application results of the proposed control algorithms to the path including singularity showed us usefulness and validity.

• 충청수학회지
• /
• 제22권2호
• /
• pp.141-148
• /
• 2009

We consider various algorithms calculating best onesided simultaneous approximations. We assume that X is a compact subset of $\mathbb{R}^{m}$ satisfying $X=\overline{intX}$, S is an n-dimensional subspace of C(X), and $\mu$ is any 'admissible' measure on X. For any l-tuple $f_1,\;{\cdots},\;f_{\ell}$ in C(X), we present various ideas for best approximation to F from S(F). The problem of best (both one and two-sided) approximation is a linear programming problem.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.641-651
• /
• 2011

In this paper, with use of the displacement matrix, two special matrices are constructed. By these special matrices the block decompositions of the block symmetric Hankel matrix and the inverse of the Hankel matrix are derived. Hence, the algorithms according to these decompositions are given. Furthermore, the numerical tests show that the algorithms are feasible.