Minimizing mean client serving time and broadcast schedule cost in wireless push systems

The classic broadcast scheduling problem defines the optimal common schedule as the repeated sequence of data items that minimizes the clients´ mean waiting time as well as the broadcast schedule´s mean cost, over an infinite time horizon. In this context, a data item´s cost is an independent variable representing generic losses incurred to the system with each transmission of the data item. While the cost parameter is essential for taking into account realistic factors such as mandatory copyright charges and client disapproval risks, related research has ignored it due to the proven NP-hardness of the classic scheduling problem. In this paper an algorithmic solution to the classic problem is presented, which yields almost perfect convergence with the optimal solution extracted via brute force.