0% found this document useful (0 votes)
1 views

Module 35

The document outlines the Event Scheduling/Time Advance Algorithm used in simulations to manage the chronological order of events through a future event list (FEL). It explains how future events are scheduled based on activity durations and how random occurrences are represented statistically. The process involves executing imminent events, updating system snapshots, and advancing simulation time until completion.

Uploaded by

homeimran0335
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1 views

Module 35

The document outlines the Event Scheduling/Time Advance Algorithm used in simulations to manage the chronological order of events through a future event list (FEL). It explains how future events are scheduled based on activity durations and how random occurrences are represented statistically. The process involves executing imminent events, updating system snapshots, and advancing simulation time until completion.

Uploaded by

homeimran0335
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Modeling and Simulation

The Event Scheduling


Time Advance Algorithm

1
The Event Scheduling/Time Advance Algorithm

• The mechanism for


advancing simulation
time and
guaranteeing that all
events occur in
correct chronological
order is based on the
future event list (FEL)
• This list contains all
event notices for
events that have
been scheduled to
occur at a future
time. 2
Scheduling A Future Event

• Scheduling a future
event means that,
– At the instant an
activity begins, its
duration is computed
or drawn as a sample
from a statistical
distribution;
– And that the end-
activity event,
together with its
event time, is placed
on the future event
list 3
Random Breakdowns Or Random Arrivals

• In the real world, most


future events are not
scheduled but merely
happen
– such as random
breakdowns or
random arrivals. In
the model, such
random events are
represented by the
end of some activity,
which in tum is
represented by a
statistical distribution 4
FEL Is Ordered By Event Time

• At any given time t,


the FEL contains all
previously
scheduled future
events and their
associated event
times (called t1;t2)
• The FEL is ordered
by event time,

5
Imminent Event

– meaning that the


events are arranged
chronologically-that
is, the event times
satisfy

• Time t is the value:


– of CLOCK, the current
value of simulated
time. The event
associated with time t
1 is called the
imminent event
6
Imminent Event

– Imminent event;
that is, it is the next
event that will occur
• After the system
snapshot at simulation
time CLOCK= t has been
updated, the CLOCK is
advanced to simulation
time CLOCK= t1 the
imminent event notice
is removed from the
FEL, and the event is
executed
7
Execution Of The Imminent Event

• Execution of the
imminent event
means that a new
system snapshot for
time t1 is created, one
based on the old
snapshot at time t and
the nature of the
immi­nent event

8
Execution Of The Imminent Event

• At time t1, new future


events may or might
not be generated, but
if any are, they are
scheduled by creating
event notices and
putting them into
their proper position
on the FEL

9
Execution Of The Imminent Event

• After the new system


snap­shot for time t 1
has been updated, the
clock is advanced to
the time of the new
imminent event and
that event is executed.
This process repeats
until the simulation is
over.

10
Summary

• To summarize the
discussion, when using
the Event-scheduling
Approach, a simulation
analyst concentrates on
events and their effect
on system state

11

You might also like