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 | 54th IEEE Conference on Decision and Control (CDC 2015), December 15-18, 2015, Osaka, Japan |
Place of Publication | Piscataway |
Publisher | Institute of Electrical Engineers |
Pages | 1687-1692 |
ISBN (Electronic) | 978-1-4799-7885-4 |
ISBN (Print) | 978-1-4799-7884-7 |
DOIs | |
Publication status | Published - 2015 |
Event | 54th IEEE Conference on Decision and Control (CDC 2015) - "Osaka International Convention Center", Osaka, Japan Duration: 15 Dec 2015 → 18 Dec 2015 Conference number: 54 http://www.cdc2015.ctrl.titech.ac.jp/ |
Conference
Conference | 54th IEEE Conference on Decision and Control (CDC 2015) |
---|---|
Abbreviated title | CDC 2015 |
Country/Territory | Japan |
City | Osaka |
Period | 15/12/15 → 18/12/15 |
Internet address |