Chapter 12 Waiting Lines and Queuing Theory Models

Learning Objectives

After completing this chapter, students will be able to:

  1. 12.1 Describe the trade-off curves for cost-of-waiting time and cost of service.

  2. 12.2 Describe the basic queuing system configurations and the three parts of a queuing system: the calling population, the queue itself, and the service facility.

  3. 12.3 Analyze a variety of operating characteristics of waiting lines for single channel models with exponential service times and infinite calling populations.

  4. 12.4 Analyze a variety of operating characteristics of waiting lines for multi-channel models with exponential service times and infinite calling populations.

  5. 12.5 Analyze a variety of operating characteristics of waiting lines for single channel models with deterministic service times and infinite calling populations.

  6. 12.6 Analyze a variety of operating characteristics of waiting lines for single channel models with exponential service times and finite calling populations.

  7. 12.7 Understand Little’s Flow Equations.

  8. 12.8 Understand the need for simulation for more complex waiting line models.

The study of waiting lines, called queuing theory, is one of the oldest and most widely used quantitative analysis techniques. Waiting lines are an everyday occurrence, affecting people shopping for groceries, buying gasoline, making a bank deposit, or waiting on the telephone for the first available customer service agent to answer. Queues,1 another term for waiting lines, may also take the form of machines waiting to be repaired, trucks in line to be unloaded, or airplanes lined up on a runway waiting for permission to take off. The three basic components of a queuing process are arrivals, service facilities, and the actual waiting line.

In this chapter, we discuss how analytical models of waiting lines can help managers evaluate the cost and effectiveness of service systems. We begin with a look at waiting line costs and then describe the characteristics of waiting lines and the underlying mathematical assumptions used to develop queuing models. We also provide the equations needed to compute the operating characteristics of a service system and show examples of how they are used. Later in the chapter, you will see how to save computational time by applying queuing tables and by running waiting-line computer programs.

..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset