Short-Term Scheduling
暂无分享,去创建一个
In this chapter, the concept of the state sequence network (SSN) representation, which is the cornerstone of the material entailed in this textbook, is presented. This representation is based on states only, eliminating the use of tasks and units. Using this new representation as a basis, a novel continuous time MILP formulation for short-term scheduling of multipurpose batch plants is developed (Majozi and Zhu, 2001, Ind. Eng. Chem. Res., 40(25): 5935–5949). The presented formulation can readily be extended to intermediate due date scenarios. Time points are used to denote the use or production of a particular state. This formulation leads to a small number of binary variables and much better results when compared to other continuous time formulations published in literature. The reduced number of binary variables is a result of considering states only, thereby eliminating binary variables corresponding to tasks and units. This method has been applied to literature examples and industrial problems which show significant improvement in reducing the number of binary variables, hence CPU times. The last section of this chapter introduces the concept of units aggregation in reducing the binary dimension of large-scale problems. This makes it possible for the method to solve large-scale industrial problems. In the forthcoming chapters of this textbook it will be demonstrated how this formulation is applied in the context of batch process integration with the ultimate aim of freshwater and energy optimization.
[1] C. Floudas,et al. Effective Continuous-Time Formulation for Short-Term Scheduling. 1. Multipurpose Batch Processes , 1998 .
[2] C. Pantelides,et al. A simple continuous-time process scheduling formulation and a novel solution algorithm , 1996 .
[3] Christodoulos A. Floudas,et al. Effective Continuous-Time Formulation for Short-Term Scheduling. 2. Continuous and Semicontinuous Processes , 1998 .