Optimal ON-OFF scheduling for a class of discrete event systems with real-time constraints
Lei Miao · 2017
This paper studies an optimal ON-OFF scheduling problem for a class of discrete event systems with real-time constraints. Our goal is to minimize the overall costs, including the operating cost and the wake-up cost, while still guaranteeing the deadline of each individual task. In particular, we consider the homogeneous case in which it takes the same amount of time to serve each task and each task needs to be served by d seconds upon arrival. The problem involves two subproblems: (i) finding the best time to wake up the system and (ii) finding the best time to let the system go back to sleep. With the first subproblem studied previously, we focus on the second one in this paper. In particular, we consider the off-line control scenario that all task information is known to us a priori. We show that dynamic programming can be used to calculate the optimal schedule.