Some complexity results in cyclic scheduling (Q1341404)

From MaRDI portal
Revision as of 10:07, 23 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
Some complexity results in cyclic scheduling
scientific article

    Statements

    title
    Some complexity results in cyclic scheduling (English)
    0 references
    author
    V. Pereyra
    0 references
    publication date
    11 January 1995
    0 references
    zbMATH Keywords
    cyclic scheduling
    0 references
    flow-shop
    0 references
    job-shop
    0 references
    flexible assembly line
    0 references
    makespan
    0 references
    NP-hard
    0 references

    Identifiers

    zbMATH DE Number
    706951
    0 references
    OpenAlex ID
    W2158408330
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1341404&oldid=34136761"
    Powered by MediaWiki