Recovery scheduling for industrial processes using graph constraints

M.B. Saltik, S. van Gameren, L. Özkan, S. Weiland

Research output: Contribution to journalArticleAcademicpeer-review

1 Downloads (Pure)

Abstract

This paper considers a class of scheduling problems cast for processes that consist of several interconnected subprocesses. We model the temporal constraints (On-Off status) on each subprocess using labeled directed graphs to form the admissible set of schedules. Furthermore, we consider physical constraints inherent in the process. We approach to the scheduling problem as a safe steering problem with integer actions and utilize the reachability mappings for constraints. Consequently, we construct the safe recovery schedules that guarantee constraint satisfaction while steering the tank levels as desired. The proposed approach is illustrated in a simplified whey separation process case study.

Original languageEnglish
Pages (from-to)1417-1422
Number of pages6
JournalComputer Aided Chemical Engineering
Volume40B
DOIs
Publication statusPublished - 1 Oct 2017
Event27th European Symposium on Computer Aided Process Engineering (ESCAPE 27) - Barcelona, Spain
Duration: 1 Oct 20175 Oct 2017
Conference number: 27
http://w.wcce10.org/~josepr23/2017/WCCE2017/index.php/jointevents/escape27

Keywords

  • Graph constraints
  • MILP
  • Reachability
  • Scheduling
  • Whey separation

Fingerprint Dive into the research topics of 'Recovery scheduling for industrial processes using graph constraints'. Together they form a unique fingerprint.

Cite this