Articles & Issues
- Conflict of Interest
- In relation to this article, we declare that there is no conflict of interest.
- This is an Open-Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/bync/3.0) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright © KIChE. All rights reserved.
All issues
회분공정을 위한 동적생산계획 기법 개발
Development of Dynamic Scheduling Algorithms for Batch Processes
HWAHAK KONGHAK, June 1997, 35(3), 338-343(6), NONE
Download PDF
Abstract
기업의 경영 합리화 및 공정 효율 증대를 위하여 통합자동화시스템의 구축은 매우 중요하다. 이를 위해선 상부 생산계획 단계와 하부 순차제어 단계를 연결하고 그 두 단계간의 차이를 극복할 수 있는 동적생산계획 기법이 필요하다. 생산계획 단계에서는 최적 생산계획 수립을 위해 오랜 계산 시간이 필요하므로 공정 회란을 실시간으로 처리하기 어렵다. 이러한 문제를 해결하려면 경험법칙 등에 근거한 차선책을 신속히 제시함으로써 회분공정 시간 불일치를 바람직하게 조정하여 손실을 최소로 줄이는 동적생산계획 기법이 요구된다. 본 연구에서는 이러한 동적생산계획 기법으로서, DSMM(Dynamic Shift Modification Method) 과 PUOM(Parallel Unit Operation Method)의 두 가지 알고리즘을 개발하였다. 이 두 가지 동적생산계획 알고리즘은 예정된 생산계획에서 벗어난 조업 시간을 파악하여 가능한 한 원래의 생산계획과 비슷해지도록 조업 시간을 조정해주며, 또 조정된 생산계획을 통하여 어느 한 시점에서 생산완료시기를 항상 예측할 수 있게 해 주는 기능을 한다. 이러한 알고리즘을 다품종 회분식 샴푸 제조 공정에 적용하여 모사함으로써 그 타당성을 입증하였다.
Dynamic scheduling is very important in constructing CIM and improving productivity of chemical processing systems. Computation at the scheduling level requires mostly a long time to generate an optimal schedule, so it is difficult to immediately respond to actual process events in real-time. To solve these problems, we developed dynamic scheduling algorithms such as DSMM(Dynamic Shift Modification Method) and PUOM(Parallel Unit Operation Method). Their main functions are to minimize the effects of unexpected disturbances, to predict a makespan of the updated dynamic schedule and to modify schedule desirably in real-time responding to process time variations. As a result, the algorithms generate a new pertinent schedule in real-time which is close to the original schedule but provides an efficient way of responding to the variation of process environment. Examples in a shampoo production batch process illustrate the efficiency of the algorithms.
References
Huercio A, Espuna A, Puigjaner L, Comput. Chem. Eng., 19(S), 609 (1995)
Kanakamedala KB, Reklaitis GV, Venkatasubramanian V, Ind. Eng. Chem. Res., 33(1), 77 (1994)
Kuriyan K, Crooks C, Macchietto S, "Towards Integrationin Batch Process Engineering," Centre for Process Sysmtes Engineering, Imperial College (1992)
McDaniel G, "IBM Dictionary of Computing," McGraw-Hill, 478 (1994)
Strothman J, "Batch Standards Group Agrees on Terminology," InTech, August, 34 (1995)
Chua ES, "Integrated Management System for Multi-Purpose Batch Chemical Plants," Imperial College, Ph.D. Thesis (1995)
고대호, 문일, 한국자동제어학술회의논문집, 2, 874 (1994)
Lee HK, Jung JH, Moon I, Lee IB, HWAHAK KONGHAK, 33(1), 89 (1995)
Fisher TG, "Batch Control Systems: Design, Application and Implementation," ISA (1990)
Sumi T, Morimoto M, "Supervisory System for Batch Process," Proceedings of PSE'94, 507 (1994)
김민석, 이인범, 한국자동제어학술회의논문집, 2, 1133 (1995)
Sanmarti E, Espuna A, Puigjaner L, Comput. Chem. Eng., 19(S), 565 (1995)
Kanakamedala KB, Reklaitis GV, Venkatasubramanian V, Ind. Eng. Chem. Res., 33(1), 77 (1994)
Kuriyan K, Crooks C, Macchietto S, "Towards Integrationin Batch Process Engineering," Centre for Process Sysmtes Engineering, Imperial College (1992)
McDaniel G, "IBM Dictionary of Computing," McGraw-Hill, 478 (1994)
Strothman J, "Batch Standards Group Agrees on Terminology," InTech, August, 34 (1995)
Chua ES, "Integrated Management System for Multi-Purpose Batch Chemical Plants," Imperial College, Ph.D. Thesis (1995)
고대호, 문일, 한국자동제어학술회의논문집, 2, 874 (1994)
Lee HK, Jung JH, Moon I, Lee IB, HWAHAK KONGHAK, 33(1), 89 (1995)
Fisher TG, "Batch Control Systems: Design, Application and Implementation," ISA (1990)
Sumi T, Morimoto M, "Supervisory System for Batch Process," Proceedings of PSE'94, 507 (1994)
김민석, 이인범, 한국자동제어학술회의논문집, 2, 1133 (1995)
Sanmarti E, Espuna A, Puigjaner L, Comput. Chem. Eng., 19(S), 565 (1995)