(298c) A Novel Technique for Prediction of Time Points in Scheduling of Multipurpose Batch Plants
- Conference: AIChE Annual Meeting
- Year: 2010
- Proceeding: 2010 Annual Meeting
- Group: Computing and Systems Technology Division
- Time: Tuesday, November 9, 2010 - 1:20pm-1:45pm
In recent years, Batch plants have attracted much attention due to their flexibility in producing different products using the same facility. The profitability of the Batch plant is highly dependent on the way the production is optimized. In this regard, modelling the process is important to maximize resource utilization. Previous models based on the state sequence network representation (SSN) gave few binary variables when compared to the state task network representation (STN). The formulation resulted in a mixed integer linear programming (MILP) problem that can be solved in reasonable computational time. The computational time of the developed mathematical model depends on the nature of the problem (complexity of the batch operation), the number of binary variables and time points. Time points are used to denote the use or production of a particular state at a particular point in time. In solving the model, the optimal number of time points is determined by iteration, with the computational or CPU time required to get the optimal solution being the summation of CPU times for each iteration. If the problem is complex or the number of time points large, a high CPU time is required in solving the problem. The implication is that complex scheduling problems require long time to iterate and obtain the optimum number of time points related to the optimum objective value. This is the main challenge in scheduling Batch plants on a daily or weekly basis. This paper presents a mathematical technique for prediction of the optimal number of time points in short term scheduling of multipurpose Batch plants. The mathematical formulation is based on SSN representation. The developed method is based on the principle that the optimal number of time points depends on how frequent the critical unit is used throughout the time horizon. In the context of this work, a critical unit refers to a unit that is most frequently used and it is active for most of the time points when it is compared to other units. Linear model is used to predict how many times the critical unit is used. In conjunction with knowledge of recipe, this information is used to determine the optimal number of time points. The statistical R-squared value obtained between the predicted and actual number of time points in all the problems considered was 0.98, which suggests that the developed method is accurate in predicting optimal number of time points. Consequently this avoids costly computational times due to iterations. The presentation will demonstrate the application of this technique to several problems in literature where it is proved consistently accurate.
Castro, P. M., Barbosa-Povoa, A. P.F.D., Matos, H. A., Novais, A. Q., 2004. Simple continuous-time formulation for short-term scheduling of batch and continuous processes. Ind. Eng. Chem. Res.,43, 105-118.
Floudas, C.A., Lin, X., 2004. Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review, Comput. Chem. Eng., 28, 2109-2129.
Giannelos, N. F., Georgiadis, M. C., 2002. A Simple new continuous-time formulation for short- term scheduling of multipurpose batch processes. Ind. Eng. Chem. Res., 41, 2178-2184.
Ierapetritou, M. G., Floudas, C. A., 1998. Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes. Ind. Eng. Chem. Res., 37, 4341-4359.
Kondili, E., Pantelides, C.C., Sargent, R.W.H., 1993. A general algorithm for short-term scheduling of batch operations - I. MILP formulation. Comput. Chem. Eng.,17(2), 211-277.
Majozi, T., Zhu, X.X., 2001. A novel continuous-time MILP formulation for multipurpose Batch plants. 1. Short-term scheduling. Ind. Eng. Chem. Res., 40 (25), 5935?5949.
Maravelias, C. T., Grossmann, I. E., 2003. New general continuous-time state-task network formulation for short-term scheduling of multipurpose Batch plants. Ind. Eng. Chem. Res., 42, 3056-3074.
Shaik, M. A., Floudas, C. A., 2009. Novel unified modelling approach for short-term scheduling, Ind. Eng. Chem. Res., 48, 2947-2964.
Sundaramoorthy, A., Karimi, I. A., 2005. A simpler better slot-based continuous-time formulation for short-term scheduling in multipurpose Batch plants. Chem. Eng. Sci., 60, 2679-2702.