Bibliographic Details
| Title: |
ON TIME FLOW MECHANISMS FOR DISCRETE SYSTEM SIMULATION. |
| Authors: |
Nance, Richard E. |
| Source: |
Management Science (INFORMS); Sep71, Vol. 18 Issue 1, p59-73, 15p |
| Subject Terms: |
System analysis, Systems theory, Simulation methods & models, Scheduling, Discrete-time systems, Time-domain analysis, Time series analysis, Dynamic programming, Computer simulation, SIMSCRIPT (Computer program language), Computer programming |
| People: |
Kiviat, Phil |
| Abstract: |
Previous concepts of time flow mechanisms are inadequate for categorizing or describing the algorithms for time flow which may prove most efficient for a particular systems application. The work of Kiviat provides a more meaningful categorization. The patrolling repairman problem serves as an example of the ambiguity and inconsistency in the use of fixed time and next-event classification. Three algorithms for time flow in the patrolling model are offered. Theoretical development is provided for the two more sophisticated algorithms--the variable increment (VIA) and the minimum increment comparison (MICA). Comparison of execution times for the three algorithms shows the constant increment (CI) to be generally more efficient. The concept of a continuum of algorithms for representing the passage of time is advanced. Fixed time methods with δt considered a "clock tick" define one end of the continuum, and next-event methods utilizing strictly the push down/pop up stack approach define the other. Between these two extremes lie other algorithms possessing characteristics of both but which may prove more advantageous for any specific application of discrete system simulation. [ABSTRACT FROM AUTHOR] |
|
Copyright of Management Science (INFORMS) is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
