• 산업경영시스템학회지
• /
• 제10권16호
• /
• pp.133-141
• /
• 1987

Man-machine assignment problem with random service and processing times is considered in this paper. Assuming heterogeneous semi-automatic machines, the problem is dealt with as follow; 1. For the different type of machines that have probabilistics distribution of processing time and nan service time, man·machine assignment problem is solved by heuristic method using expected time value if machine. 2. Since each related time is a random variable, the performance of the optimal assignment obtained from the above method is verified through monte carlo simulation method. 3. The above procedures are programed by BASIC language to use easily and rapidly in the personal computer. The result of this study can contribute to productivity enhancement by increasing the efficiencies of both operators and machines.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.601-604
• /
• 1997

In this paper, a pole assignment problem in the unit disk for a linear discrete system is discussed. The analysis is based on the Luenberger's canonical form and Gershgorin's disk. The proposed method for pole assignment is convenient for a linear time invariant discrete system.

• 산업기술연구
• /
• 제22권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.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• 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.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2002년도 추계학술대회 논문집(I)
• /
• pp.349-356
• /
• 2002

This paper describes a mathematical programming model for constructing the rolling stock assignment plan. This plan is a schedule which assigns daily routings, maintenance activities, and other tasks to trainsets. A generalized set partitioning model which is a kind of integer programming model is suggested as a model for constructing the assignment plan. And a column generation method are suggested as a solution method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.5-7
• /
• 2004

Significant progress has been achieved in the active control of civil-engineering structures, not only in the control algorithm, but also in control testing of the scaled model and full-scale building. At the present time, most algorithms used in the active control of civil engineering structures are based on the various active control techniques. In this paper represents active control method, by using pole assignment for reducing structural vibration under excited load. Numerical simulations are performed to assess the effectiveness of pole assignment control system. The relative displacement of structure system is significantly reduced.

• 전자공학회논문지C
• /
• 제34C권12호
• /
• pp.1-8
• /
• 1997

In this paper, a new method of state code assignment for reduction of switching activities of state transition in asynchronous circuits is proposed. The algorithm is based on a on-hot code and modifies it to reduce switching activities. To estimate switching activities as a cost functions we introduce state transition probability (STP). AS a results, the proposed algorithm has an advantage of 60% over with the conventional code assignment in terms of switching and code length of state assignment.

• 정보처리학회논문지C
• /
• 제11C권2호
• /
• pp.203-212
• /
• 2004

최근 이동통신 네트워크에서 채널의 수요는 폭발적으로 증가하고 있다. 그렇지만 수요에 맞는 충분한 채널을 제공하기는 힘든 것이 현실이다. 이러한 수요를 충족시키기 위하여는 채널들을 간섭 현상이 없도록 재사용 함으로써 효율적으로 이용할 수 있도록 각 셀의 수요에 맞게 최적으로 할당하는 것이 요구된다. 본 논문의 목적은 이동통신 서비스 지역에 따라 채널 수요에 대한 변화가 불확실하고, 시간에 따라 변화가 심한 이동통신 네트워크에서 각 셀이 채널을 필요로 할 때 필요한 채널 수만큼을 동적으로 빠른 시간에 최적 할당하는 것이다. 이 목적을 달성하기 위하여 휴리스틱 알고리즘(Heuristic Algerian)을 사용하여 채널간의 간섭 정도를 최소화하는 동적 채널 할당방법을 개발하였다.

• 제어로봇시스템학회논문지
• /
• 제6권10호
• /
• pp.845-853
• /
• 2000

In this paper, we introduce a relationship between the sensitivity and the robustness of a system, and we propose a robust eigenstructure assignment scheme using a novel performance index which can consider the performance and the robustness of the system simultaneously. We also propose an assignment accuracy measure and a robustness measure which are used for the performance examination of the proposed robust eigenstructure assignment scheme. The usefulness of the proposed algorithm and the measures are verified by applying to controller design of a simple numerical example and the EMRAAT missile.

• Journal of Advanced Marine Engineering and Technology
• /
• 제38권10호
• /
• pp.1340-1346
• /
• 2014

Previous studies of reliable server assignment considered only to assign the same cost of server, that is, homogeneous servers. In this paper, we generally deal with reliable server assignment with different server costs, i.e., heterogeneous servers. We formulate this problem as a nonlinear integer programming mathematically. Our problem is defined as determining a deployment of heterogeneous servers to maximize a measure of service availability. We propose two metaheuristic algorithms (tabu search and particle swarm optimization) for solving the problem of reliable server assignment. From the computational results, we notice that our tabu search outstandingly outperforms particle swarm optimization for all test problems. In terms of solution quality and computing time, the proposed method is recommended as a promising metaheuristic for a kind of reliability optimization problems including reliable sever assignment and e-Navigation system.