• 한국경영과학회지
• /
• 제14권1호
• /
• pp.31-31
• /
• 1989

The Generalized Assignment Problem(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.

• International Journal of Control, Automation, and Systems
• /
• 제5권6호
• /
• pp.607-613
• /
• 2007

Eigenstructure assignment provides the advantage of allowing great flexibility in shaping the closed-loop system responses by allowing specification of closed-loop eigenvalues and corresponding eigenvectors. But, the general eigenstructure assignment methodologies cannot guarantee stability robustness to parameter variations of a system. In this paper, we present a novel method that has the capability of exact assignment of an eigenstructure which can consider the probability of instability for LTI (Linear Time-Invariant) systems. The probability of instability of an LTI system is determined by the probability distributions of the closed-loop eigenvalues. The stability region for the system is made probabilistically based upon the Monte Carlo evaluations. The proposed control design method is applied to design a flight control system with probabilistic parameter variations to confirm the usefulness of the method.

• IEIE Transactions on Smart Processing and Computing
• /
• 제6권3호
• /
• pp.151-157
• /
• 2017

Management optimization is very important in tourism, especially when it is related to productivity. One of the problems in management optimization is tour guide assignment. Well-arranged tour guide assignment will increase productivity while maintaining service quality. A cellular genetic algorithm is one of the methods that can be used to solve this problem. Furthermore, previous study has shown that a cellular dimension increase can lead to promising benefits for certain problems. The objective of this research is to give a clear understanding of the advantages of increasing cellular dimensionality on the tour guide assignment problem by using a cellular genetic algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.72-75
• /
• 2004

In this paper, the task assignment strategy considering communication delay and the priority of distributed tasks is proposed for the real-time network system in order to maximize the utilization of the system. For the task assignment strategy, the relationship among priority of tasks in network nodes, the calculation time of each task, and the end-to-end response time including the network delay is formulated firstly. Then, the task assignment strategy using the genetic algorithm is proposed to optimize the utilization of the system considering the LCM(Least Common Multiple) period. The effectiveness of proposed strategy is proven by the simulation for estimating the performance such as the utilization and the response time of the system in case of changing the number of tasks and the number of network nodes.

• 대한수학회논문집
• /
• 제17권4호
• /
• pp.719-729
• /
• 2002

Consider the random n $\times$ m assignment problem with m $\geq$ $_{i,j}$ Let $u_{i,j}$ be iid uniform random variables on [0, 1] and exponential random variables with mean 1, respectively, and let $U_{n, m}$ and $T_{n, m}$ denote the optimal assignment costs corresponding to $u_{i, j}$ and $t_{i, j}$. In this paper we first give a comparison result about the discrepancy E $T_{n, m}$ -E $U_{n, m}$. Using this comparison result with a known lower bound for Var( $T_{n, m}$) we obtains a lower bound for Var( $U_{n, m}$). Finally, we study the way that E $U_{n, m}$ and E $T_{n, m}$ vary as m does. It turns out that only when m - n is large enough, the cost decreases significantly.tly.

• 제어로봇시스템학회논문지
• /
• 제7권8호
• /
• pp.641-646
• /
• 2001

Eigenstructure assignment is a typical method with the capability of consideration of the time-domain specifications in designing a linear control system. In this paper, we propose a new method for eigenstructure to achieve desired eigenvectors more precisely than with the conventional method. In the proposed method, the conventional eigenstructure assignment problem is interpreted as a constrained optimization one, and it converted into an unconstrained optimization problem to deal with the problem easily. Numerical examples are presented to illustrate the proposed flexible eigenstructure assignment method.

• 산업공학
• /
• 제18권4호
• /
• pp.504-511
• /
• 2005

The NP-hard channel assignment problem becomes more and more important to use channels as efficiently as possible because there is a rapidly growing demand and the number of usable channel is very limited. The hybrid genetic and local search (HGLS) method in this paper is a hybrid method of genetic algorithm with no interference channel assignment (NICA) in clustering stage for diversified search and local search in tuning stage when the step of search is near convergence for minimizing blocking calls. The new representation of solution is also proposed for effective search and computation for channel assignment.

• 대한산업공학회지
• /
• 제27권4호
• /
• pp.384-393
• /
• 2001

The performance of a double carousel system depends on its design and operation strategy. The two-class based assignment policy is expected to be an appropriate storage policy for its efficient operation, since it has two independently-moved carousels, lower and upper sub-carousels. This paper conducts a comparative analysis of the effects of the two-class based assignment policy and those of randomized assignment policy on the throughput of a double carousel system. We also show that, by allowing the sub-carousels not to be equal in size, a further improvement in the throughput can be obtained.

• 한국국방경영분석학회지
• /
• 제17권1호
• /
• pp.159-176
• /
• 1991

The probability of target survival is the most important factor in the target assignment, Most of the studies about it have assumed the case of one target and ane weapon type. Therefore, they can not be applied to the real situation. In this paper. the quantity and type of enemy assets of the friendly force are considered simultaneously. Considered defense type is the coordinated defense with no impact point prediction. The objective function is to minimize the expected total survival value of targets which are scattered in the defense area. The rules of aircraft assignment are as follows : first, classify targets into several groups, each of those has the same desired damage level secondly. select the critical group which has the least survival value in accordance with the additional aircraft assignment, and finally. assign the same number of attack assets against each target in the critical group. In this paper, the attack assets, the escort assets, and the defense assets are considered. The model is useful to not only the simple aircraft assignment problem but also the complicated wargame models.

• 제어로봇시스템학회논문지
• /
• 제5권7호
• /
• pp.777-786
• /
• 1999

This work is concerned with the assignment of the desired eigenstructure for linear time-varying systems such as missiles, rockets, fighters, etc. Despite its well-known limitations, gain scheduling control appeared to be the focus of the research efforts. Scheduling of frozen-time, frozen-state controller for fast time-varying dynamics is known to be mathematically fallacious, and practically hazardous. Therefore, recent research efforts are being directed towards applying time-varying controllers. In this paper, ⅰ) we introduce a differential algebraic eigenvalue theory for linear time-varying systems, and ⅱ) we also propose an eigenstructure assignment scheme for linear time-varying systems via the differential Sylvester equation based upon the newly developed notions. The whole design procedure of the proposed eigenstructure assignment scheme is very systematic, and the scheme could be used to determine the stability of linear time-varying systems easily as well as provides a new horizon of designing controllers for the linear time-varying systems. The presented method is illustrated by a numerical example.