ISSN: 0304-128X ISSN: 2233-9558
Copyright © 2024 KICHE. All rights reserved

Articles & Issues

Conflict of Interest
In relation to this article, we declare that there is no conflict of interest.
articles 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

다목적 회분공정의 최적생산계획을 위한 조업완료시간의 순환수학적표현법

A Recursive Formulation of Completion Times Algorithm for Optimal Scheduling of Multi-purpose Batch process

HWAHAK KONGHAK, June 1999, 37(3), 411-416(6), NONE
downloadDownload PDF

Abstract

최근 소비자의 기호와 수요가 짧은 시간 내에 변화하고 제품의 수명이 짧아짐에 따라 반연속 및 회분공정에 대한 연구가 늘어나고 있다. 회분공정은 효율 면에서 연속 공정보다 낮다. 그러한 이유로 대부분의 회분공정에 대한 연구는 생산성 증가에 대한 부분으로 초점이 맞추어졌다. 회분식 공정의 한 종류인 다품종 회분식 공정의 조업연구가 활발하였던 것에 비해 다목적 공정에 대해 발표된 논문은 적었다. 그 이유는 다목적 회분식 공정이 다품종 회분식 공정에 비해 복잡하기 때문이다. 그러나 최근 각광받는 전자, 의약 ,정밀화학 등의 분야에서의 다품종 소량 생산의 유형이 다목적 공정 조업화 되어감에 따라 다목적 회분공정의 연구분야는 많은 연구가 필연적인 분야가 되었다. 이런 연구에 대해 조업완료시간 알고리즘은 필연적으로 요구된다. 본 논문에서는 수송시간과 준비시간을 고려한 비순차(non-sequential) 다목적 회분식 공정의 조업완료시간을 순환수식(recursive formulation)으로 표현하고 그 수식을 여러 예제들을 통해 검증해 보았다. 그리고 수식의 순서도 및 계산 결과에 대한 Gantt Chart를 나타내었다. 처리시간, 준비시간 및 수송시간은 난수 발생기에 의해 생성시켰다.
Recently, as the taste of consumers and the demand of products are changed within short period and the life cycle of products is shortened, the operation of semicontinuous and batch processes have been studied more frequently over the past decade. In general, the productivity of batch process is lower than that of continuous process. For these reason most of researches in batch process are focused on increasing the productivity. The study of operation of batch processes used to be classified as two category; multi-product batch process and multi-purpose batch process. Between them, multi-product processes were actively studied, but only a few papers about the multi-purpose batch plants were presented. Because the operation of multi-purpose batch process is more complicated than that of multi-product batch plant. In this paper we presented completion times algorithm of non-sequential multi-purpose batch process[13] with non-zero transportation times and set-up times as a recursive formulation. We also described the formulation by computer program and flowchart and the results of calculation by gantt chart and processing map. For testing the proposed formulation, we applied them to several problems which are composed of randomly generated processing times, set-up times and transfer times.

References

Rajagopalan D, Karimi IA, Comput. Chem. Eng., 14, 49 (1990) 
Kondili E, Pentelides CC, Sagent RWH, Comput. Chem. Eng., 17, 229 (1993) 
Ku HM, Karimi I, Comput. Chem. Eng., 14, 49 (1990) 
Lee IB, Jung JH, Yang DR, Chang KS, FOCAPO '93, U.S.A. (1993)
Jung JH, Lee HK, Lee IB, Comput. Chem. Eng., 20(6-7), 845 (1996) 
Jung JH, Lee HK, Yang DR, Lee IB, Comput. Chem. Eng., 18(6), 537 (1994) 
Graells M, Espuna A, Puigjaner L, Comput. Chem. Eng., 20(S), 1137 (1996) 
Kim M, Jung JH, Lee IB, Comput. Chem. Eng., 20(S), 1149 (1996) 
Grau R, Espuna A, Puigjaner L, Comput. Chem. Eng., 20(S), 1143 (1996) 
Hasebe S, Hashimoto I, Proc. 4th Intl. Symp. on Proc. Systems Engng, Canada (1991)
Johnson SM, Naval Res. Logistics Quarterly, 1, 1 (1954)
Niwa T, Proc. Fourth Intl. Symp. on Proc. Systems Engng., Montebello, Canada (1991)
Voudouris VT, Grossmann IE, Comput. Chem. Eng., 20(11), 1335 (1996) 
Wiede W, Kuriyan K, Reklaitis GV, Comput. Chem. Eng., 11, 337 (1987) 
Wiede W, Reklaitis GV, Comput. Chem. Eng., 11, 345 (1987) 
Wiede W, Reklaitis GV, Comput. Chem. Eng., 11, 357 (1987) 
Kim HJ, Jung JH, Kim M, Lee IB, Korean J. Chem. Eng., 14(4), 225 (1997)
Ha JK, Lee BS, Lee IB, Lee ES, HWAHAK KONGHAK, 36(5), 813 (1998)
Yamalidou EC, Patsidou EP, Kantor JC, Comput. Chem. Eng., 14, 281 (1990) 

The Korean Institute of Chemical Engineers. F5, 119, Anam-ro, Seongbuk-gu, 233 Spring Street Seoul 02856, South Korea.
Phone No. +82-2-458-3078FAX No. +82-507-804-0669E-mail : kiche@kiche.or.kr

Copyright (C) KICHE.all rights reserved.

- Korean Chemical Engineering Research 상단으로