Safety analysis for a class of graph constrained scheduling problems

Muhammed Bahadir Saltik; Nikolaos Athanasopoulos; Leyla Ozkan

doi:10.1109/CDC.2015.7402453

Safety analysis for a class of graph constrained scheduling problems

Muhammed Bahadir Saltik, Nikolaos Athanasopoulos, Leyla Ozkan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (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 language	English
Title of host publication	Proceedings of the 54th IEEE Conference on Decision and Control
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1687-1692
Number of pages	6
ISBN (Electronic)	978-1-4799-7886-1
DOIs	https://doi.org/10.1109/CDC.2015.7402453
Publication status	Published - 11 Feb 2016
Event	54th IEEE Conference on Decision and Control - Osaka, Japan Duration: 15 Dec 2015 → 18 Dec 2017

Conference

Conference	54th IEEE Conference on Decision and Control
Country/Territory	Japan
City	Osaka
Period	15/12/2015 → 18/12/2017

Access to Document

10.1109/CDC.2015.7402453Licence: Unspecified

Cite this

@inproceedings{ed7777be66f34b0fa166232fabf83e43,

title = "Safety analysis for a class of graph constrained scheduling problems",

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

author = "Saltik, {Muhammed Bahadir} and Nikolaos Athanasopoulos and Leyla Ozkan",

year = "2016",

month = feb,

day = "11",

doi = "10.1109/CDC.2015.7402453",

language = "English",

pages = "1687--1692",

booktitle = "Proceedings of the 54th IEEE Conference on Decision and Control",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "54th IEEE Conference on Decision and Control ; Conference date: 15-12-2015 Through 18-12-2017",

}

TY - GEN

T1 - Safety analysis for a class of graph constrained scheduling problems

AU - Saltik, Muhammed Bahadir

AU - Athanasopoulos, Nikolaos

AU - Ozkan, Leyla

PY - 2016/2/11

Y1 - 2016/2/11

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

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

U2 - 10.1109/CDC.2015.7402453

DO - 10.1109/CDC.2015.7402453

M3 - Conference contribution

SP - 1687

EP - 1692

BT - Proceedings of the 54th IEEE Conference on Decision and Control

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 54th IEEE Conference on Decision and Control

Y2 - 15 December 2015 through 18 December 2017

ER -

Safety analysis for a class of graph constrained scheduling problems

Abstract

Conference

Access to Document

Fingerprint

Cite this