Wide area research and education networks, such as ESnet and Internet2 in the US and GEANT in Europe, have recently deployed software that makes possible to reserve bandwidth in the form of dynamic circuits. Such circuits offer guaranteed QoS to specific data flows, significantly increasing the reliability and predictability of data transfers. In this paper, we study the problem of constructing routes and scheduling bandwidth reservations for data transfers between multiple pairs of end sites. We develop an algorithm, called RRM, to solve this problem. Our objective is to maximize the number of satisfied data transfer requests while minimizing the total data transfer times. We further prove that our problem is NP-hard and compare our algorithm with a baseline FCFS algorithm through simulations. The simulations indicate that our algorithm accommodates up to 160% more requests and achieves up to 50% shorter average data transfer times than the baseline algorithm.