An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity (Q4697081)

From MaRDI portal
Revision as of 22:50, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 221602
Language Label Description Also known as
English
An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity
scientific article; zbMATH DE number 221602

    Statements

    An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity (English)
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    linear time algorithms
    0 references
    makespan
    0 references
    worst-case complexity
    0 references
    average-case complexity
    0 references
    NP-hard open shop scheduling
    0 references
    two machines
    0 references
    two distinct release dates
    0 references
    weighted sum of machine completion times
    0 references
    rolling horizon
    0 references

    Identifiers