• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.93.2-93
• /
• 2001

This paper presents the implementation of fuzzy PI gain scheduling controller (FPICGS) for controlling flexible joint robot arms with uncertainties from time-varying load. The term FPICGS is called based on a combination of fuzzy PI control scheme with a set of rule bases. Principle of design for a FPICGS is given along with the implementation of the designed computer aided control system. The experiment reveals an effectiveness of the proposed control scheme for flexible joint robot arms driven by a DC motorhooked with a spring which both parameters are completely unknown parameters ...

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.343-348
• /
• 1988

This paper describes an application of the periodic scheduling policy to a class of flexible manufacturing systems. A heuristic algorithm is used to determine when each part should be loaded into the system. Simulation results based on a detailed model of metal-working manufacturing facility are presented.

• Journal of the Korean Society for Precision Engineering
• /
• v.5 no.2
• /
• pp.7-14
• /
• 1988

작업물(Work)을 기계에 장입출, 가공에 필요한 공구류의 공급 등이 완전 자동화 된 기존의 사출성형기 Series를 제조하는 FA Systme은, MAP 대응의 FA System 으로 개량되었다. 이 논문은, MAP 대응 새 FA 시스템의 MAP에서 분산.통괄의 역할을 하도록 개발된 Cell controller의 정보관리기능 가운데 하나의 응용으로서 제조공정을 자동적으로 Scheduling 하는데 Expert 시스템(전문가시스템)을 적용한 idea를 소개하는 것이다. 이 idea의 적용 으로 인하여 제조공정의 scheduling 작염은 종래의 주단위로 부터 일일단위의 작업으로 처리가 가능해졌고, 또, 공구수명관리기능의 부가로 무인운전시의 기계의 가공율도 종래보다도 녹일 수가 있었다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.22
• /
• pp.35-42
• /
• 1990

This paper deals with a single machine scheduling problem with a quadratic penalty function of completion times. The objective is to find a optimal sequence which minimizes the total penalty. A new type of node elimination procedure and precedence relation is developed that determines the ordering between adjacent jobs and is incorporated into a branch and bound algorithm. In addition, modified penalty function is considered and numerical examples are provided to test the effectiveness of the optimum algorithm.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.203-205
• /
• 1999

The unit commitment is an important problem of production scheduling which determines the generating unit to in service(on/off) during scheduling period, to meet system demand and reserve requirement at minimum cost. This paper presents an box type crossover to improve searching ability of GA, to solve unit commitment problem. Satisfactory results are obtained by GA with the proposed crossover operator.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.855-858
• /
• 1988

Two methods for probabilistic maintenance scheduling are developed and compared ; one with operation and supplied-shortage cost and other with risk level of LOLP. Based on the real economic power dispatch, quadratic optimal maintenance conditions are obtained and simple amtrix equations are suggested for solutions. Both methods are compared in a sample system of 26,000 [MW] peak and 32,000 [MW] generation capacity.

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

A modified simulated annealing algorithm is proposed and applied to the permutation flowshop scheduling with the makespan objective. Based on the job deletion and insertion method, a newly defined Max-min perturbation scheme is proposed to obtain a better candidate solution in the simulated annealing process. The simulation experiments are conducted to evaluate the effectiveness of the proposed algorithm against the existing heuristics and results are reported.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.16 no.28
• /
• pp.165-171
• /
• 1993

The algorithm of Giffler and Thompson is modified for solving job shop scheduling problems related to the overlapping production The start-lag and stop-lag are also applied New priority rules for the overlapping production are proposed and the efficiency of them is compared with that of the classical priority rules.

• Proceedings of the KSR Conference
• /
• 2005.11a
• /
• pp.1130-1137
• /
• 2005

This paper addresses the mathematical model of the long-term track tamping scheduling problem in the railway system. The proposed model is analyzed in problem size, then three solution approaches (relaxation, decomposition, and heuristic) are presented at the sketch level.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.24
• /
• pp.111-121
• /
• 1991

This paper considers a non preemtive single processor scheduling problem in which each set have the two common due dates. The objective of the problem is to minimize the weighted mean absolute deviation of job completion times about such two common due dates under the assumption that each job has a different weight. Such a job sequence is an W-shaped sequence. We propose three heuristic solution methods based on several dominance conditions. Numerical examples are presented. The performance comparison is made among three heuristic scheduling procedures.