Shortening Future-Event Lists

For discrete-event simulations with many exponential variates but not necessarily continuous-time Markov chains, we shorten the future-event list. No matter how many underlying exponential variates are present in principle, at any time, at most one exponential variate is on the future-event list. We point out how to find quickly the corresponding event so that overall computational complexity of the work to generate transitions is reduced.

INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.