A linear time approximation algorithm for permutation flow shop scheduling (Q764320)

From MaRDI portal
Revision as of 00:27, 5 July 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
A linear time approximation algorithm for permutation flow shop scheduling
scientific article

    Statements

    title
    A linear time approximation algorithm for permutation flow shop scheduling (English)
    0 references
    author
    Marcus Poggi
    0 references
    David Sotelo
    0 references
    publication date
    13 March 2012
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    90B35
    0 references
    68W40
    0 references
    zbMATH DE Number
    6014311
    0 references
    zbMATH Keywords
    permutation flow shop scheduling
    0 references
    approximation algorithms
    0 references
    Erdős-Szekeres theorem
    0 references
    OpenAlex ID
    W2094146678
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q764320&oldid=35269258"
    Powered by MediaWiki