文档介绍：Session 16 运筹学Operations Research 16-1
运筹学运筹学
Operations Research Operations Research 16 The Application of Queuing Theory
16 The Application of Queuing Theory
This chapter discusses the application of queuing theory
Queuing theory has enjoyed a prominent place among the
in the broader context of an overall OR study. It begins by
modern analytical techniques of OR. However, the emphasis
introducing three examples that will be used for illustration
thus far has been on developing a descriptive mathematical
theory. Thus queuing theory is not directly concerned with throughout the chapter. Section discusses the basic
achieving the goal of OR: optimal decision making. Rather, it
considerations for decision making in this context. The
develops information on the behavior of queuing systems. This
following two sections then develop decision models for the
theory provides part of the information needed to conduct an
OR study attempting to find the best design for a queuing system. optimal design of queuing systems.
江西财经大学信息管理学院©2006 江西财经大学信息管理学院©2006
School of Information Technology, JiangXi University of Finance & Economics©2006 1 School of Information Technology, JiangXi University of Finance & Economics©2006 2
运筹学运筹学
Operations Research 16 The Application of Queuing Theory Operations Research Examples
Examples
The time until any given operating machine breaks down
Example 1—How Many Repairers?
Simulation, Inc., a pany that makes widgets has an exponential distribution, with a mean of 2 days. Until
for puters, has 10 widget-making machines. now pany has had just one repairer to fix these
However, because these machines break down and require
repair frequently, pany has only enough operators machines, which has frequently resulted in reduced
to operate eight machines at a time, so two machines are productivity because fewer than eight machines are operating.
available on a standby b