Scheduling periodic events (Q584069): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cyclic schedules for r irregularity occurring events / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A railway scheduling problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal schedules for periodically recurring events / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3888877 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Latest revision as of 13:10, 20 June 2024
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
