Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (Q631768)

From MaRDI portal
Revision as of 05:37, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
scientific article

    Statements

    Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (English)
    0 references
    0 references
    0 references
    14 March 2011
    0 references
    bicriteria scheduling
    0 references
    machine availability constraint
    0 references
    makespan
    0 references
    total completion time
    0 references
    polynomial time algorithms
    0 references
    two machine
    0 references

    Identifiers