On Time Flow Mechanisms for Discrete System Simulation

Richard K. Nance
Additional contact information
Richard K. Nance: Southern Methodist University

Management Science, 1971, vol. 18, issue 1, 59-73

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 [6] 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 \Delta 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.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.1.59 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:18:y:1971:i:1:p:59-73

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().