Problem: You are tasked with scheduling repairs for public transportation infrastructure where each project has varying costs, repair durations, and public benefits. Design a Greedy algorithm to maximize the number of repairs completed while minimizing public disruptions.