Deterministic Production Planning: Algorithms and Complexity (Q3890384): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q115188674, #quickstatements; #temporary_batch_1711094041063
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/mnsc.26.7.669 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061538120 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q115188674 / rank
 
Normal rank

Latest revision as of 13:57, 22 March 2024

scientific article
Language Label Description Also known as
English
Deterministic Production Planning: Algorithms and Complexity
scientific article

    Statements

    Deterministic Production Planning: Algorithms and Complexity (English)
    0 references
    0 references
    0 references
    1980
    0 references
    deterministic production planning
    0 references
    finite horizon
    0 references
    minimum total costs
    0 references
    computational complexity
    0 references
    algorithms
    0 references
    NP-hard problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references