Integration of scheduling and dynamic optimization for sequential batch processes

Yunfei Chu, Fengqi You

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose an efficient decomposition method to solve the integrated problem of scheduling and dynamic optimization for sequential batch processes. The integrated problem is formulated as a mixed-integer dynamic optimization problem. To reduce the computational complexity, we first decompose all dynamic models from the integrated problem. Information of the dynamic models is encapsulated by a flexible recipe which is characterized by Pareto frontiers. The Pareto frontiers are determined offline by using multi-objective dynamic optimization to minimize the processing cost and processing time. The flexible recipe is then optimized simultaneously with the scheduling decisions online. After the decomposition, the online problem is a mixed integer linear programming problem which is computationally efficient and allows the online implementation.

Original languageEnglish (US)
Title of host publication2013 American Control Conference, ACC 2013
Pages3511-3516
Number of pages6
StatePublished - Sep 11 2013
Event2013 1st American Control Conference, ACC 2013 - Washington, DC, United States
Duration: Jun 17 2013Jun 19 2013

Other

Other2013 1st American Control Conference, ACC 2013
CountryUnited States
CityWashington, DC
Period6/17/136/19/13

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Integration of scheduling and dynamic optimization for sequential batch processes'. Together they form a unique fingerprint.

Cite this