When studying real or virtual systems through complex networks theories, usually time restrictions are neglected, and a static structure is defined to characterize which node is connected to which other. However, this approach is oversimplified, as real networks are indeed dynamically modified by external mechanisms. In order to bridge the gap, in this work we present a scheduled network formalism, which takes into account such dynamical modifications by including generic time restrictions in the structure of an extended adjacency matrix. We present some of its properties and apply this formalism to the specific case of the air transportation network in order to analyze its efficiency. Real data are used at this point. We finally discuss on the applicability of this formalism to other complex systems.