Timed Event Graphs (TEGs) constitute a subclass of timed Petri nets that model synchronization and delay phenomena, but not conflict or choice. In a suitable mathematical framework (idempotent semirings such as the min-plus algebra), the temporal evolution of TEGs can be described by a set of linear equations. Recently, a method has been proposed for the optimal control of TEGs that share one or more resources based on a prespecified priority policy. In this paper, we aim at finding a solution on how to deal with disturbances in TEGs with shared resources, which is not possible under the current feedforward-based approaches.