Abstract
A procedure is outlined for minimizing the total delay at an intersection over a time period during with the expected approach flows may vary and there may be queuing. The procedure has provision for any short-term queuing inherent in a global optimal solution, and for varying the green split as the demands vary. The delay at each approach is a function of its time-dependent allocation of green time, where the green time reflects its capacity in a given time slice.