COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS
From MaRDI portal
Publication:3026722
DOI10.1108/eb005764zbMath0624.90043MaRDI QIDQ3026722
Robert W. Grubbström, Janerik Lundquist
Publication date: 1987
Published in: Kybernetes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/eb005764
completion times; maximum operators; oriented network of activities; theory of relatively closed systems
90B35: Deterministic scheduling theory in operations research
90B10: Deterministic network models in operations research
Cites Work
- Graphs, dynamic programming, and finite games
- THE AXSÄTER INTEGRATED PRODUCTION-INVENTORY SYSTEM INTERPRETED IN TERMS OF THE THEORY OF RELATIVELY CLOSED SYSTEMS
- ANALYSIS OF AN INVENTORY CONTROL SYSTEM USING THE THEORY OF RELATIVELY CLOSED SYSTEMS
- THEORY OF RELATIVELY CLOSED SYSTEMS WITH ELEMENTS EXHIBITING LINEAR BEHAVIOUR—PART I
- Unnamed Item
- Unnamed Item
- Unnamed Item