The Complexity of Flowshop and Jobshop Scheduling (Q4180114): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/moor.1.2.117 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157846217 / rank
 
Normal rank

Latest revision as of 00:04, 20 March 2024

scientific article; zbMATH DE number 3616166
Language Label Description Also known as
English
The Complexity of Flowshop and Jobshop Scheduling
scientific article; zbMATH DE number 3616166

    Statements

    The Complexity of Flowshop and Jobshop Scheduling (English)
    0 references
    0 references
    0 references
    0 references
    1976
    0 references
    Complexity
    0 references
    Flow Shop Scheduling
    0 references
    Jobshop Scheduling
    0 references
    Np-Complete Problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references