• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.3
• /
• pp.65-77
• /
• 1994

There are so many situations in which production schedules need to be rescheduled, due to the uncertainty or dynamic characteristics existing in manufacturing environment. Under the circumstances, it is necessary to build a system which helps a schedule manager understand the dynamic situations and reflect his insight into the system easily. We developed a system that can improve a production schedule. The system consists of a schedule editor and a schedule generator. The schedule editor, a rule-based system, always keeps a schedule feasible by keeping track of local changes in the revised one. The schedule generator consists of a two-phase heuristic method. In the lst phase it generates a schedule by a priority rule with Giffler and Thompson algorithm then it improves the performance in terms of the makespan in the 2nd phase. Experimental results show that, most of the times, the system generates a better schedule than the one with ordinary priority rules only.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.2
• /
• pp.1-22
• /
• 1993

This paper deals with the problem of mixed model assembly line balancing. In mixed model assembly lines, tsks should be assigned to stations in such a manner that all stations have approximately the same amount of work on a production cycle basis. Further in balancing assembly lines, the related tasks, the performing task side and the team tasks should be considered to improve work methods, to give more job satisfaction to workers, and to allow greater flexibility in the design of assembly lines. In this paper, the heuristic dispatch assignment rule is developed to assign evenly tasks of each model to all stations. The heuristic method based on the assignment rule developed is presented for mixed model assembly line balancing with the considerations of the related tasks, the performing task side, and the team tasks. The proposed method is analyzed, and compared with other methods for line balancing.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.121-124
• /
• 1990

Distance relaying is one of the most commonly used protection schemes in the high voltage transmission systems. In this scheme, coordination between the primary and backup relays is very critical for the power system security. This paper reports an rule-based methodology for checking and correction of miscoordination problems in the distance relaying. Diagnosis rules achieving an accurate but simple checking have been developed through the geometric analysis of the impedance characteristics of the distance relays. Heuristic rules having the pratical power for miscoordination correction are suggested. The proposed method has proved very effective through the several case studies on the actual systems.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.4
• /
• pp.355-361
• /
• 1992

In this paper, some rules for auto- tuning of feedback-feedforward controller in variable load and disturbance are presented. The parameters of feedback PID controller are determined by heuristic rules based on input regulation experiment, and the parameters of feedforward controller are determined by result rules based on spectral factorization, minimum variance, and polynomial equation. These heuristic and result rules are used as an element of the feedback loop in an auto-tuning feedback-feedforward controller. The robust and accurate control performance is demonstrated by computer simulation.

• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.171-192
• /
• 1993

In this paper, a rule for dispatching operations, named the Most Dissimilar Resources (MDR) dispatching rule is presented. The MDR dispatching rule has been designed to maximize utilization of resources in a resource-constrained job shop with general precedence constraints. In shown that solving the above scheduling problem with the MDR dispatching rule is equivalent to multiple solving of the maximum clique problem. A graph theoretic approach is used to model the latter problem. The pairwise counting heuristic of computational time complexity O(n$^{2}$) is developed to solve the maximum clique problem. An attempt is made to combine the MDR dispatching rule with the existing look-ahead dispatching rules. Computational experience indicates that the combined MDR dispatching rules provide solutions of better quality and consistency than the dispatching rules tested in a resource-constrained job shop.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.6
• /
• pp.33-41
• /
• 2021

This paper proposes heuristic greedy algorithm that can be find the solution within polynomial time with solution finding rule for the capacitated minimum spanning tree(CMST) problem, known as NP-hard. The CMST problem can be solved by computer-aided meta-heuristic because of the Esau-Williams heuristic polynomial time algorithm has a poor performance. Nevertheless the meta-heuristic methods has a limit performance that can't find optimal solution. This paper suggests visual by handed solution-finding rule for CMST. The proposed algorithm firstly construct MST, and initial feasible solution of CMST from MST, then optimizes the CMST with the subtree gates more adjacent to root node. As a result of total 30 cases of OR-LIB 10 data, Q=3,5,10, the proposed algorithm gets the best performance.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.153-156
• /
• 2001

Fuzzy controllers also show good performance In case of the systems being nonlinear and difficult to solve. But these fuzzy controllers have problems which have to decide suitable rules and membership functions. In general we decide those using the heuristic methods or the experience of experts. Therefore, many researchers have applied genetic algorithms to make fuzzy rule automatically. In this paper, we suggest a new coding method and a new crossover method to maintain the good fuzzy rule base and the shape of membership

• Korean Management Science Review
• /
• v.26 no.3
• /
• pp.1-9
• /
• 2009

In this paper, we present mathematical models for the ring covering problems arising in the design of multi-ring WDM networks. Also, we present efficient algorithms to solve the suggested models. By the computational experiment, our model can solve the medium-sized networks efficiently and shows better performance than the existing heuristic method. Although we propose an efficient method for the column generation procedure, branching rule that does not destroy the column generation structure is unsolved. Further research is required to develop an effective branching rule.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.753-770
• /
• 1996

In order to reduce the number of rehandles during the loading operation of export containers in port container terminals, the storage location of each arriving container should be determined considering of its weight. We formulate the problem by a dynamic programming model to get the optimal storage location. And a heuristic rule is suggested in order to overcome computational difficulties of the optimization model. The performance of the rule is evaluated by comparing it with the result of DP model.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.34-36
• /
• 1991

The idea of expert control is to incoporate a rule based expert system in a feedback control system. In this paper, we present some heuristic rules about input requlation and supervision and turning for D.C servo motor speed control in variable. The expert auto-turning PID controller which heuristic rules are used as an element of the feedback control system is implemented with the numerical algorithms and heuristic logics. The accurate control function is confirmed by computer simulation.