The waiting delays of users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes m unfair service to users and increases the possibility of higher reneging rates. This paper proposes an leagued batching scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. The proposed scheme given intervals based on the league which reflect the disk partitions service patterns and user requests. Experimental results of simulations show that the proposed scheme improves about 18 percentage of average waiting time comparing with those of conventional methods such as FCFS and MQL.