Effective decomposition algorithm for multistage batch plant scheduling

Pedro M. Castro*, Iiro Harjunkoski, Ignacio E. Grossmann

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)


This paper presents a new algorithm for the scheduling of batch plants with a large number of orders and sequence-dependent changeovers. Such problems are either intractable or yield poor solutions with full-space approaches. We use decomposition on the entire set of orders and derive the complete schedule in several iterations. The key idea is to allow for partial rescheduling without altering the main decisions in terms of unit assignments and sequencing, so that the complexity is kept at a manageable level. It has been implemented with a unit-specific continuous-time model and tested for different decomposition settings. The results show that a real-life 50-order, 17-unit, 6-stage problem can effectively be solved in roughly 6 minutes of computational time.

Original languageEnglish
Pages (from-to)475-480
Number of pages6
JournalComputer Aided Chemical Engineering
Issue numberC
Publication statusPublished - 2010
MoE publication typeA1 Journal article-refereed


  • Continuous-time
  • Optimization
  • Sequence-dependent changeovers


Dive into the research topics of 'Effective decomposition algorithm for multistage batch plant scheduling'. Together they form a unique fingerprint.

Cite this