COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS (Q3026722): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3251608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THEORY OF RELATIVELY CLOSED SYSTEMS WITH ELEMENTS EXHIBITING LINEAR BEHAVIOUR—PART I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANALYSIS OF AN INVENTORY CONTROL SYSTEM USING THE THEORY OF RELATIVELY CLOSED SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE AXSÄTER INTEGRATED PRODUCTION-INVENTORY SYSTEM INTERPRETED IN TERMS OF THE THEORY OF RELATIVELY CLOSED SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs, dynamic programming, and finite games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512461 / rank
 
Normal rank

Latest revision as of 11:03, 18 June 2024

scientific article
Language Label Description Also known as
English
COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS
scientific article

    Statements

    COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    oriented network of activities
    0 references
    theory of relatively closed systems
    0 references
    completion times
    0 references
    maximum operators
    0 references
    0 references