In the public works sector, materials have to be transported between sites for road building and leveling works. Road infrastructure operations, in particular asphalt laying, involve using a large fleet of trucks to supply the application of asphalt concrete without discontinuance. Others transportations, like supplying in gravel a central, are more flexible with respect to time windows at collection or delivery locations. To handle these transportations, vehicles travel large distances between collection and delivery sites. As only full truckload are involved, one objective is the minimization of empty travels. In addition, some transport requests may share a site where trucks are served by a single resource machine (i.e. a loader). The vehicles that serve these requests have to be synchronized on this resource. We introduce the full truckload pickup and delivery problem with resource synchronization (FTPDP-RS) which concerns the routing and the scheduling on resources of a fleet of heterogeneous vehicles subject to temporal constraints. This problem is solved with an Adaptive Large Neighborhood Search (ALNS). It integrates destroy and repair operators based on the literature and problem specific operators. To deal with precedences between nodes on routes and resources, we propose timing algorithms to efficiently evaluate the feasibility of insertions. The method is evaluated on instances from a real case study.