Short-term scheduling: New mathematical models vs algorithmic improvements

M. G. Ierapetritou, C. A. Floudas

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

In this paper, a novel formulation is presented for the short-term scheduling of batch plants. The proposed formulation is based on a continuous time representation and results in a Mixed Integer Linear Programming (MILP) problem. In contrast to the previously published continuous-time scheduling formulations, the proposed approach leads to smaller and simpler mathematical models which exhibit fewer binary and continuous variables, have smaller integrality gaps, require fewer constraints, need fewer linear programming relaxations, and can be solved in significantly less CPU time. Several examples are presented that illustrate the effectiveness of the proposed formulation and comparisons with other approaches are provided.

Original languageEnglish (US)
Pages (from-to)S419-S426
JournalComputers and Chemical Engineering
Volume22
Issue numberSUPPL.1
DOIs
StatePublished - 1998

All Science Journal Classification (ASJC) codes

  • Chemical Engineering(all)
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Short-term scheduling: New mathematical models vs algorithmic improvements'. Together they form a unique fingerprint.

Cite this