Journal of Institute of Control, Robotics and Systems (제어로봇시스템학회논문지)

Institute of Control, Robotics and Systems (제어로봇시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Completion Time Algorithm in Multiproduct Batch Processes with Storage Time and Product Allocation Restriction in Intermediate Storage Tank

중간저장조의 저장시간과 저장제품의 제약을 고려한 다품종 회분공정의 조업완료시간 알고리듬

  • 하진국 (동국대학교 생명화학공학과) ;
  • 이경법 (부경대학교 응용화학공학부) ;
  • 이인범 (포항공과대학교 화학공학과) ;
  • 이의수 (동국대학교 생명화학공학과)
  • Published : 2003.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

The determination of completion time constitutes an important step in developing algorithms for short-term production scheduling. Existing completion time algorithms of multi-product batch processes often assume that intermediate storage tanks are always available when it is needed. In this paper, we consider a serial multi-product batch plants with ZW and NIS policy intermediate storge tank. We limit storage residence time and allocated products in the intermediate storage tank to minimize the quality change of the stored material as well as to reduce the clearing time during product change. A set of recurrence relations is suggested to calculate the completion times for the given batch sequence of products on all processing units. Also analytic solution for the suggested model is solved by a graphical method. The effectiveness of these results is proved by a few illustrative examples.

Keywords

References

  1. G. V. Reklaitis, 'Review of scheduling of process operation,' AIChE Symp. Ser., vol.78, pp. 119-133, 1982
  2. H. M. Ku, D. Rajagopalan, I. A. Karimi, 'Scheduling in batch processes,' Chem. Engng. Prog., vol. 83, pp. 35-52, 1987
  3. W. JR. Wiede, K. Kuriyan , G. V. Reklaitis, 'Determination of completion times for serial multiproduct processes3:mixed intermediate storage systems,' Comput. Chem. Engng., vol. 11, pp. 357-368, 1987 https://doi.org/10.1016/0098-1354(87)85017-2
  4. M. S. Kim, J. H. Jung, I. B. Lee, 'Optimal scheduling of multiproduct batch processes for various intermediate storage policies,' Ind. Eng. Chem. Res., vol. 35, no. 11, pp. 4058-4066, 1996 https://doi.org/10.1021/ie9601817
  5. J. H. Jung, H. K. Lee, I. B. Lee, 'Completion times and optimal scheduling for serial multi-product processes with transfer and set-up times in zero-wait policy,' Comput. Chem. Engng., vol. 18, no. 6, pp.537-544, 1994 https://doi.org/10.1016/0098-1354(93)E0009-X
  6. H. M. Ku, I. Karrimi, 'Completion time algorithms for serial multiproduct batch processes with shard storage,' Comput. Chem. Engng., vol. 14, no. 1, pp. 49-69, 1990 https://doi.org/10.1016/0098-1354(90)87005-A
  7. D. Rajagopalan, I. A. Karimi, 'Completion time in serial mixed storage multiproduct processes with transfer and set up times,' Comput. Chem. Engng., vol. 13, no. 1/2, pp. 175-186, 1989 https://doi.org/10.1016/0098-1354(89)89016-7
  8. H. M. Ku, I. Karimi, 'Scheduling in serial multiproduct batch processes with finite intermediate storage : a mixed integer linear programming formulation,' Ind. Eng. Chem. Res., vol. 27, pp.1840-1848,1988 https://doi.org/10.1021/ie00082a017
  9. 김민석, 이인범, '일반화된 망형 회분 공정의 생산계획', 한국자동제어학술회의논문집, pp. 1133-1136, 1995