The scheduling of maintenance service
Discrete Applied Mathematics
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Nearly optimal perfectly-periodic schedules
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
General perfectly periodic scheduling
Proceedings of the twenty-first annual symposium on Principles of distributed computing
| Hi-index | 0.90 |
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known as the period of the client. The periodicity of such schedules can be used to save battery life of nodes in a wireless network. The quality of a perfectly periodic schedule is a function of the ratio between the granted and requested periods. We find a worst case performance bound on the quality of schedules produced by Adaptmin. We compare our algorithm to previously proposed algorithm A in [Z. Brakerski, A. Nisgav, B. Patt-Shamir, General perfectly periodic scheduling, in: Proc. 21st Annual Symp. on Principles of Distributed Computing, 2002, pp. 163-172], and show families of input instances where either Adaptmin does no worse than A, or always outperforms A. The better performance of the proposed algorithm is also confirmed by simulations results for randomly generated input instances. Adaptmin produces 25% more efficient schedules as compared to A in our experiments. We also propose a variant of Adaptmin which is computationally much less demanding compared to A, but is very close to Adaptmin in terms of efficiency. Finally, we compare our algorithms to exponential-time optimal scheduling. Our simulation results indicate that the performance of the proposed algorithms is close to that of optimal scheduling.