Before revision:  We then propose a new non-adaptive scheduling policy that is based on combinatorial designs, and show that it improves our performance metrics. We observe in simulation that the proposed scheduling policy, as the performance metrics indicate , reduces the queuing times up to 25\% compared to random scheduling and up to 100\% compared round-robin scheduling.
After revision:  We then propose a new non-adaptive scheduling policy that is based on combinatorial designs, and show that it has better performance indicators. Simulations confirm that the proposed scheduling policy, as the performance metrics indicate , reduces the queuing times up to 25\% compared to random scheduling and up to 100\% compared round-robin scheduling.