Sequencing Algorithms and Heuristics

When a sequence timeliness optimality criterion has been established - e.g., always meet all deadlines, minimize the expected number of missed deadlines, minimize mean tardiness, maximize the expected sum of utilities, etc. - an algorithm or heuristic must be selected or devised to satisfy that criterion.

Sequencing in general is an NP-hard problem, and almost all interesting sequencing problems in particular are either known to be NP-hard or are unsolved.

[To be continued...]

Next: Worked Examples

Back to: Predictability

Add to Favorites

Print Page

Real-Time:

Real-Time Overview

Time Constraints

Deadlines

Time/Utility Functions

Time Constraints Scopes and Priorities

Sequencing

Sequencing Criteria

Timeliness Optimality

Predictability

Hard and Soft Real-Time

Sequencing Algorithms

Worked Examples

Coastal Air Defense

AWACS Tracker