Tightening methods for continuous-time mixed-integer programming models for chemical production scheduling



Important advances in modeling chemical production scheduling problems have been made in recent years, yet effective solution methods are still required. We use an algorithm that uses process network and customer demand information to formulate powerful valid inequalities that substantially improve the solution process. In particular, we extend the ideas recently developed for discrete-time formulations to continuous-time models and show that these tightening methods lead to a significant decrease in computational time, up to more than three orders of magnitude for some instances. © 2013 American Institute of Chemical Engineers AIChE J, 59: 4461–4467, 2013