The Split Delivery Vehicle Routing Problem (SDVRP) is a variant version of the classical VRP in which each customer can be visited by more than one vehicle which serves a fraction of its demand. The Discrete SDVRP is another variant in which the delivery request of a customer consists of several items which cannot be split further. In this work we consider the DSDVRP with time windows where the service of items' combinations imply a corresponding service time. We present a branch-and-price algorithm and discuss preliminary computational results.