期刊
COMPUTERS & CHEMICAL ENGINEERING
卷 28, 期 11, 页码 2271-2286出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compchemeng.2004.04.002
关键词
cyclic scheduling; continuous-time formulation; MINLP
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and product demands. It requires the determination of optimal cyclic schedule, thus greatly reducing the size of the overall scheduling problems with large time horizon. In this paper a new cyclic scheduling approach is proposed based on the state-task network (STN) representation of the plant [Comput. Chem. Eng. 17 (1993) 211] and a continuous-time formulation [Ind. Eng. Chem. Res. 37 (1998a) 4341]. Assuming that product demands and prices are not fluctuating along the time horizon under consideration, the proposed formulation determines the optimal cycle length as well as the timing and sequencing of tasks within a cycle. This formulation corresponds to a non-convex mixed integer nonlinear programming (MINLP) problem, for which local and global optimization algorithms are used and the results are illustrated for various case studies. (C) 2004 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据