Notation For Theoretic Scheduling Problems - Examples

Examples

Adapted from

1|prec|
a single machine, general precedence constraint, minimizing maximum lateness.
R|pnmt|
variable number of unrelated parallel machines, allowing preemption, minimizing total completion time.
J3||
3-machines job shop with unit processing times, minimizing maximum completion time.

Read more about this topic:  Notation For Theoretic Scheduling Problems

Famous quotes containing the word examples:

    “No rules exist, and examples are simply life-savers answering the appeals of rules making vain attempts to exist.”
    —André Breton (1896–1966)

    “Histories are more full of examples of the fidelity of dogs than of friends.”
    —Alexander Pope (1688–1744)

    “There are many examples of women that have excelled in learning, and even in war, but this is no reason we should bring ‘em all up to Latin and Greek or else military discipline, instead of needle-work and housewifry.”
    —Bernard Mandeville (1670–1733)