The U.S. truck driver scheduling problem (US‐TDSP) is the problem of visiting a sequence of λ locations within given time windows in such a way that driving and working activities of truck drivers comply with U.S. hours‐of‐service regulations. In the case of single time windows it is known that the US‐TDSP can be solved in O(λ3
) time. In this paper, we present a scheduling method for the US‐TDSP that solves the single time window problem in O(λ2
) time. We show that in the case of multiple time windows the same complexity can be achieved if the gap between subsequent time windows is at least 10 hours. This situation occurs, for example, if, because of opening hours of docks, handling operations can only be performed between 8.00 a.m. and 10.00 p.m. Furthermore, we empirically show that for a wide range of other problem instances the computational effort is not much higher if multiple time windows are considered.
