Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814)

From MaRDI portal
Revision as of 00:23, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6428802
Language Label Description Also known as
English
Polynomial time approximation algorithms for proportionate open‐shop scheduling
scientific article; zbMATH DE number 6428802

    Statements

    title
    Polynomial time approximation algorithms for proportionate open‐shop scheduling (English)
    0 references
    DOI
    10.1111/itor.12087
    0 references
    author
    Bahman Naderi
    0 references
    Mehdi Yazdani
    0 references
    Mostafa Zandieh
    0 references
    publication date
    22 April 2015
    0 references
    zbMATH DE Number
    6428802
    0 references
    zbMATH Keywords
    proportionate open-shop
    0 references
    polynomial time approximation algorithm
    0 references
    worst-case performance analysis
    0 references
    OpenAlex ID
    W1993127046
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5246814&oldid=35450769"
    Powered by MediaWiki