Cyclic schedules for r irregularity occurring events
From MaRDI portal
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.
Recommendations
Cites work
- A characterization of the minimum cycle mean in a digraph
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3694971 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- Optimal schedules for periodically recurring events
- Scheduling two irregular polygons
Cited in
(12)- Disjoint congruence classes and a timetabling application
- Scheduling two irregular polygons
- Computing the minimum Hausdorff distance between two point sets on a line under translation
- On the stabilization of resource usage for cyclical sequencing problems
- Discrete optimization in public rail transport
- Optimal schedules for periodically recurring events
- Scheduling with safety distances
- A genetic algorithm approach to periodic railway synchronization
- Polygon scheduling
- Periodic network optimization with different arc frequencies
- Pattern scheduling
- Scheduling periodic events
This page was built for publication: Cyclic schedules for r irregularity occurring events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639766)