Cyclic schedules for r irregularity occurring events (Q2639766)

The problem to be considered is one of scheduling r cyclic task events that are activated according to some fixed periodic pattern. Three criteria are analyzed: minimizing the maximum distance between two events, maximizing the minimum distance and minimizing the sum of squared distances. For all three problems polynomial algorithms are given, if r is fixed. For general r, however, the problems are NP-hard.