Nobody Likes to Wait, Explained with Examples

UPI Study › Courses › Quantitative Analysis › Free lessons › Lesson 4.7 Free with a free account

Nobody Likes to Wait

Quantitative Analysis · Chapter 4: Inventory Management and QueuingSection 4.7 · lesson 18 of 5511 min · free with a free account

← Downstream ConsequencesNext lesson: Queue Design and Economics →

Earn 3 college credits for Quantitative AnalysisRecommended for credit by NCCRS · Math 250 · self-paced · one payment, lifetime access
Enroll in Quantitative Analysis · $250 →Download the syllabus (PDF)

In this lesson

Where queuing problems arise, what waiting actually costs, and the four elements every queuing model uses.

  • Recognize queuing problems in service, manufacturing, logistics and digital settings
  • Identify the economic costs of waiting, including balking and reneging
  • Describe the waiting-cost versus service-cost trade-off
  • Define the four structural elements, and tell M/M/1 from M/M/s

Transcript

Everything said in the video, section by section (1,621 words). Read along, or search it.

Inventory Management and Queuing · Section 4.7

Nobody Likes to Wait

Welcome to section four point seven, Nobody Likes to Wait. This is where the chapter turns from inventory to queues. A queue forms for exactly one reason. Demand for a service arrives faster than the system can serve it. That is the whole idea. Everything else is bookkeeping on top of it. In this section we do three things. First, we find queues in places that do not look like lines at all. Second, we put a price on waiting, and a price on the capacity that shortens it. Third, we build the vocabulary that every model in the rest of the chapter uses. By the end, you will tell a single-channel system from a multi-channel one on sight.

Why Queues Form

Demand Meets Finite Capacity

Waiting lines, queues, arise whenever demand exceeds the system's immediate capacity to provide it. Notice the word immediate. Capacity averaged over a whole day can be perfectly adequate. What matters is capacity at the moment the customer actually shows up. Add a few extra customers on a Friday afternoon, and the arithmetic changes. Or have a single teller call in sick. A smoothly running bank turns into a holding pen within the hour. The same logic governs trucks at loading docks, and packets in a network router. It governs patients in an emergency department, triaged against a finite number of clinicians. None of those look like a line of people. All of them are queues.

Four Domains

Where Queuing Problems Arise

Queues appear in virtually every industry, and four domains cover most practical applications. And here is the useful part. The underlying mathematics is identical across all four. Service industries give us the most visible queues, the ones customers stand in. Bank tellers, checkout lanes, call-center hold queues, restaurant waitlists, emergency departments. Here the unit in the queue is a person, and the cost is felt directly. Dissatisfaction, lost productivity, and ultimately customers who do not come back. On the factory floor, machines and jobs queue too. A part-finished product waits for the next workstation, and a batch waits for inspection. Idle work in process ties up capital and lengthens lead times. In freight and transport, the queuing unit is a vehicle. A container ship costs tens of thousands of dollars per day at anchor. And computing systems are queues all the way down, from routers to cloud schedulers.

The Cost Of Waiting

What a Queue Costs the Business

Every queue carries two kinds of cost, and they pull in opposite directions. There is the cost of making customers wait. And there is the cost of adding capacity to reduce that wait. Take waiting cost first. The business pays for it in several ways. There is the customer's own lost productivity, the time they could have used otherwise. There is dissatisfaction, which erodes brand loyalty slowly and quietly. And most damaging of all, there is defection to a competitor. For business-to-business services, waiting cost is often directly measurable. A truck idling at a dock loses revenue by the hour. Two specific customer behaviours compound all of this. Balking, and reneging. A customer who balks arrives, sees the queue, and decides not to join at all. They are a lost sale the business never even registered. A customer who reneges joins the queue, then leaves before being served, having consumed system time without producing revenue. Both are hard to measure, because the customer is gone before any transaction occurs.

The Trade-Off

Total Cost Is U-Shaped

Now the other side of the ledger. The obvious way to shorten a queue is to add capacity. More tellers, more checkout lanes, more servers, more loading docks. But capacity is expensive, whether or not anyone is using it. Each additional server costs salary, training, equipment, and floor space. And it may sit idle through the slow periods. Capacity that looks essential at peak hour can look wasteful at two in the afternoon, on a Tuesday. So the two costs move in opposite directions. As service capacity rises, waiting cost falls, but capacity cost climbs. Add them together, and the total cost curve is U-shaped. The optimum sits at the bottom of that U. It is the capacity level where one more server saves exactly what it costs. And here is the counter-intuitive part. The goal is not to eliminate the queue. Zero waiting means buying capacity for the worst arrival burst you will ever see. And that is almost always more expensive than the waiting it prevents.

System Structure

The Anatomy of a Queuing System

