From 2ba7757028d1cb7709cb216bee594e59b806b0ee Mon Sep 17 00:00:00 2001 From: Galen Seilis Date: Tue, 24 Oct 2023 18:05:39 -0700 Subject: [PATCH 1/4] Update mechanisms.rst Spelling of "prescheduled" is preferred over "pre scheduled". --- docs/Background/mechanisms.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/Background/mechanisms.rst b/docs/Background/mechanisms.rst index 45c8c6e9..b4b53c41 100644 --- a/docs/Background/mechanisms.rst +++ b/docs/Background/mechanisms.rst @@ -8,7 +8,7 @@ General ~~~~~~~ Ciw uses the *event scheduling* approach [SW14]_ , similar to the three phase approach. -In the event scheduling approach, three types of event take place: **A Events** move the clock forward, **B Events** are pre scheduled events, and **C Events** are events that arise because a **B Event** has happened. +In the event scheduling approach, three types of event take place: **A Events** move the clock forward, **B Events** are prescheduled events, and **C Events** are events that arise because a **B Event** has happened. Here **A-events** correspond to moving the clock forward to the next **B-event**. **B-events** correspond to either an external arrival, a customer finishing service, or a server shift change. From 4ab09b5e80f4d44d3d5a500eff2505e7bdc149cd Mon Sep 17 00:00:00 2001 From: Galen Seilis Date: Tue, 24 Oct 2023 18:09:42 -0700 Subject: [PATCH 2/4] Update other.rst - Link to Arena is deprecated. - Added queueing-tool as it is a dedicated library for queueing networks. - Put the simulation packages in alphabetical order. --- docs/Background/other.rst | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/docs/Background/other.rst b/docs/Background/other.rst index a0c6c4b5..c560e67b 100644 --- a/docs/Background/other.rst +++ b/docs/Background/other.rst @@ -7,11 +7,11 @@ Other Computer Simulation Options Ciw is just one way in which simulations of queueing networks can be carried out. Here is a list of other options that may be of interest, both commercial and open source: -- `SimPy `_ -- `SIMUL8 `_ - `AnyLogic `_ - `Khronos `_ - `NetSim `_ -- `Arena `_ +- `Queueing-tool `_ +- `SimPy `_ +- `SIMUL8 `_ -For a comparison of Ciw with other simulation tools, in terms of reproducibility and performance, see `Ciw: An open-source discrete event simulation library `_ in the Journal of Simulation. \ No newline at end of file +For a comparison of Ciw with other simulation tools, in terms of reproducibility and performance, see `Ciw: An open-source discrete event simulation library `_ in the Journal of Simulation. From 0c01da4d3e2db49a86e627db5bd6a9abf896f3fd Mon Sep 17 00:00:00 2001 From: Galen Seilis Date: Tue, 24 Oct 2023 18:20:03 -0700 Subject: [PATCH 3/4] Update tutorial_iii.rst Using "a" list comprehension. --- docs/Tutorial-I/tutorial_iii.rst | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/Tutorial-I/tutorial_iii.rst b/docs/Tutorial-I/tutorial_iii.rst index 3dba17d7..88a50319 100644 --- a/docs/Tutorial-I/tutorial_iii.rst +++ b/docs/Tutorial-I/tutorial_iii.rst @@ -40,7 +40,7 @@ This returns a list of named tuples. Each named tuple contains the following inf More information on each of these is given in :ref:`refs-results`. -Using list comprehension, we can get lists on whichever statistic we like:: +Using a list comprehension, we can get lists on whichever statistic we like:: >>> # A list of service times >>> servicetimes = [r.service_time for r in recs] @@ -85,4 +85,4 @@ This is the average utilisation of each server, which is the amount of time a se Thus in our bank, on average the servers were busy 75.3% of the time. -The next tutorial will show how to use Ciw to get trustworthy results, and finally find out the average waiting time at the bank. \ No newline at end of file +The next tutorial will show how to use Ciw to get trustworthy results, and finally find out the average waiting time at the bank. From fc13d68efaffcca83f44bce25fcb0228f0739026 Mon Sep 17 00:00:00 2001 From: Galen Seilis Date: Tue, 24 Oct 2023 18:22:03 -0700 Subject: [PATCH 4/4] Update tutorial_iv.rst Grammar --- docs/Tutorial-I/tutorial_iv.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/Tutorial-I/tutorial_iv.rst b/docs/Tutorial-I/tutorial_iv.rst index f7f93e81..36332639 100644 --- a/docs/Tutorial-I/tutorial_iv.rst +++ b/docs/Tutorial-I/tutorial_iv.rst @@ -41,7 +41,7 @@ Therefore each trial we will run for 1 day + 200 minutes (1640 minutes):: ... mean_wait = sum(waits) / len(waits) ... average_waits.append(mean_wait) -The list :code:`average_waits` will now contain ten numbers, the mean waiting time from each of the trials. +The list :code:`average_waits` will now contain ten numbers and the mean waiting time from each of the trials. Notice that we set a different seed every time, so each trial will yield different results:: >>> average_waits