Safety analysis for a class of graph constrained scheduling problems

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)
5 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
Titel54th IEEE Conference on Decision and Control (CDC 2015), December 15-18, 2015, Osaka, Japan
Plaats van productiePiscataway
UitgeverijInstitute of Electrical Engineers
Pagina's1687-1692
ISBN van elektronische versie978-1-4799-7885-4
ISBN van geprinte versie978-1-4799-7884-7
DOI's
StatusGepubliceerd - 2015
Evenement54th IEEE Conference on Decision and Control (CDC 2015) - "Osaka International Convention Center", Osaka, Japan
Duur: 15 dec 201518 dec 2015
Congresnummer: 54
http://www.cdc2015.ctrl.titech.ac.jp/

Congres

Congres54th IEEE Conference on Decision and Control (CDC 2015)
Verkorte titelCDC 2015
LandJapan
StadOsaka
Periode15/12/1518/12/15
Anderthe 54th IEEE Conference on Decision and Control
Internet adres

Vingerafdruk Duik in de onderzoeksthema's van 'Safety analysis for a class of graph constrained scheduling problems'. Samen vormen ze een unieke vingerafdruk.

Citeer dit