The basic objective of broadcast scheduling is to get the smallest length TDMA frame, where many nodes are allowed to transmit simultaneously in a single time slot in a conflict-free manner. The secondary objective is to maximize the number of such transmissions for maximum use of the channel. An Artificial Bee Colony (ABC) with ranking strategy is proposed in this paper for the broadcast scheduling problem. Our proposed method is very efficient for generating initial and neighbor feasible solutions. We can get the best number of time slots and transmission utilization comparing to previous researches.