Scheduling for batch processes based on clustering approximated timed reachability graphs

To solve some scheduling problems of batch processes based on timed Petri net models, timed extended reachability graphs (TERGs) and approximated TERGs can be used. Such graphs abstract temporal specifications and represent parts of timed languages. By exploring the feasible trajectories in a TERG, optimal schedules can be obtained with respect to the makespans of batch processes that are modeled by timed Petri nets. Nevertheless, the rapid growth of the number of states in a TERG makes the problem intractable for large systems. In this paper, we improve the existing clustering TERG approach, and we make it suitable for large sized batch processes. We also enlarge a systematic approach to model batch processes with timed Petri nets. Finally, a comprehensive example of scheduling problem is studied for an archetypal chemical production plant in order to illustrate the efficiency of the proposed approach.