Professional Documents
Culture Documents
Example: The Able – Baker Call Example: The Able – Baker Call
Center Problem - Components Center Problem - Components
system state events
arrival of a call
LQ(t): no of caller waiting for service at time t
service completion by Able
LA(t): Able is idle/busy at time t (0/1) service completion by Baker
LB(t): Baker is idle/busy at time t (0/1) activities
entities interarrival time of calls (as defined in table)
service time by Able (as defined in table)
callers and servers not needed to be represented service time by Baker (as defined in table)
explicitly
delays
represent in terms of state variables a caller waits in queue until Able or Baker is free
1
Definition Event Scheduling
discrete event simulation mechanism for advancing simulation depends on FEL
modeling over time of a system whose state changes scheduling a future event: at start of activity
occur at discrete points in time duration determined
produces sequence of snapshots of system evolving end-activity event and its time determined
over time all placed on FEL
Event-Scheduling / Time-Advance
Discrete Event Simulation
Algorithm
step 1: remove event notice for imminent event from world views: orientation to develop model
future events list (FEL) event-scheduling world view
step 2: advance CLOCK to imminent event time process-interaction world view
step 3: execute imminent event: update system state, activity-scanning world view
change entity attributes
step 4: generte future events (if necessary) and place the
event notices on FEL, ranked by event time
step 5: update cummulative statisics and counters
2
Process-Interaction World View Activity-Scanning World View
delay activity concentrate on
time
arrival event begin service event end service event activities of a model
conditions that allow an activity to begin
interaction
at each clock advance conditions for all activites
activity
checked
delay
time arrival event begin service event end service event if conditions true, activities started
slow runtime
mixed approach
Two interacting customer processes in a single-server queue