Scheduling Based on Reachability Analysis of Timed Automata

Sebastian Panek, Olaf Stursberg, and Sebastian Engell 

As an introductory example, we consider a two-stage chemical process in the first stage, the raw material So is separated into two intermediate products Si and 

The scheduling of the process requires the scheduler to decide (a) how many times each task needs to be started in order to satisfy the market demand and (b) to assign starting and finishing dates to the tasks. This is nontrivial because a valid schedule must meet the following requirements  

A production step can start only if the required quantities of raw and intermediate materials are available in the storage tanks, e.g., Ti can only be started when at least hi units of Si are present. 

A production step can finish only if the subsequent storage tanks have sufficient free capacities. For instance, T2 can finish only if the free capacity within S 3 is at 

---

Scheduling Based on Reachability Analysis of Timed Automata... 

---