CYCLIC SCHEDULES FOR R-IRREGULARLY OCCURRING EVENTS

Consider r irregular polygons with vertices on some circle. How should the polygons be arranged to minimize some criterion function depending on the distances between adjacent vertices? A solution of this problem is given. It is based on a decomposition of the set of all schedules into local regions in which the optimization problem is convex. For the criterion functions minimize the maximum distance and maximize the minimum distance the local optimization problems are related to network flow problems which can be solved efficiently. If the sum of squared distances is to be minimized a locally optimal solution can be found by solving a system of linear equations. For fixed r the global problem is polynomially solvable for all the above-mentioned objective functions. In the general case, however, the global problem is NP-hard. © 1990.