Every queuing model rests on four structural elements. Naming them is what turns a complaint into a solvable problem. Someone says, the line is too long. That is not a model. Specify the four elements, and it becomes one. Picture the system as a flow, running left to right. Units arrive, independently, at some constant average rate. They wait in the queue, and while they wait, some balk and some renege. They reach one or more parallel servers, and service takes a variable time. Then they exit, freeing that server for whoever is next in line. The four elements are the arrival process, the service process, the discipline, and the number of servers. Get one of them wrong, and every number you compute afterwards is wrong with it.

Arrivals And Service

Poisson In, Exponential Out

The arrival rate, written lambda, measures how often new units enter the system. Customers, jobs, trucks or packets, it makes no difference which. The text's example is twelve customers per hour. In most business settings, arrivals are well described by a Poisson process. That phrase carries three assumptions, and you should say them out loud. Arrivals are independent of one another, and occur at a constant average rate. And the count in any given interval follows a Poisson distribution. The service rate, written mu, measures how fast a single server completes work. The text's example there is fifteen customers per hour. Service times are most commonly modelled as exponentially distributed. That gives the memoryless property, which is worth stating carefully. The chance of finishing in the next minute is the same, however long service has already run.

Queue Discipline

The Rule for Who Gets Served Next

The third element is queue discipline, the rule for choosing who gets served next. Four disciplines cover almost everything you will meet in practice. First come, first served is the standard fair rule. You see it at bank tellers, checkout lanes, and customer support queues. Last come, first served processes the newest item first. That sounds perverse, until you picture a stack of inventory, or a pile of manuscripts. Priority disciplines serve higher-priority customers first. Emergency-department triage works this way, and so do airline boarding groups. Shortest job first runs the quickest service first. Print queues, processor scheduling, and express checkout lanes all use it. Discipline changes neither the work arriving, nor the capacity serving it. It changes who waits, and for how long. That is a fairness decision too.

Number Of Servers

Single-Channel or Multi-Channel

The fourth element is simply how many parallel servers the system has. A single-channel system has one server, and is written M M one. Think of a small shop with one clerk, or a single-lane drive-through. A multi-channel system has s servers, and is written M M s. Think of a bank with five tellers, all feeding from one shared queue. Or a call center with thirty agents. The notation is worth decoding, because you will meet it everywhere. The first M is the arrival distribution. Markovian, meaning Poisson. The second M is the service distribution. Markovian, meaning exponential. And the digit at the end is the number of servers. One design point is worth carrying away from here. A single shared queue usually beats several separate single-server lines, at identical capacity.

Airport Case

Three Queues Inside One Airport

Now put the vocabulary to work inside one building. An airport. Passengers, baggage, planes and ground vehicles all queue there, often at the same time. And they queue under completely different rules. Take the security checkpoint first. Passengers arrive in irregular bursts, approximately Poisson around peak departures. Screening time varies with bag complexity and PreCheck status, so it is roughly exponential. Aircraft on the runway look similar at first, and behave differently. Slot requests are near-Poisson during peak banks, and simply scheduled at other times. Runway occupancy is fairly consistent, sixty to ninety seconds, so it is closer to deterministic. The baggage drop counter is the least Poisson of the three. Passengers arrive one to three hours before the flight, clustered around the schedule. And bag tagging takes one to two minutes. Short, and predictable.

Discipline And Cost

Same Structure, Different Stakes

Discipline and cost driver complete the picture. At security, it is first come first served within a lane. But separate priority lanes exist for PreCheck, Clear, and premium-cabin passengers. The cost driver there is missed flights and passenger dissatisfaction. A long queue forces airline rebooking costs, and damages the airport's reputation. On the runway, air traffic controllers also run first come first served. They overlay departure and arrival priority rules, plus weather-driven overrides. The cost driver is fuel burn and slot fees. Aircraft holding on a taxiway, or in an airborne pattern, cost thousands of dollars per minute. At the baggage counter, it is first come first served by airline. Elite-status and business-class passengers take priority there. The cost driver is the late bag, meaning courier delivery, compensation, and service costs.

Section Summary

See the Queue, Then Price It

Let us collect the vocabulary in one place. Queues form wherever demand exceeds capacity. They appear across services, manufacturing, logistics, and digital systems. Their cost combines customer waiting, balking and reneging included, with the cost of capacity. The optimum minimizes the total of those two, not either one alone. Every queue is described by four elements. Poisson arrivals at rate lambda, and exponential service at rate mu. A discipline, and the number of servers, single channel or multi channel. With that vocabulary, any real problem reduces to the same analysis. So measure arrivals, time services, choose the right discipline. Then decide how much capacity is genuinely worth paying for.

About Quantitative Analysis at UPI Study

Quantitative Analysis (Math 250) is a self-paced online course of 55 video lessons in 13 chapters, from decision analysis and simulation to inventory and queuing models, project scheduling, linear programming and transportation models. It carries a NCCRS credit recommendation for 3 semester credits.

