Skip to content

Time-Utility Function

A function that assigns an application-specific utility to completing an action at each possible time, generalizing deadlines so schedulers can optimize accrued value rather than timeliness alone.

Version
v1 · 2026-09-28 · History
Domain-specific #
12563
Domain group
Applied Sciences & Engineering
Origin domain
Computer Science & Software Engineering
Subdomain
Real Time Scheduling → Computer Science & Software Engineering
Aliases
Time/Utility Function, Time/Value Function, TUF

Core Idea

A time/utility function replaces the binary on-time/late view with a value curve. It asks not only whether an action finishes by a deadline, but how much application utility its completion produces at each time.

The model becomes operational through utility-accrual scheduling: predicted completions are placed on their curves, utilities are aggregated, and the schedule is chosen under execution, resource, dependency, and assurance constraints.

Structural Signature

Sig role-phrases:

  • Action or task — Is the work whose completion produces value. It is decision item. Counterfactual: Release, duration, and dependencies constrain completion.
  • Completion time — Indexes the function and determines realized utility. It is independent variable. Counterfactual: Start time alone is not the usual argument.
  • Utility curve — Encodes how value changes before and after critical times. It is value model. Counterfactual: It may be constant, stepped, decreasing, or otherwise application-defined.
  • Critical time — Marks a deadline, inflection, or other consequential timing boundary. It is temporal landmark. Counterfactual: A TUF need not become zero there.
  • Scheduler — Selects and orders actions under finite resources. It is decision process. Counterfactual: Optimality depends on the full system model.
  • Accrued-utility objective — Combines realized task utilities into schedule quality. It is objective. Counterfactual: Weights, risk, energy, and predictability may alter aggregation.

What It Is Not

  • It is not merely a deadline timestamp.
  • It is not static task priority unless priority is time-indexed.
  • It is not necessarily monotone or zero after a critical time.
  • It does not determine a schedule without execution and resource models.
  • Closest near-miss. A deadline says when a requirement changes; a TUF says how completion value varies across time and can represent a deadline as one particular curve.

Scope of Application

  • Real-time computing. Represents hard, firm, soft, and graded timing value.
  • Utility-accrual scheduling. Chooses work to maximize application benefit.
  • Autonomous systems. Trades timeliness among sensing, planning, and actuation tasks.
  • Quality-of-service control. Balances value, predictability, energy, and overload behavior.

Clarity

State the action, time origin, completion-time argument, utility meaning and scale, curve shape and discontinuities, critical times, post-critical behavior, execution-time estimate or distribution, release and dependencies, resources, aggregation rule, negative utility, overload and abort policy, uncertainty, optimality criterion, and assurances required.

Manages Complexity

Completion value interacts with uncertain durations, shared resources, dependencies, preemption, overload, and noncomparable stakeholder utilities. Optimizing a sum can hide tail risk or starvation.

Abstract Reasoning

  1. Elicit the action-specific consequence of completion at different times.
  2. Choose an explicit time origin, scale, and curve consistent with those consequences.
  3. Model execution, releases, dependencies, resources, and uncertainty.
  4. Evaluate candidate schedules by realized utilities plus declared constraints and secondary objectives.
  5. Validate that the selected schedule preserves required guarantees rather than merely increasing the aggregate score.

Knowledge Transfer

Time-indexed value transfers to logistics, robotics, communications, and service operations when completion consequences can be elicited. Economic discount functions should not be imported unchanged: their intertemporal preference semantics differ from task-completion utility and scheduling feasibility.

Examples

Canonical

A surveillance update has high utility if completed before the tracked state becomes stale, declining utility during a short grace interval, and zero utility afterward; a scheduler compares that curve with other tasks to maximize total accrued utility.

Mapped back: action → state update; argument → completion time; curve → plateau then decline; objective → sum of realized utility.

Applied / In Practice

A job labeled priority 8 retains the same rank regardless of when it finishes. Unless priority is converted into a completion-time value curve, it is not a TUF.

Mapped back: representation → static priority; completion-time mapping → absent; verdict → not a TUF.

Structural Tensions

T1 — Expressive Timeliness versus Elicitation Burden. Rich curves represent gradual or negative lateness consequences but require defensible domain valuation.

Diagnostic: Who can justify the utility scale and shape?

T2 — Maximal Aggregate Value versus Individual Guarantees. Utility accrual can sacrifice a low-value task even when stakeholders expect every task to meet a bound.

Diagnostic: Which constraints remain inviolable?

Structural–Framed Character

Time-Utility Function is structural as a completion-time-to-value mapping and framed by real-time scheduling and utility accrual.

Structural Core vs. Domain Accent

The broad pattern is assigning value to outcomes conditional on time. Real-time systems add executable tasks, critical times, overload, resource competition, and schedule-level utility aggregation.

This entry presupposes Utility.

  • Approved real-time scheduling root. No frozen parent entails application-defined completion-time utility.

  • Related — deadline, utility, utility-accrual scheduling, discount function, response time, and priority scheduling. They are special case, value concept, optimization paradigm, neighbor, observed timing, and contrasting control.

Relationships to Other Abstractions

Local relationship map for Time-Utility FunctionParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Time-Utility FunctionDOMAINPrime abstraction: Utility — presupposesUtilityPRIME

Current abstraction Time-Utility Function Domain-specific

Parents (1) — more general patterns this builds on

  • Time-Utility Function presupposes Utility Prime

    Time-Utility Function presupposes Utility: the parent's defining role is necessary to the child's frozen mechanism or criterion.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Time-Utility Function sits in a moderately populated region (47th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Decision & System Modeling Frameworks (30 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

  • Deadline. Tell: Provides a temporal bound but not a general value curve.
  • Discount function. Tell: Values delayed payoffs in intertemporal choice rather than task completion under a scheduler.
  • Static priority. Tell: Orders tasks without necessarily changing with completion time.
  • Response-time distribution. Tell: Describes when work completes, not the utility of that completion.

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Time-utility_function (revision 1329484911).
  • Preserved source candidate: https://en.wiktionary.org/wiki/monotonic_decreasing#:~:text=English-,Adjective,contrast%20this%20with%20strictly%20decreasing
  • Preserved source candidate: https://www.real-time.org
  • Preserved source candidate: https://www.ssrg.ece.vt.edu/allpapers.php
  • Preserved source candidate: https://www.stern.nyu.edu/om/faculty/pinedo/schedtheory/book5/index.html
  • Preserved source candidate: https://www.springer.com/us/book/9783662593615?gclid=Cj0KCQjwsuP5BRCoARIsAPtX_wHOG2nAkt8eTSFJbhNa4VXlQBt_xhirlmE-ECUV5cnq8nPqgH6gpJUaAuGaEALw_wcB
  • Preserved source candidate: https://www.academia.edu/15210217/Fifty_years_of_scheduling_a_survey_of_milestones?auto=download&email_work_card=download-paper
  • Preserved source candidate: https://www.springer.com/journal/10951
  • Preserved source candidate: http://www.schedulingconference.org/

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.