A novel network-based continuous-time representation for process scheduling: Part I. Main concepts and mathematical formulation

Diego M. Giménez, Gabriela P. Henning, Christos T. Maravelias

Research output: Contribution to journalArticlepeer-review

40 Scopus citations

Abstract

A novel network-based framework for the short-term scheduling of multi-purpose batch processes is presented. The novelty of the proposed approach lies in five key concepts. First, it is based on a new continuous-time representation that does not require tasks to start (end) exactly at a time point; thus reducing the number of time points needed to represent a solution. Second, processing units are modeled as being in different activity states to allow storage of input/output materials. Third, time variables for "idle" and "storage" periods of a unit are introduced to enable the matching between tasks and time points without big-M constraints. Fourth, material transfer variables are introduced to explicitly account for unit connectivity. Fifth, inventory variables for storage in processing units are incorporated to model non-simultaneous and partial material transfers. The proposed representation leads to MILP formulations which address limitations of existing scheduling methods.

Original languageEnglish (US)
Pages (from-to)1511-1528
Number of pages18
JournalComputers and Chemical Engineering
Volume33
Issue number9
DOIs
StatePublished - Sep 9 2009
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Chemical Engineering(all)
  • Computer Science Applications

Keywords

  • Mixed-integer linear programming
  • Network-based continuous-time representation
  • Process scheduling

Fingerprint Dive into the research topics of 'A novel network-based continuous-time representation for process scheduling: Part I. Main concepts and mathematical formulation'. Together they form a unique fingerprint.

Cite this