Cyclic schedules for r irregularity occurring events (Q2639766)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4185376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cyclic schedules for r irregularity occurring events |
scientific article; zbMATH DE number 4185376 |
Statements
Cyclic schedules for r irregularity occurring events (English)
0 references
1990
0 references
The problem to be considered is one of scheduling r cyclic task events that are activated according to some fixed periodic pattern. Three criteria are analyzed: minimizing the maximum distance between two events, maximizing the minimum distance and minimizing the sum of squared distances. For all three problems polynomial algorithms are given, if r is fixed. For general r, however, the problems are NP-hard.
0 references
cyclic scheduling
0 references
polynomial algorithms
0 references
NP-hard
0 references
0.8600321412086487
0 references
0.8140520453453064
0 references
0.796370267868042
0 references
0.7732969522476196
0 references