Every lesson transcript is free on pages like this one, and the videos are free with a free UPI Study account. Enrolling adds a practice quiz after each lesson, the graded work and final exam that earn the credit, lifetime access, and an official transcript on completion. UPI Study has helped over 130,000 students with college credits. ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.

Enroll now → Course details Download the syllabus All Math courses Every course with PRO →

Compare: Statistics vs Quantitative Analysis

Why take it here

Why students take Quantitative Analysis with UPI Study

Decide with numbersQuantitative Analysis teaches the models managers use to decide under uncertainty: decision trees, simulation, inventory and queuing models, project scheduling and linear programming. It is part of many business, management, operations and supply-chain programs.
Credit at a fraction of the priceThe same 3 credits can cost $750 or more at a US college. Here it is one payment, self-paced, with lifetime access.
Finish your degree soonerTransfer credits reduce the courses you still owe, so you can graduate earlier or lighten a heavy semester.
Strengthen an applicationA completed college-level course on an official transcript shows admissions and scholarship committees you can do the work.
Study on your own scheduleNo start dates, no deadlines. Watch the lessons, practice, and take the final when you are ready.
130,000+students helped with college creditsACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.

Where the credit goes

Universities that work with NCCRS

Quantitative Analysis carries a NCCRS credit recommendation. These universities work with NCCRS; some are UPI Study's signed partners. ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.

Thomas Edison State UniversityThomas Edison State UniversitySigned partnerUniversity of the PeopleUniversity of the PeopleSigned partnerCharter Oak State CollegeCharter Oak State CollegeSigned partnerStrayer UniversityStrayer UniversitySigned partnerColumbia Southern UniversityColumbia Southern UniversitySigned partnerIndiana TechIndiana TechSigned partnerPenn StatePenn StateWorks with NCCRSSouthern New Hampshire UniversitySouthern New Hampshire UniversityWorks with NCCRSSUNYSUNYWorks with NCCRS +many more cooperating universitiesFind my college →

Find my college → Not listed? Ask Athena in the corner of this page, or book a 15-minute call.

FAQ

Questions students ask us

About Nobody Likes to Wait

What is the difference between balking and reneging in a queue?
A customer who balks arrives, sees the line, and decides not to join at all. A customer who reneges joins the line but leaves before being served, after using up system time without producing revenue. Both are costly because they mean lost sales, and both are hard to measure, since the customer is gone before any transaction is recorded.
Why is eliminating waiting lines entirely usually not the goal?
Waiting cost falls as service capacity rises, but capacity cost climbs, so total cost forms a U-shaped curve. The best capacity sits at the bottom of that U, where one more server saves about what it costs. Eliminating waits completely would mean buying enough capacity for the worst burst of arrivals, which is almost always more expensive than the waiting it prevents.
What are the four elements of a queuing system?
A queuing system is described by its arrival process, its service process, its queue discipline and its number of servers. Arrivals are often modeled as a Poisson process at rate \lambda, and service times as exponential at rate \mu. The discipline decides who is served next, such as first come, first served, priority or shortest job first, and the server count makes it single-channel or multi-channel.
What do M/M/1 and M/M/s mean in queuing notation?
In this notation, the first M means Markovian, or Poisson, arrivals, the second M means exponentially distributed service times, and the last symbol is the number of parallel servers. M/M/1 is a single-channel system, like a shop with one clerk. M/M/s has s servers sharing one queue, like a bank with five tellers. At equal capacity, one shared queue usually performs better than separate lines.

About the Quantitative Analysis course

How many college credits is Quantitative Analysis?
Quantitative Analysis (Math 250) carries a NCCRS credit recommendation for 3 semester credits. ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.
How much does Quantitative Analysis cost and what is included?
$250, paid once, with lifetime access: all 55 video lessons, a practice quiz after each, the graded work and final exam, and an official transcript when you finish. Students who want several courses choose UPI Study PRO instead.
Which universities accept UPI Study credits?
UPI Study has signed partner agreements with universities such as Thomas Edison State University, University of the People and Charter Oak State College, and works with universities such as Penn State, SNHU and SUNY. ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities. Use "Find my college" on this page to check yours.
How long does Quantitative Analysis take?
It is self-paced with no deadlines. The 55 lessons total about 11 hours of video; most students add reading and practice time and finish in a few weeks to a few months, on their own schedule.
How are the exams done?
Quizzes and assignments are online in the course. The final exam is taken online with proctoring; a person on the UPI Study team checks assignments, usually within two days.
How do my credits reach my college?
When the course shows 100% complete, request the official transcript from your dashboard. It is sent to the college you name, and you can send it to more than one. Check your college first with "Find my college" on this page, or ask Athena.

Ready for the full course? Earn 3 credits in Quantitative Analysis.

55 video lessons, a quiz after each one, and the graded work that earns the credit. Recommended for credit by NCCRS.

Enroll in Quantitative Analysis →Download the syllabusEvery course with PRO →
Quantitative Analysis
3 credits · NCCRSEnroll →