Safety analysis for a class of graph constrained scheduling problems

Muhammed Bahadir Saltik, Nikolaos Athanasopoulos, Leyla Ozkan

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

1 Citation (Scopus)

Abstract

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 publicationProceedings of the 54th IEEE Conference on Decision and Control
Publisher IEEE
Pages1687-1692
Number of pages6
ISBN (Electronic)978-1-4799-7886-1
DOIs
Publication statusPublished - 11 Feb 2016
Event54th IEEE Conference on Decision and Control - Osaka, Japan
Duration: 15 Dec 201518 Dec 2017

Conference

Conference54th IEEE Conference on Decision and Control
CountryJapan
CityOsaka
Period15/12/201518/12/2017

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

Cite this