How QCTNH Determines the Next Eligible Task
QCTNH’s Next Eligible Task value is the earliest next_execution among enabled, valid, non-CLI-only Scheduled Tasks that have a known execution time.
Selection rule
After applying the same eligibility filter used for due tasks, QCTNH orders next_execution ascending and reads the first value. If due work exists, the Dashboard labels this metric Oldest Due Task; otherwise it labels it Next Eligible Task.
How the label changes meaning
| Queue state | Dashboard label | Meaning |
|---|---|---|
| One or more eligible tasks overdue | Oldest Due Task | Shows the earliest overdue timing and notes how many eligible tasks are overdue. |
| No overdue work, future task known | Next Eligible Task | Shows when the earliest web-runnable task is expected. |
| No eligible known time | Next Eligible Task | Shows Waiting / unknown. |
Why this drives efficient polling
When a future next-due time is known, QuantaCade can schedule the next poll around that time with a small jitter instead of waking the site every few minutes.
Timing consequence
The scheduler rule described in How QCTNH Determines the Next Eligible Task also affects when QuantaCade should wake the site. QCTNH reports aggregate next_due, whether that value is known, and a due count. When an exact future time is known, the central service can sleep toward that point instead of generating fixed high-frequency traffic.
If timing is unknown, QCTNH falls back to the configured Maximum Scheduler Delay and safety rechecks. Therefore a timing problem should be diagnosed from the scheduler snapshot first, not by assuming the service is simply a cron request every N minutes.
Community Discussion
Want to compare scheduler workflows, share practical tips, or discuss how you use this QCTNH feature? Visit the QC Task Nudge & Health Community. For private support, bug reports, account-specific issues, or feature requests, use the QuantaCade support system.