Table 1 Basic notations

OO

Ordinal Optimization

U

A set of all possible schedules in search space is termed a Candidate Set.

N

Total number of available Schedules

θ

A Schedule that is an element of the Candidate Set U.

u

The cardinality of Set U, i.e., |U| = u.

G

A Subset of U that has good enough schedules, is termed an Acceptance Set.

g

The cardinality of Set G, i.e., |G| = g.

S

A Subset of U has the most promising Schedule termed a Selection Set.

s

The cardinality of Set G, i.e., |S| = s.

M

Time taken to execute all the tasks, termed as Makespan

k

The cardinality of Set G ∩ S, i.e., | G ∩ S | = k.

HR

Horse Race condition

HR_ne

Horse Race condition with no elimination

HR_e

Horse Race condition with elimination

OPC

Ordered Performance Curve

σ

variation in noise