Scheduling periodic events (Q584069): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4133820 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cyclic scheduling | |||
| Property / zbMATH Keywords: cyclic scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
periodically recurring events | |||
| Property / zbMATH Keywords: periodically recurring events / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
NP-hard | |||
| Property / zbMATH Keywords: NP-hard / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
polynomially solvable special cases | |||
| Property / zbMATH Keywords: polynomially solvable special cases / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
complete enumeration | |||
| Property / zbMATH Keywords: complete enumeration / rank | |||
Normal rank | |||
Revision as of 19:29, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling periodic events |
scientific article |
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
