Category Archives: Operations Management

Theory Tuesday- Queueing Notation

When people describe queues in queueing theory, they use a certain notation that at first looks cryptic. For example, a queue that has exponential interarrival times, exponential service times, one server, and room for 10 people in the queue is denoted as an M/M/1/10 queue.

What do the letters in queueing notation mean?

The first letter specifies the probability distribution of interarrival times.
The second letter specifies the probability distribution of service times.
The third letter represents the number of servers working in parallel in the queue.
The fourth letter represents the maximum number of customers in the queue. If omitted, it is assumed to be infinite.

Here are the most common options for the first two letters:
M = exponential (Markovian) distribution
D = deterministic arrival/service times
E_n = gamma distribution with shape parameter n (also called an Erlangian distribution)
G = general distribution (most everything else)

Scout Scheduling

Interesting cover story in the most recent Analytics magazine from INFORMS. It tells the story of how The Perduco Group, a small defense consulting firm out of Dayton, Ohio, started offering services in the field of sports analytics. Yes, right now it appears the firm only has one lead analyst in the sports realm, but they still have a variety of interesting services/offerings.

The most interesting offering in the sports realm was in the scheduling of the travel of scouts. It makes sense that you would want to maximize the time your scouts spend viewing high value recruits while minimizing travel costs. Once schedules and players of interest are inputted, it seems like a great area for automation/optimization. Great idea.

A small company that focuses on defense and sports. Seems right up my alley.

sports scheduling header
(Image from The Perduco Group’s website http://www.theperducogroup.com/#!scout-scheduling/c1gq4. Click on the image to see it a bit larger.)

Theory Tuesday- Generating a Random Number from any Probability Distribution

Assumption: You can generate X, a random number from a Uniform[0,1] Distribution. There are many ways to do that.

The objective is to turn X, which is uniformly distributed between 0 and 1, into Y, which is a random number from a probability distribution of your choosing. Examples of probability distributions are the Normal Distribution, Exponential Distribution, and Beta Distributions.

Key insight: All probability values are between 0 and 1. The cumulative distribution function (CDF) for a probability distribution gives the percent of the distribution that is below a value in the distribution. Take X, the number in Uniform[0,1], and transform it into Y, a value in your distribution of interest that has CDF X.

Example: Say you generate X=.766 and want a random number, Y, from the standard normal distribution (mean=0, standard deviation=1). Abbreviate the standard normal distribution as N[0,1]. Let F(x) be the CDF of N[0,1]. To generate Y~N[0,1], we need to find Y=F^{-1}(X), where F^{-1} is the inverse of the CDF. We can look up F^{-1}(X)=F^{-1}(.766) in a normal distribution table or by using the function norm.inv(.766,0,1) in Excel. We find that the value of interest is Y=.7257.

For distributions whose CDF is invertible, we can find equations for Y, the random number from the distribution. Take the exponential distribution for example. The CDF of the exponential distribution with mean 1/\lambda is F(y)=1-e^{-\lambda y}. Solve F(y)=x for y. We find y=F^{-1}(x)=\frac{-\ln(1-x)}{\lambda}. Now, when we generate any X~U[0,1], we can use the equation for F^{-1}(X) to find Y, which is a random number from the exponential distribution.

For distributions whose CDF is not continuous, you will want to find the smallest Y who has a CDF of at least X.

Theory Tuesday- An Overview of Decision Analysis

Ralph Keeney wrote an article “Decision Analysis: An Overview” in the journal Operations Research in 1982. It is one of the best expositions on what the field of Decision Science/Analysis actually is.

He first introduces the field as “a formalization of common sense for decision problems which are too complex for informal use of common sense.” The problems that require formal decision analysis methodologies to arrive at a good answer are typically big and messy: many stakeholders, competing objectives, subjective valuations of alternatives, various levels of risk tolerance, and hazy projections. In these situations, four steps are needed:
1. Structure the decision problem
2. Assess possible impacts of each alternative
3. Determine preferences (values) of decision makers
4. Evaluate and compare alternatives

Toward the end of the longish (30+ page) article is this beautiful paragraph:

“Decision analysis embodies a philosophy, some concepts, and an approach to formally and systematically examine a decision problem. It is in no way a substitute for creative, innovative thinking, but rather it promotes and utilizes such efforts to provide important insights into a problem. Philosophically, decision analysis relies on the basis that the desirability of an alternative should depend on two concerns: the likelihoods that the alternative will lead to various consequences and the decision maker’s preferences for those consequences. Decision analysis addresses these concerns separately and provides the logic and techniques for integrating them.”

It is a great article for the layman or young analyst and highly recommended.

Theory Thursday- Little’s Law

Little’s Law or Little’s Formula is a way to relate the average length of a queue and the average waiting time in a queue. It was proved by John Little in 1960 while Little was at the Case Institute of Technology. The paper proving the result is one of the most cited in the field of Operations Research.

Let W be the average time a customer spends waiting in a queue. Let L be the average length of the queue. Let \lambda be the arrival rate to the queue—the average number of people that arrive per unit time. Then the three quantities can be related by the simple formula L= \lambda W.

This result holds no matter the arrival process (Poisson, deterministic, etc.), the service process (Poisson, deterministic, etc.), the queueing discipline (first come first served, last in first out, etc.), and the number of servers. It also holds for total time in the system, if you instead use L_s and W_s as the average number of people in the system –combining those in queue and those in service—and the average time in system, respectively. L_s= \lambda W_s.

Theory Tuesday- Prospect Theory

Prospect Theory, created by Kahneman and Tversky, is a way to quantify utility functions for people. In traditional economics, a dollar is a dollar and people are expected to maximize their wealth. In reality, people have biases. The two major biases shown in prospect theory are diminishing sensitivity and loss aversion.

Diminishing sensitivity makes people notice $1 changes in their wealth less the farther that they get from their reference point. $1 means a lot more to someone who is close to breaking even than to someone else who has already made a million dollars.

Loss aversion refers to the fact that people feel losses more strongly than equal sized gains. A loss of $100, relative to your reference point, feels worse than a gain of $100 feels good.

The effects can be seen in the following pictures. (a) isolates diminishing sensitivity and (b) isolates loss aversion. Their combined effects are shown in (c).

RplotAllThree

Queues are a Tragedy of the Commons

Interesting job talk by Shiliang Cui today. He walked through the logic of customers joining a queue. Customers get a reward once they receive service, but have a cost that is proportional to the time spent in queue. So rational customers can join the queue or balk at the length of the line and leave. Additionally, Shiliang added the concept of retrying, where the customer leaves now but comes back later to retry at the line. Customers pay a retrial cost for this inconvenience.

By comparing the benefit from receiving service to the queue and retrial costs, optimal policies for the behavior of the customer can be found. Typically, these policies have the form: join the queue and wait for service if there are N or less customers in queue and balk or retry otherwise (depending on retrial costs).

The interesting part are the Socially Optimal Policies. If all customers were to act in a way that maximizes the benefits to society as a whole, fewer people would wait in line and more people would balk or retry. This is because, as a utility maximizing individual, I do not consider the effect on others when I decide to wait in a queue. If I did, I would wait less often, because my waiting makes the queue longer for others, which increases their queueing costs. Though Shiliang didn’t make this comparison, I feel like this is an example of The Tragedy of the Commons. When everyone considers only their own interests, their actions have negative externalities on others. The more people that join the queue, the worse off everyone is.