Level schedules for mixed-model, Just-in-Time processes
Management Science
Feasibility of scheduling lot sizes of three products on one machine
Management Science
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research
Nearly optimal perfectly periodic schedules
Distributed Computing - Special issue: Selected papers from PODC '01
Dispatching in perfectly-periodic schedules
Journal of Algorithms
Efficient algorithms for periodic scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Scheduling
Jitter-approximation tradeoff for periodic scheduling
Wireless Networks
Efficient Perfectly Periodic Scheduling for Data Broadcasting
UMC '08 Proceedings of the 2008 International Symposium on Ubiquitous Multimedia Computing
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive general perfectly periodic scheduling
Information Processing Letters
Energy efficient spatial TDMA scheduling in wireless networks
Computers and Operations Research
Optimising multi-rate link scheduling for wireless mesh networks
Computer Communications
| Hi-index | 0.00 |
Periodic scheduling has many attractions for wireless telecommunications. It offers energy saving where equipment can be turned off between transmissions, and high-quality reception through the elimination of jitter, caused by irregularity of reception. However, perfect periodic schedules, in which each (of $$n$$n) client is serviced at regular, prespecified intervals, are notoriously difficult to construct. The problem is known to be NP-hard even when service times are identical. This paper focuses on cases of up to three distinct periodicities, with unit service times. Our contribution is to derive a $$O(n^4)$$O(n4) test for the existence of a feasible schedule, and a method of constructing a feasible schedule if one exists, for the given combination of client periodicities. We also indicate why schedules with a higher number of periodicities are unlikely to be useful in practice. This methodology can be used to support perfect periodic scheduling in a wide range in real world settings, including machine maintenance service, wireless mesh networks and various other telecommunication networks transmitting packet size data.