A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
2006
Journal of combinatorial optimization
We study the problem of (off-line) broadcast scheduling in minimizing total flow time and propose a dynamic programming approach to compute an optimal broadcast schedule. Suppose the broadcast server has k pages and the last page request arrives at time n. The optimal schedule can be computed in O(k 3 (n+k) k−1 ) time for the case that the server has a single broadcast channel. For m channels case, i.e., the server can broadcast m different pages at a time where m < k, the optimal schedule can
doi:10.1007/s10878-006-7128-7
fatcat:hqxfbyjvg5dk5iqd6gpcyyj2q4