Abstract
This paper considers the determination of traffic liht phaseeand phase aequencea ae part of the acheduling problem. Thefeasibility of this program depends on cycle time, therequired minimal green timea and the pairwaiae incompabiliti.eeA aimple feaaibility teat i.n terms of "bloclcing k;roupsW isgiven, and a conatructi.on for initial basic, feasible solutionia derived Erom i.t. A special algorithm for the oDtimizationis p.reaented. The periodic repetit,ion of the achdule at theinteraection is accounted for in the algorithm.