Operations Research
Scheduling, queueing, network design, and decision analysis.
Operations Research. Scheduling, queueing, network design, and decision analysis. This page collects canonical references that organise the subject and provide entry points to its main techniques.
Foundations and canonical references
The standard treatments of operations research approach the subject from complementary angles. Hillier, Introduction to Operations Research (2014) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to. Taha, Operations Research: An Introduction (2017) gives a parallel, more proof-oriented exposition of the same material and is widely used as a graduate text.
Open methodological questions for operations research include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
- textbook · primary · 2014Introduction to Operations Researchhillier-2014, lieberman-2014
- textbook · primary · 2017Operations Research: An Introductiontaha-2017
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Explore
- 01
Queueing Theory
M/M/1, networks of queues, and heavy-traffic limits.
- 02
Scheduling Theory
Job-shop, flow-shop, and online scheduling algorithms.
- 03
Network Optimization
Shortest paths, max flow, and multi-commodity flow.
- 04
Markov Decision Processes
Dynamic programming, value/policy iteration, and average-reward MDPs.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.