Resource-Constrained Assignment Scheduling (Q3750521)

From MaRDI portal
Revision as of 17:56, 21 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Resource-Constrained Assignment Scheduling
scientific article

    Statements

    title
    Resource-Constrained Assignment Scheduling (English)
    0 references
    author
    Joseph B. Mazzola
    0 references
    Alan W. Neebe
    0 references
    publication date
    1986
    0 references
    zbMATH Keywords
    resource-constrained assignment scheduling
    0 references
    NP-complete
    0 references
    branch-and-bound algorithm
    0 references
    depth-first, polychotomous branching strategy
    0 references
    subgradient optimization
    0 references
    heuristic procedure
    0 references
    approximate solutions
    0 references
    computational experience
    0 references

    Identifiers

    zbMATH DE Number
    3987055
    0 references
    OpenAlex ID
    W2108067803
    0 references
    DOI
    10.1287/OPRE.34.4.560
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3750521&oldid=39343998"
    Powered by MediaWiki