In periodic task scheduling, requiring every worker to follow the same sequence adds at most one extra worker, and an optimal fair sequence can be found in O(n log n) time.
Well-solvable special cases of the traveling salesman problem: A survey
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
The Fair Periodic Assignment Problem
In periodic task scheduling, requiring every worker to follow the same sequence adds at most one extra worker, and an optimal fair sequence can be found in O(n log n) time.