Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535)

From MaRDI portal
Revision as of 16:35, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
scientific article

    Statements

    Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (English)
    0 references
    0 references
    0 references
    7 October 1998
    0 references
    0 references
    job shop
    0 references
    flow shop
    0 references
    resource-constrained scheduling
    0 references
    makespan
    0 references
    mean flow time
    0 references
    weighted number of tardy tasks
    0 references
    polynomial time algorithms
    0 references
    multiprocessor tasks
    0 references
    0 references