Valid Inequalities Based on Demand Propagation for Chemical Production Scheduling MIP Models

Sara Velez, Arul Sundaramoorthy, Christos T. Maravelias

Research output: Contribution to journalArticlepeer-review

39 Scopus citations


Although several mixed-integer programming (MIP) models have been proposed for the scheduling of chemical manufacturing facilities, the development of solution methods for these formulations has received limited attention. In this article, we develop a constraint propagation algorithm for the calculation of lower bounds on the number and size of tasks necessary to satisfy given demand. These bounds are then used to express four types of valid inequalities which greatly enhance the computational performance of the MIP scheduling model. Specifically, the addition of these inequalities leads to reductions in the computational requirements of more than three orders of magnitude, thereby allowing us to address medium-sized problems of industrial relevance. Importantly, the proposed methods are applicable to a wide range of problem classes and time-indexed MIP models for chemical production scheduling.

Original languageEnglish (US)
Pages (from-to)872-887
Number of pages16
JournalAIChE Journal
Issue number3
StatePublished - Mar 2013
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Biotechnology
  • Environmental Engineering
  • General Chemical Engineering


  • Chemical production scheduling
  • Mathematical programming


Dive into the research topics of 'Valid Inequalities Based on Demand Propagation for Chemical Production Scheduling MIP Models'. Together they form a unique fingerprint.

Cite this