Scheduling identical jobs with chain precedence constraints on two uniform machines (Q1974574): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / author
 
Property / author: Johann L. Hurink / rank
 
Normal rank
Property / author
 
Property / author: Wiesław X. Kubiak / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 05:25, 5 March 2024

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