Grouping tasks to save energy in a cyclic scheduling problem: a complexity study

•A new model for the task grouping in cyclic scheduling applied to wireless networks.•The start-to-end deadlines are formulated as usual uniform precedence constraints.•A production example shows the general problem independent of the processing times.•The wireless networks problem is polynomial.•The general problem is NP-complete, even if unit processing times are assumed.