A case study on timed supervisory control on a linear cluster tool using aggregated timed synthesis

In this paper an approach to distributed timed supervisory based on aggregated synthesis is given. This paper formulates the distributed timed control problem and introduces a method for finding the distributed timed supervisor with the minimal makespan with reference to other supervisors synthesized with aggregated timed synthesis. The method is based on bottleneck optimization used in manufacturing lines. After introduction of the aggregated timed synthesis, the synthesis is applied to a linear cluster tool in order to compare the introduced bottleneck optimization with nonoptimized aggregated time synthesis.