Robust Scheduling with Recourse for Batch Processes under Uncertainty

Uncertain phenomenon is prevalent in batch processes, which makes it very difficult to obtain a satisfied schedule for the decision maker with usual deterministic model. In order to improve the system performance in the face of uncertainty, a novel robust scheduling method based on the idea of robust optimization with recourse is proposed. The corn of this method is to find the equilibrium of feasibility and optimization by recourse. Some robust metrics are introduced and proposed to quantify the scheduling robustness. Then a novel robust scheduling model under demand uncertainty is proposed. In this model, some constraints could be violated, but must be compensated to realize robust optimization. Finally the simulation results illustrate the validity of this method