In this paper, we symbolically compute a minimally restrictive nonblocking supervisor for timed discrete event systems (TDESs), in the supervisory control theory context. The method is based on Timed Extended Finite Automata, which is an augmentation of extended finite automata (EFAs) by incorporating discrete time in the model. EFAs are ordinary automaton extended with discrete variables, guard expressions and updating functions. The main feature of this approach is that it is not based on "tick" models that have been commonly used in this area, leading to better performance in many cases. In addition, to tackle large problems all computations are based on binary decision diagrams. As a case study, we effectively computed the minimally restrictive nonblocking supervisor for a well-known production cell.