Safety analysis for a class of graph constrained scheduling problems

M.B. Saltik, Nikos Athanasopoulos, L. Ozkan, S. Weiland

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)
5 Downloads (Pure)


We consider a class of scheduling problems, common in manufacturing industries that consist of several interconnected subprocesses. We model the scheduling constraints of each subprocess and of the overall system using labeled directed graphs, forming the admissible set of schedules. Furthermore, we consider polytopic constraints on the state space. We approach the scheduling problem as a safety analysis problem utilizing reachability mappings, system and constraint structure. Consequently, we construct the safe schedules that guarantee constraint satisfaction at all times. The proposed framework is illustrated in a case study that concerns a simplified separation process.
Original languageEnglish
Title of host publication54th IEEE Conference on Decision and Control (CDC 2015), December 15-18, 2015, Osaka, Japan
Place of PublicationPiscataway
PublisherInstitute of Electrical Engineers
ISBN (Electronic)978-1-4799-7885-4
ISBN (Print)978-1-4799-7884-7
Publication statusPublished - 2015
Event54th IEEE Conference on Decision and Control (CDC 2015) - "Osaka International Convention Center", Osaka, Japan
Duration: 15 Dec 201518 Dec 2015
Conference number: 54


Conference54th IEEE Conference on Decision and Control (CDC 2015)
Abbreviated titleCDC 2015
Internet address


Dive into the research topics of 'Safety analysis for a class of graph constrained scheduling problems'. Together they form a unique fingerprint.

Cite this