• Management Science and Financial Engineering
• /
• v.2 no.1
• /
• pp.19-51
• /
• 1996

We suggest a distributed framework for task assignment in the computer-controlled shop floor where each of the resource agents and part agents acts like an independent profit maker. The job allocation problem is formulated as a linear programming problem. The LP formulation is analyzed to provide a rationale for the distributed task assignment procedure. We suggest an auction based negotiation procedure including a price-based bid construction and a price revising mechanism. The performance of the suggested procedure is compared with those of an LP formulation and conventional dispatching procedures by simulation experiments.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.47-53
• /
• 1995

The Generalized Assignment (GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. Then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.491-493
• /
• 1999

In this paper, we consider the design of robust pole assignment for linear system. Considered uncertainty is time-varying uncertainty. Based on Lyapunov stability theorem and linear matrix inequality(LMI) we present the design result for pole assignment. Finally, we give some numerical examples to show the applicability and usefulness of our presented results.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.920-925
• /
• 1993

For a multi-input, multi-output system, it is widely known that feedback control gain presents extra freedom pole placement problem. An eigenstructure assignment utilizes this freedom for assignment of all or some elements of the closed-loop eigenvectors. In this paper, a nonlinear optimization technique is adopted to obtain a small gain controller that assigns closed-loop eigenvalues and elements of eigenvectors simultaneously. To illustrate the approach, a numerical example of the Airplane mode decoupling using an advanced fighter is shown.

• Journal of Industrial Technology
• /
• v.22 no.B
• /
• pp.71-78
• /
• 2002

The objective of this paper is to develop an efficient genetic algorithm (GA) to find a channel assignment method for minimum interference among the channels within reasonable time. The series of specific channel number is used as a representation of chromosome. We use minimum-channel-distance encoding scheme within the same cell to consider cosite channel interference (CSI) when chromosomes are generated. The cell base crossover is also used. This proposed method improves solution quality within limited time.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.62-65
• /
• 1989

Optimizing transient response for both tracking reference signals and disturbance rejection is determined by the poles and zeros of the transfer function. Thus, optimal pole assignment and how should weighting matrix for the performance index be chosen is very important to achieve optimum transient response. This paper focus its attention on the choosing and analysis of weighting matrix for optimum pole assignment. Optimum pole assignment is defined for linear time-invariant continuous systems.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.407-410
• /
• 1989

Optimizing transient response for both tracking reference signals and disturbance rejection is determined by the poles and zeros of the transfer function. Thus, optimal pole assignment and how should weighting matrix for the performance index be chosen is very important to achieve optimum transient response. This paper focus its attention on the choosing and analysis of weighting matrix for optimum pole assignment. Optimum pole assignment is defined for linear time-invariant continuous systems.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.589-591
• /
• 1999

In this paper, we consider the robust pole assignment for linear system with time-varying uncertainty. The considered uncertainty is an unstructured uncertainty. Based on Lyapunov stability and linear matrix inequality technique, we present a condition that guarantees the robust pole assignment inside a circular disk and the robust stability of uncertain linear systems. Finally, we show the usefulness of our results by an example.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1030-1033
• /
• 2006

In this paper, the assignment problem is considered. We propose an approach based on the solution of a sequence of shortest path sub-problem. We extend the cost reduction method, which is used for finding initial assignment, to solve these sub-problems. The use of the extended reduction method makes it possible to devise an efficient multi-augmenting algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.901-905
• /
• 1992

The manual procedure of drafting engineering design is fast becoming obsolete. One of the important areas in CAPP is to automate tolerance assignment which is encountered in mechanical part design. This paper presents an approach for automating tolerance assignment using CAD database and tolerancing database in CAD drawing. The system is consisted of four major functions feasture extraction, feaure inferencing, rule-based tolerance allocation, and automatic upating. Auto CAD R.II is employed as CAD system and a computer progran is developed by using Auto LISP on PC-386.