• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.13-20
• /
• 1994

We consider the satellite cluster scheduling problem which is one of the most interesting problems in satellite communication scheduling area. This problem is known to be NP-complete and a couple of heuristic algorithms had been developed. In this paper, we suggest another algorithm for this problem which has the same computational complexity as the best existing one and provides much better solution quality. Extensive computational simulation results are reported.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.192-199
• /
• 2007

This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence optimization to reduce the overall assembly time. Comparative simulation results are finally presented to verify the usefulness of the proposed method.

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.65-72
• /
• 1998

Many optimization problems like domination and Steiner tree are NP-complete on chordal graphs but can be solved in polyno-mial time on doubly chordal graphs. Investigating properties of dou-bly chordal graphs probably help to design efficient algorithms for the graphs. We present some characterizations of dobly chordal graphs which are based on clique matrices and neighborhood matrics also men-tioned how a doubly perfect elimination ordering of a doubly chordal graph can be computed from the results.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.283-285
• /
• 2002

조합 경매는 구매자들이 원하는 상품들을 조합해서 입찰할 수 있는 경매다. 그러나 판매자의 이익을 최대로 하는 승자를 결정하는 문제는 NP-complete이다. 분기 한정법(branch and bound)을 사용해서 최적의 승자를 찾을 때, 어떤 비드(bid)를 선택해서 분기할 것인가를 결정해야 한다. 이 때, 비드를 선택하는 휴리스틱이 분기 한정법의 성능을 결정하는 중요한 역할을 한다. 본 논문에서는 조합경매의 승자를 결정하기 위해서 분기 한정법과 Linear Programming을 사용할 때, 분기할 비드와 충돌하는 비드들을 동시에 고려하는 비드 선택 휴리스틱을 제안한다. 실험을 통해서 제시하는 휴리스틱의 성능이 우수함을 보였다.

• Korean Management Science Review
• /
• v.24 no.2
• /
• pp.33-42
• /
• 2007

In this paper we consider an alternate m machine scheduling problem in which each job having at most two eligible machines should be assigned with the objective of makespan minimization. For this problem. we propose a $O(m2^m)$ time rounding algorithm with performance ratio at most 1.5. For a little general problem where each job can be processed in at most three machines, we prove that a polynomial time algorithm does not exist with performance ratio less than 1.5.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.192-200
• /
• 1994

Gupta defined deadlocks in the blocks world and proved that decision making problem in the blocks world is NP-Complete. The types of deadlocks are classified and the properties of deadlocks are analyzed in this paper. The heuristic planner algorithm for the limited table-capacity blocks world using both the inverse position of the block and properties of deadlocks is designed and its performance is also evaluated.

• IE interfaces
• /
• v.12 no.1
• /
• pp.19-25
• /
• 1999

The time slot scheduling problem for a satellite cluster with an arbitrary number of satellite is considered, which is one of the most interesting problems in the satellite communication scheduling area. This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, a new efficient algorithm is suggested, which has lower computational complexity and provides much better solution than other existing algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.52
• /
• pp.109-116
• /
• 1999

Flow Shop with Multiple Processors(FSMP) scheduling involves sequencing jobs in a flow shop where, at any processing stage, there exists one or more identical processors. Any methodology to determine the optimal mean flow time for this type of problem is NP-complete. This necessitates the use of sub-optimal heuristic methods to address problems of moderate to large scale. This paper presents global lower bounds on FSMP mean flow time problems which may be used to assess the quality of heuristic solutions when the optimal solution is unknown.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.4
• /
• pp.59-65
• /
• 2008

전문가시스템의 성공을 좌우하는 지식추출은 주요 애로공정 중의 하나로 알려져 있다 설상가상으로 전문가의 부재, 새로운 또는 복잡한 문제 등 영역의 특성상 전문가시스템 개발은 실패할 수 있다. 이러한 문제점을 극복하기 위하여 본 논문에서는 KACE 구조를 제안하였다 본 구조는 작업 발생기, 작업 실행기, 작업 평가기, 규칙 발생기와 전문가시스템 등 5개의 주요 요소로 구성되어 있다. 이 구조를 이용하여 NP-complete인 일정계획 문제에 대한 전문가시스템이 어떻게 구축될 수 있는가를 예시하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.751-753
• /
• 2003

약물의 화학구조와 약리작용간의 관계는 'Medicinal Chemistry'에서 활발히 연구된다. 이에 도움이 되는 분야로 수많은 약물들에서 사용자가 지정한 구조를 부분구조로 가지는 약물들을 자동으로 빠르게 찾아내는 부분구조검색(Substructure Searching)이 있다. 1950년대부터 연구된 앞의 문제는 NP-Complete이나 미리 인덱스를 두어 성능을 높인 RS3 시스템(http://www.acelrys.com/rs3)이 미국 특허를 받았다. 이 시스템은 화학구조에 대한 설명을 대용량으로 기술하여 이를 RDBMS에 저장하고 검색하는 시스템이다. 하지만 이 시스템은 재현율(Recall)과 정도(Precision)가 매우 낮으므로, 본 논문에서는 새로운 인덱스를 개발하여 재현율과 정도를 향상시킨 기법을 제시한다.