Abstract We consider the Euclidean Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). For the long time, approximability of this well-known problem in the class of algorithms with theoretical guarantees was poorly studied. This year, for the case of a single depot, we proposed two approximation algorithms, which are the Efficient Polynomial Time Approximation Schemes (EPTAS) for any fixed given capacity q and the number p of mutually disjunctive time windows. The former scheme extends the celebrated approach proposed by M. Haimovich and A. Rinnooy Kan and allows the evident parallelization, while the latter one has an improved time complexity bound and the enlarged domain in terms q = q(n) and p = p(n), where it retains polynomial time complexity. In this paper, we announce an extension of these results to the case of multiple depots. So, the first scheme is also EPTAS for any fixed parameters q, p, and m, where m is the number of depots, and remains PTAS for q = o(loglog n) and mp = o(log log n). In other turn, the second one is a PTAS for p3q4 = O(log n) and (pq)2 log m = O(log n).