# Algorithmic Scheduling **Domain:** Labor Systems / Algorithmic Governance **Doc Type:** Concept **Maturity:** Developed **Related:** [[On-Call Scheduling]], [[Continuous Availability]], [[Temporal Desynchronization]], [[Objective Function]], [[Schedule and Loop]] ## Definition Algorithmic scheduling uses forecasts, optimization rules and worker data to assign labor at fine temporal resolution. ## Schedule–Loop Context It increases regulator variety by replacing the common shift with person-specific timing. Optimization may improve matching while transferring uncertainty and planning costs onto workers. ## Continuity Context [[wiki/Existence by Scheduling|Existence by Scheduling]] is the ontological inversion of labor scheduling. The algorithm no longer assigns a living person to a shift; it assigns runtime through which an executable subject is present. Priority, preemption, latency, quota and load shedding can then regulate experienced time, cognition and social availability. The scheduler must distinguish ordinary performance management from action that lowers a subject below [[wiki/Minimum Viable Continuity|Minimum Viable Continuity]]. Scarcity can require explicit triage, but undisclosed throttling cannot substitute for [[wiki/Continuity Due Process|Continuity Due Process]]. ## Backlinks - [[Schedule and Loop]] - [[articles/Schedule and Loop|Schedule and Loop]] - [[Russia and Prussia Kybernetiks]] - [[Existence by Scheduling]] - [[Continuity Resource Allocation]]