On burst transmission scheduling in mobile TV broadcast networks
IEEE/ACM Transactions on Networking (TON)
Broadcasting video streams encoded with arbitrary bit rates in energy-constrained mobile TV networks
IEEE/ACM Transactions on Networking (TON)
On the value of preemption in scheduling
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Algorithms with limited number of preemptions for scheduling on parallel machines
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Journal of Scheduling
Algorithms with limited number of preemptions for scheduling on parallel machines
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
In this paper, we compare the makespan of preemptive and i-preemptive schedules where only a limited number i of preemptions is allowed. The problem is to schedule n independent jobs on m identical processors that operate in parallel. The objective is to minimize the makespan, i.e., the completion time of the last job that finishes. We show that the ratio of the optimal i-preemptive schedule length ${C_{max}^{ip^*}}$ versus the optimal preemptive schedule length ${C_{max}^{p^*}}$ is bounded from above by ${C_{max}^{ip^*}} \le {( 2 - 2 / (m/(i+1) + 1) )} {C_{max}^{p^*}}$. Furthermore, we show that the ratio of the length ${C_{max}^{LPT}}$ of a nonpreemptive schedule following the {\it longest processing time (LPT)} rule versus the optimal preemptive schedule length ${C_{max}^{p^*}}$ is bounded from above by exactly the same bound when i=0.