Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms (Q3142307)

From MaRDI portal
Revision as of 23:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
scientific article

    Statements

    Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms (English)
    0 references
    0 references
    15 November 1993
    0 references
    flowshop-scheduling
    0 references
    variable processing time
    0 references
    two processors in series
    0 references
    minimum makespan
    0 references
    NP-hard
    0 references
    heuristic algorithms
    0 references

    Identifiers