MIT OpenCourseWare

Browse materialsMIT 15.072J · Spring 2006

Queues: Theory and Applications

Subjects: Management · Mathematics

Art: Gaston, John, (John Gaston merchant ledger) - DPLA -…, 1773 · Public domain

Instructors: Prof. David Gamarnik, Premal Shah
Term: Spring 2006
Level: Graduate
What's inside: 1 reading · 13 other files · 5 web pages
Materials open: MIT OCW

Start here

Start course: Lecture 1: Fundamental Insights: The M/M/s Type Systems Find a topic

Progress is saved in this browser.

Export or import progress

About this course

Source: MIT OpenCourseWare 15.072J Queues: Theory and Applications, Spring 2006, Prof. David Gamarnik, Premal Shah — original course page on ocw.mit.edu ↗. License: CC BY-NC-SA 4.0. Study order: MIT's own listing order, section by section. Taken from MIT's published course files, downloaded from ocw.mit.edu on September 23, 2026. How RedLectern is built.

Materials are grouped the way MIT organized them. A verified, course-wide order has not been established here.

Has MIT solutions 5 files in this course are named by MIT as solutions.

Before you start

Prerequisites are not listed here. Check MIT's own syllabus for this course.

This course’s cited books, in our reading lists: Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization

How this course was organized

What's here, and what isn't

A lecture sequence of 26 items is confirmed. It stays as organized materials rather than a full course order.

Not included here

1 item from the source could not be safely included:

MIT's page format for this item wasn't recognized clearly enough to place it safely.

Materials by section

Grouped by section, as MIT organized them. Not sequenced or ordered.

Assignments

Exams

Projects

Here is the computer project required for this class.PDF Download

Other materials from this course

MIT OpenCourseWare, Prof. David Gamarnik, Premal Shah, 15.072J Queues: Theory and Applications, Spring 2006.

License: CC BY-NC-SA 4.0 · Edition: Spring 2006 · Open the original course on OCW ↗

Organized by RedLectern, independent of MIT and not endorsed by MIT.

Per-resource rights are recorded on each resource; All-Rights-Reserved items are link-only, never mirrored.

Queues: Theory and Applications

Before you start

What's here, and what isn't

Not included here

Materials by section

Assignments

Exams

Projects

Other materials from this course

Lecture 1: Fundamental Insights: The M/M/s Type Systems

Lecture 2: Little’s Law and Generalizations

Lecture 3: Distributional Laws

Lecture 4: Conservation Laws

Lecture 5: PASTA

Lecture 6: Systems with No Overtaking: Exact Solutions

Lecture 7: Systems with No Overtaking: Asymptotic Solutions

Lecture 8: Priority, Polling Systems

Lecture 9: Multiserver Queues

Lecture 10: Queues in Halfin-Whitt Regime Applications to Call Centers

Lecture 11: Open Jackson Networks

Lecture 12: Closed Jackson Networks

Lecture 13: Multiclass Networks

Lecture 14: Adversarial Queueing Networks I

Lecture 15: Adversarial Queueing Networks II

Lecture 16: Transient Behavior of Queueing Systems

Lecture 17: Fluid Models of Queueing Systems I

Lecture 18: Fluid Models of Queueing Systems II

Lecture 19: Stability of Queueing Networks

Lecture 20: Optimization of Queueing Systems

Lecture 21: Optimization of Multiclass Networks and Fluid Models

Lecture 22: Queues in Heavy Traffic

Lecture 23: Multiclass Networks in Heavy Traffic

Lecture 24: Long Range Dependence

Lecture 25: Large Deviations and Queues

Lecture 26: Take Home Final Exam Period