• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.825-827
• /
• 1989

A heuristic model which determines the scheduling of serial flowshops with minimization of the makespan is proposed for an idealized batch chemical plant. It generates an initial sequence by heuristic reasoning and improves it recursively until no improvement is possible. The heuristic reasoning is based on Johnson's Rule which gives the sequence with the minimum makespan for a two-unit flowshop. The evolutionary step searches the neighborhood of the current sequence for sequences with lower makespan. The robustness of this model is also examined by comparing the minimum makespan of literature examples with the theoretical one.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.165-180
• /
• 1998

To make a scheduling for minimizing the tardiness of delivery, we present an efficient heuristic algorithm for job-shop scheduling problems with due dates. The SDME(Slack Degree Modified Exchange) algorithm, which is the proposed heuristic algorithm, carries out the operation in two phases. In the phase 1, a dispatching rule is employed to generate an active or non-delay initial schedule. In the phase 2, tasks selected from a predetermined set of promising target operations in the initial schedule are tested to ascertain whether, by left-shifting their start times and rearranging some subset of the remaining operations, one can reduce the total tardiness. In the numerical example, the results indicate that the proposed SDME algorithm is capable of yielding notable reductions in the total tardiness for practical size problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.62
• /
• pp.97-109
• /
• 2001

This research is concerned with jobshop scheduling problem for an advanced manufacturing system like flexible manufacturing which consists of two machine centers and a single automated guided vehicle(AGV). The objective is to develop and evaluate heuristic scheduling procedures that minimize makespan to be included travel time of AGV. A new heuristic algorithm is proposed and illustrates the proposed algorithm. The heuristic algorithm is implemented for various cases by SLAM II. The results show that the proposed algorithm provides better solutions in reduction ratio and frequency than the previous algorithm.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.3
• /
• pp.87-94
• /
• 2003

When faults occur in a distribution network, blackout loads must be restored as fast as possible to minimize interruption of electric service. This paper presents an expert system to restore distribution networks. The system is designed to minimize switching operations in a heuristic sense by using heuristic rules. The restoration process is converted to the feasible path finding problem in the state space of expert system by application of general topological knowledge base. Multiple load transfer algorithm is proposed to deal with complex situations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.9
• /
• pp.877-882
• /
• 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 regulation and supervision and turning for D.C. servo motor speed control. 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 robust and accurate control function is confirmed by computer simulation..

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.44
• /
• pp.135-151
• /
• 1997

In this paper, we propose a simple and relatively efficient heuristic method to determine job sequencing in the flow-shop considering multiple criteria such as processing time, due date and cost. The proposed method is applicable to the flow- shop where the jobs are released simultaneously and their processing sequence is predetermined and not changed until the whole jobs are processed. To develop this method, we mixed and modified some well-known multi-attribute decision heuristics such as the simple linear weighting scheme, the lexicographic rule and the 'elimination by aspect' rule. Some computer simulations were conducted to test the efficiency of the proposed method and it has been compared with the SWPT (Shortest Working Processing Time) rule and EDD (Earliest Due Date) rule. The results show that our method is as effective as the traditional ones in terms of mean flow time, tardiness, makespan, cycle time, machine utilization, etc., and proved to be much simpler and more flexible to be used in real situations.

• Journal of Digital Convergence
• /
• v.11 no.11
• /
• pp.443-448
• /
• 2013

Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the total frequency of visits of the currently selected node in the previous iteration. I used the ACS algoritm using subpath for search. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.8
• /
• pp.92-98
• /
• 1995

The position control of flexible joint manipulator is investigated by applying the self-organizing fuzzy logic controller (SOC) proposed by Procyk and Mamdani. The SOC is a heuristic rule-based controller and a further extension of an ordinary fuzzy controller, which has a hierachy structrue which consists of an algorithm being identical to a fuzzy controller at the lower ollp and a learning algorithm accomodating the performance evalution and rule modification function at the upper ollp. This form of control can be used in those complex systems which have been too difficult to control or which in the past have had to rely on the experience of a human operator. Even though the significant dynamic coupling of the motors and links on the flexible joint manipulator, the performance of command-following is good by applying the proposed SOC.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.321-324
• /
• 2000

조합 최적화 문제인 Traveling Salesman problems(TSP)을 Genetic Algorithm(GA)[3]과 Local Search Heuristic Algorithm[8]을 이용하여 접근하는 것은 최적해를 구하기 위해 널리 알려진 방법이다. 본 논문에서는 TSP문제를 해결하기 위한 또 다른 접근법으로, 다수의 Ant들이 Tour들을 찾는 ACS(Ant Colony System) Algorithms[4][6][7]을 소개하고, ACS에서 Global Optima를 찾는 과정에서, 이미 이루어져 있는 Ant들의 Tour결과들을 서로 비교한다. Global Updating Rule에 의해 Global Best Tour 에 속해 있는 각 Ant Tour의 edge들을 update하는 ACS Algorithm에, 각 루프마다 Ant Tour들을 우성과 열성 인자들로 구분하고, 각각의 우성과 열성 인자들에 대해서 Global Updating Rule에 기반한 가중치를 적용(Weight Updating Rule)하므로서 기존의 ACS Algorithm보다 효율적으로 최적 해를 찾아내는 방법에 대해서 논하고자 한다.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.775-777
• /
• 1998

The Ziegler-Nichols parameter tuning has been widely known as a fairly heuristic method to good determine setting of PID controllers, for a wide range of common industrial processes. We extract process knowledge required for rule base controller through tuning experiment and simulation study, such as set point weighting and normalised gain and dead time of process. In this paper, we presents a rule base PID controller by extracted process knowledge and the modified Ziegler-Nichols tuning. Computer simulation are provided demonstrate the feasibility of this approach.