Scheduling periodic events (Q584069)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:584069 |
scientific article; zbMATH DE number 4133820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling periodic events |
scientific article; zbMATH DE number 4133820 |
Statements
Scheduling periodic events (English)
0 references
1989
0 references
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.
0 references
cyclic scheduling
0 references
periodically recurring events
0 references
NP-hard
0 references
polynomially solvable special cases
0 references
complete enumeration
0 references
0.8677353262901306
0 references
0.8600321412086487
0 references
0.8104812502861023
0 references
0.8036959767341614
0 references
0.8017578721046448
0 references
