Perfect periodic scheduling for three basic cycles

Kim, Eun-Seok and Glass, Celia (2014) Perfect periodic scheduling for three basic cycles. Journal of Scheduling, 17 (1) . pp. 47-65. ISSN 1094-6136 (doi:10.1007/s10951-013-0331-3)

PDF - Published version (with publisher's formatting)
Download (1MB) | Preview


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) client is serviced at regular, pre-specified 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(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.

Item Type: Article
Additional Information: Published online: 17 May 2013. The final publication is available at Springer via
Research Areas: A. > Business School > International Management and Innovation
Item ID: 17407
Depositing User: Eun-Seok Kim
Date Deposited: 25 Aug 2015 10:07
Last Modified: 31 May 2019 08:39

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year