The minimum dummy task problem (Q3787785)

From MaRDI portal
Revision as of 17:18, 18 June 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
The minimum dummy task problem
scientific article

    Statements

    title
    The minimum dummy task problem (English)
    0 references
    published in
    Networks
    0 references
    publication date
    1986
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    90C35
    0 references
    65K05
    0 references
    68Q25
    0 references
    zbMATH DE Number
    4051340
    0 references
    zbMATH Keywords
    management of large projects
    0 references
    The minimum dummy task problem
    0 references
    PERT networks
    0 references
    NP-complete
    0 references
    heuristic algorithm
    0 references
    interval orders
    0 references
    series- parallel partial orders
    0 references
    author
    Jeremy P. Spinrad
    0 references
    OpenAlex ID
    W2144130180
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3787785&oldid=34786872"
    Powered by MediaWiki