Abstract: The aim of this study was to find an efficient traffic control algorithm that reduces the total waiting time (TWT) of all vehicles in a traffic jam at a two-lane intersection. This paper draws from time-shared computer systems and the scheduling theory to determine the optimum algorithm for scheduling traffic. In this study, four CPU Scheduling algorithms were evaluated against a set of 100 randomly-generated traffic patterns in a simulated environment to determine their relative levels of efficiency in reducing the TWTs of vehicles in a traffic jam and identify the most efficient one.