A knapsack problem based approach is proposed for computing the optimal allocation of buffer times.
The priority of each candidate is determined with respect to its delay sensitivity and delay impact to all other events.
The optimal amount of buffer for each minimum headway time is determined.