We introduce three operations for timed scenarios: subsumption, intersection and union. They have constructive definitions based on the syntactic properties of the constituent scenarios. We show that they have the desired semantic properties. These results expand the theory of timed scenarios, but their development was inspired by practical considerations: they are directly relevant to the problem of synthesizing a timed automaton with a minimal number of clocks from a set of scenarios.