The operational scheduling of multiproduct pipelines has received increasing attention among researchers in the last decade. Most of the previous contributions rely on a continuous-time approach whose solution CPU time rapidly explodes when dealing with rather long time horizons. Discrete-time models, however, have not been explored to their full potential in the literature for complex pipeline networks. In this paper, we present a discrete-time mixed-integer linear programming model that can find the aggregate scheduling of pipelines with multiple refineries and depots. It is suitable for single-level tree-structured systems, in which all branches appear at different points of the mainline. The proposed model allows to consider multiple intermediate due dates for product demands, simultaneous injections, simultaneous input/output operations at dual-purpose terminals, and variable pump rates. Solutions to three benchmark example problems illustrate that the proposed model can generate high-quality solutions in a reasonable computational burden compared to previous works.