We consider a widespread solution method that consists of a column generation approach embedded in a branch-and-bound scheme to solve the multiple depot vehicle scheduling problem with time windows. We describe a dynamic time window reduction technique in order to speed up this method. The performance of the proposed technique is evaluated through computational experiments on randomly generated instances involving several depots and up to 900 tasks.