Scheduling periodic events (Q584069): Difference between revisions

Consider n periodically recurring events. The problem is to find a schedule which maximizes the minimal distance between consecutive events. This problem is equivalent to the following: n regular polygons with vertices on a circle line shall be inscribed in the circle so as to maximize the distance between the closest vertices on the circle. The problem is proven to be NP-hard. Bounds for the optimal solution and polynomially solvable special cases are derived. Finally a complete enumeration scheme is presented.