首页 | 本学科首页   官方微博 | 高级检索  
     


Short-term scheduling and recipe optimization of blending processes
Affiliation:1. Department of Electrical Engineering, Kermanshah University of Technology, Kermanshah, Iran;2. Department of Industrial Engineering, University of Salerno, Italy;1. School of Computer Science, Guangdong University of Technology, Guangzhou 510006, China;2. Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and Systems, Macau University of Science and Technology, Taipa 999078, Macao
Abstract:The main objective of this paper is to develop an integrated approach to coordinate short-term scheduling of multi-product blending facilities with nonlinear recipe optimization. The proposed strategy is based on a hierarchical concept consisting of three business levels: Long-range planning, short-term scheduling and process control. Long-range planning is accomplished by solving a large-scale nonlinear recipe optimization problem (multi-blend problem). Resulting blending recipes and production volumes are provided as goals for the scheduling level. The scheduling problem is formulated as a mixed-integer linear program derived from a resource-task network representation. The scheduling model permits recipe changeovers in order to utilize an additional degree of freedom for optimization. By interpreting the solution of the scheduling problem, new constraints can be imposed on the previous multi-blend problem. Thus bottlenecks arising during scheduling are considered already on the topmost long-range planning level. Based on the outlined approach a commercial software system has been designed to optimize the operation of in-line blending and batch blending processes. The application of the strategy and software is demonstrated by a detailed case study.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号