We address short-term batch process scheduling problems contaminated with uncertainty in the data. The mixed integer linear programming (MILP) scheduling model, based on the formulation of Ierapetritou and Floudas, Ind Eng Chem Res. 1998; 37(11):4341-4359, contains parameter dependencies at multiple locations, yielding a general multiparametric (mp) MILP problem. A proactive scheduling policy is obtained by solving the partially robust counterpart formulation. The counterpart model may remain a multiparametric problem, yet it is immunized against uncertainty in the entries of the constraint matrix and against all parameters whose values are not available at the time of decision making. We extend our previous work on the approximate solution of mp-MILP problems by embedding different uncertainty sets (box, ellipsoidal and budget parameter regulated uncertainty), and by incorporating information about the availability of uncertain data in the construction of the partially robust scheduling model. For any parameter realization, the corresponding schedule is then obtained through function evaluation. V C 2013 American Institute of Chemical Engineers AIChE J, 59: 2013 Keywords: process scheduling, mixed integer programming, multiparametric programming, robust optimization
IntroductionThe area of scheduling of chemical and pharmaceutical processes has received significant attention in industry and academia with a number of excellent reviews summarizing the key contributions in this field. [1][2][3][4][5][6][7][8] Scheduling is likely to be subject to uncertainty attributed to endogenous factors such as varying processing times or production rates, as well as to exogenous factors arising from variations in the market demand, product prices, or time horizon, etc. A classification of sources of uncertainty in process operations is found in the work by Pistikopoulos. 9 The optimal scheduling policy for a chemical process based on nominal data may not be optimal or even feasible any more once a deviation from the nominal values has occurred. Proactive scheduling is motivated by the need to address uncertainty upfront in order to restrict disruptions and avoid rescheduling in response to disturbances. Provided knowledge about the probability distribution of the uncertain data is available, stochastic programming methods are widely used in proactive scheduling. In this category fall the works of Bonfill et al., 10 Vin and Ierapetritou, 11 and Balasubramanian and Grossmann 12 addressing demand uncertainty, as well as Bonfill et al., 13 Bonfill et al., 14 and Balasubramanian and Grossmann 15 addressing operational level related uncertainty such as processing time variability. Scenario based formulations suffer from an increased problem size with respect to a growing number of uncertain parameters involved. In the open literature, another approach to account for the presence of uncertainty in the model is to employ its robust counterpart formulation. The objective of robust optimization is to identify scheduling policies tha...