Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830)

From MaRDI portal
Revision as of 23:49, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
scientific article

    Statements

    Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (English)
    0 references
    0 references
    30 January 2001
    0 references
    scheduling theory
    0 references
    branch and bound
    0 references
    parallel machines
    0 references
    makespan
    0 references

    Identifiers