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)

    “In the examples that I here bring in of what I have [read], heard, done or said, I have refrained from daring to alter even the smallest and most indifferent circumstances. My conscience falsifies not an iota; for my knowledge I cannot answer.”
    —Michel de Montaigne (1533–1592)

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