469251 Infeasibility Analysis for Scheduling Applications
In this work, we present use of infeasibility analysis in the context of rescheduling for a multi-purpose chemical batch process. We identify irreducible inconsistent sets (IISs), which are subsets of an infeasible model, such that the IIS itself is infeasible but any proper subset of the IIS is feasible. We isolate multiple IISs systematically and identify bottle-necks in process scheduling network by discovering a set of mutual inconsistencies that must be eliminated to achieve feasibility. We demonstrate this approach through an interactive and intuitive scheduling interface for variety of scheduling models using the well-known Westernberger-Kallrath case study.