The department for road construction of the canton Aargau periodically prepares construction programs dor several years used in form of rolling schedules. These programs should comply with financial restrictions, tend to use the full annual ressources, produce a big construction volume , taking into account the given priorities of the projects and respecting their earliest dates. As an auxiliary tool a computer program was developed to efficiently produce good solutions for this multiple ressources constrained scheduling problem. Therein the method of Lagrange duality was used together with heuristic rules to control a Branch and Bound and a Greedy algorithm.