Using MILP and CP for the scheduling of batch chemical processes

Christos T. Maravelias, Ignacio E. Grossmann

Research output: Chapter in Book/Report/Conference proceedingChapter

22 Scopus citations

Abstract

A hybrid framework that uses Mathematical and Constraint Programming for the scheduling of batch chemical processes is proposed. Mathematical programming is used for the high-level optimization decisions (number and type of tasks, and assignment of equipment units to tasks), and Constraint Programming is used for the low-level sequencing decisions. The original problem is decomposed into an MILP master problem and a CP subproblem. The master MILP is a relaxation of the original problem, and given a relaxed solution, the CP subproblem checks whether there is a feasible solution and generates integer cuts. The proposed framework is based on the hybrid algorithm of Maravelias and Grossmann ([1],[2]), and can be used for different objective functions and different plant configurations. In this paper we present the simplifications and enhancements that allow us to use the proposed framework in a variety of problems, and report computational results.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsJean-Charles Regin, Michel Rueher
PublisherSpringer Verlag
Pages1-20
Number of pages20
ISBN (Print)354021836X, 9783540218364
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3011
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Using MILP and CP for the scheduling of batch chemical processes'. Together they form a unique fingerprint.

Cite this