Recovery scheduling for industrial processes using graph constraints

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

doi:10.1016/B978-0-444-63965-3.50238-5

Recovery scheduling for industrial processes using graph constraints

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

Research output: Contribution to journal › Article › Academic › peer-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 language	English
Pages (from-to)	1417-1422
Number of pages	6
Journal	Computer Aided Chemical Engineering
Volume	40B
DOIs	https://doi.org/10.1016/B978-0-444-63965-3.50238-5
Publication status	Published - 1 Oct 2017
Event	27th European Symposium on Computer Aided Process Engineering (ESCAPE 27) - Barcelona, Spain Duration: 1 Oct 2017 → 5 Oct 2017 Conference number: 27 http://w.wcce10.org/~josepr23/2017/WCCE2017/index.php/jointevents/escape27

Keywords

Graph constraints
MILP
Reachability
Scheduling
Whey separation

Access to Document

10.1016/B978-0-444-63965-3.50238-5

Cite this

@article{f3c755d381ac42f78a83ac71b3008478,

title = "Recovery scheduling for industrial processes using graph constraints",

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.",

keywords = "Graph constraints, MILP, Reachability, Scheduling, Whey separation",

author = "M.B. Saltik and {van Gameren}, S. and L. {\"O}zkan and S. Weiland",

year = "2017",

month = oct,

day = "1",

doi = "10.1016/B978-0-444-63965-3.50238-5",

language = "English",

volume = "40B",

pages = "1417--1422",

journal = "Computer Aided Chemical Engineering",

issn = "1570-7946",

publisher = "Elsevier",

note = "27th European Symposium on Computer Aided Process Engineering (ESCAPE 27), ESCAPE ; Conference date: 01-10-2017 Through 05-10-2017",

url = "http://w.wcce10.org/~josepr23/2017/WCCE2017/index.php/jointevents/escape27",

}

TY - JOUR

T1 - Recovery scheduling for industrial processes using graph constraints

AU - Saltik, M.B.

AU - van Gameren, S.

AU - Özkan, L.

AU - Weiland, S.

N1 - Conference code: 27

PY - 2017/10/1

Y1 - 2017/10/1

N2 - 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.

AB - 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.

KW - Graph constraints

KW - MILP

KW - Reachability

KW - Scheduling

KW - Whey separation

UR - http://www.scopus.com/inward/record.url?scp=85041394389&partnerID=8YFLogxK

U2 - 10.1016/B978-0-444-63965-3.50238-5

DO - 10.1016/B978-0-444-63965-3.50238-5

M3 - Article

AN - SCOPUS:85041394389

SN - 1570-7946

VL - 40B

SP - 1417

EP - 1422

JO - Computer Aided Chemical Engineering

JF - Computer Aided Chemical Engineering

T2 - 27th European Symposium on Computer Aided Process Engineering (ESCAPE 27)

Y2 - 1 October 2017 through 5 October 2017

ER -

Recovery scheduling for industrial processes using graph constraints

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this