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:

    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)

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

    It is hardly to be believed how spiritual reflections when mixed with a little physics can hold people’s attention and give them a livelier idea of God than do the often ill-applied examples of his wrath.
    —G.C. (Georg Christoph)