diff options
| author | Prashant S | 2019-10-04 12:27:32 +0530 |
|---|---|---|
| committer | GitHub | 2019-10-04 12:27:32 +0530 |
| commit | ac2986488a9731cff5cbb517d8f0ef98e2561d64 (patch) | |
| tree | 7bb3f64824627ef179d5f341266a664fd0b69011 /Chemical_Simulation_by_Prof_Kannan/CH8/EX1.1 | |
| parent | cbb2770fb2f88246175add29623103a56ba338b8 (diff) | |
| parent | b3f3a8ecd454359a2e992161844f2fb599f8238a (diff) | |
| download | R_TBC_Uploads-master.tar.gz R_TBC_Uploads-master.tar.bz2 R_TBC_Uploads-master.zip | |
Added R TBC
Diffstat (limited to 'Chemical_Simulation_by_Prof_Kannan/CH8/EX1.1')
| -rw-r--r-- | Chemical_Simulation_by_Prof_Kannan/CH8/EX1.1/Ex8_1.R | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/Chemical_Simulation_by_Prof_Kannan/CH8/EX1.1/Ex8_1.R b/Chemical_Simulation_by_Prof_Kannan/CH8/EX1.1/Ex8_1.R new file mode 100644 index 00000000..e2684d17 --- /dev/null +++ b/Chemical_Simulation_by_Prof_Kannan/CH8/EX1.1/Ex8_1.R @@ -0,0 +1,9 @@ +"Consider a queueing model in which all customers have service times equal to 1, and where the times between successive customers are always
+greater than 1 (for instance, the interarrival times could be uniformly distributed over (1, 2))."
+
+"Hence, as every arrival finds the system empty and every departure leaves it empty, we have:"
+a0 = d0 = 1
+#an = proportion of customers that find n in the system when they arrive, and
+#dn = proportion of customers leaving behind n in the system when they depart
+
+#However,P0 is not equal to 1, as the system is not always empty of customers.
\ No newline at end of file |