Operations Research and Queuing Theory Fundamentals

Posted on Aug 17, 2026 in Mathematics

Operations Research for Decision-Making

Operations Research (OR) is a scientific approach to decision-making that involves the application of mathematical models, statistics, and algorithms to help organizations solve complex problems and improve performance.

Steps to Solve a Model

  1. Formulate the Problem: Define the problem clearly. Identify the objective (maximize profit, minimize cost), the decision variables (what to decide), and the constraints (limitations).
  2. Construct a Mathematical Model: Represent the problem in mathematical terms. This usually involves an objective function and a set of constraints (equations or inequalities).
  3. Solve the Model: Use an appropriate mathematical technique (Simplex method, graphical method, transportation algorithm) to find the optimal solution.
  4. Validate the Model: Check if the model’s output makes sense. Test it with historical data or expert opinion to see if it accurately represents the real-world situation.
  5. Implement the Solution: Translate the mathematical solution into actionable management decisions and put them into practice.

Limitations of Operations Research

  • Cost and Time: The process of data collection, model building, and solving can be expensive and time-consuming.
  • Quantification Difficulties: Not all factors in a problem (human behavior, employee morale) can be easily quantified and included in a mathematical model.
  • Assumptions: Models are built on assumptions that may not always hold true in the real world (linearity, certainty).
  • Implementation Resistance: Solutions provided by OR might be met with resistance from employees or management if they are not well understood or if they threaten established practices.

The Queuing Process and Waiting Line Analysis

A queuing process is the mathematical study of waiting lines. It analyzes the performance of a system where customers arrive for service, wait in a queue (if all servers are busy), and then receive service.

Key Components of a Queuing System

  • Arrival Process: How customers arrive (one by one, in batches) and the time between arrivals.
  • Service Process: How customers are served (single server, multiple servers) and the service time.
  • Queue Discipline: The order in which customers are served (FIFO, LIFO).
  • Number of Servers: The number of service channels available.

M/M/1 Model: Single Server Queue Example

Example: A single-teller bank counter.

The arrival rate of customers is 2 per minute, and the service rate of each server is 3 per minute. The probability of the system being empty is calculated using the Erlang-C formula: P0 = (2 / (2 + 3)) = 0.4. The average number of customers in the system is calculated as: L = (2 / 3) / (1 – (2 / (2 + 3))) = 0.8. The average time a customer spends in the system is calculated as: W = 1 / (3 – 2) = 1. The probability of there being n customers in the system is calculated using the Poisson distribution with λ = 2.

This is just a high-level example, and parameters such as arrival, service rate, or utilization are often used to solve this in real-world scenarios.

Assumptions in Queuing Theory

  • Unlimited Population: The number of potential customers is infinite, or the arrival rate is independent of the number of customers already in the system.
  • Poisson Arrivals: The inter-arrival times follow an exponential distribution, meaning arrivals are random and memoryless.
  • Exponential Service Times: Service times follow an exponential distribution.
  • FIFO: This is the most common queue discipline assumed (First-In, First-Out).
  • Steady State: The system has been running for a long enough time that the average behavior does not change over time (e.g., λ < μ for M/M/1 to be stable).

Kendall’s Notation for Queuing Models

Kendall’s Notation is a standardized shorthand system used to describe the characteristics of a queuing system. It was introduced in 1953 and provides a concise way to represent the key parameters of a waiting line model.

Basic Form: A/S/c

  • A: Describes the arrival process (e.g., M for Markovian/Poisson, D for Deterministic, G for General).
  • S: Describes the service process (e.g., M, D, G).
  • c: Describes the number of service channels (servers).

The extended notation is A/S/c/K/N/D, where:

  • K: The capacity of the system (e.g., the maximum number of customers allowed in the queue).
  • N: The size of the calling population.
  • D: The queue discipline (FIFO).