learn/queueing at main · marimo-team/learn · GitHub

Repository navigation

Name		Name	Last commit message	Last commit date
parent directory ..
01_basic_ideas.py		01_basic_ideas.py
02_queue_formation.py		02_queue_formation.py
03_littles_law.py		03_littles_law.py
04_sojourn_time.py		04_sojourn_time.py
05_mm1_nonlinearity.py		05_mm1_nonlinearity.py
06_pooled_vs_separate.py		06_pooled_vs_separate.py
07_late_merge.py		07_late_merge.py
08_inspectors_paradox.py		08_inspectors_paradox.py
09_convoy_effect.py		09_convoy_effect.py
10_priority_starvation.py		10_priority_starvation.py
11_tandem_queue.py		11_tandem_queue.py
12_rush_hour.py		12_rush_hour.py
13_braess_paradox.py		13_braess_paradox.py
README.md		README.md

README.md

title	Learn Queueing Theory
description	Why is your line always slower than the other one? Why do traffic jams happen without any apparent cause? These lessons use a mixture of queueing theory and simulation to explain these scenarios and others.
tracking	136

You can open and run these notebooks in molab, marimo's free hosted notebook platform.

Notebooks

Basic Ideas in Queueing Theory
Queue Formation
Little's Law
Sojourn Time
M/M/1 Queue Nonlinearity
Pooled vs. Separate Queues
Late Merge
The Inspector's Paradox
The Convoy Effect
Priority Starvation
Tandem Queue Blocking
Rush Hour Displacement
Braess's Paradox

Contributors

Thanks to our notebook authors:

Greg Wilson