Scheduling identical jobs with chain precedence constraints on two uniform machines (Q1974574)

From MaRDI portal
Revision as of 20:56, 12 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Scheduling identical jobs with chain precedence constraints on two uniform machines
scientific article

    Statements

    Scheduling identical jobs with chain precedence constraints on two uniform machines (English)
    0 references
    0 references
    0 references
    0 references
    7 May 2000
    0 references
    Summery: The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time.
    0 references
    scheduling
    0 references
    uniform machines
    0 references
    identical jobs
    0 references
    chain precedence constraints
    0 references

    Identifiers