Traversing a graph in finite time, maximizing utility
I think this is the knapsack problem, with the following correspondences:


item: activity
item weight: activity performance time
item value: activity utility
knapsack maximum weight: finite time horizon T


One solves it using dynamic programming.

(I don't think a graph model would be useful here, as it does not seem easy to encode the problem into a standard graph problem.)