Scribd Logo
Upload

Welcome to Scribd!

  • 373 views

    CHP 7 Waiting Line Model

    Uploaded by

    Firdaus Lasnang
    This document discusses waiting line analysis and queuing theory. It describes key concepts like arrival rates, service rates, single-server and multiple-channel models. It also provides examples to demonstrate how to calculate operating characteristics for queuing systems like average wait times, number of customers in line, and server utilization probability.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    CHP 7 Waiting Line Model

    Uploaded by

    Firdaus Lasnang
    373 views15 pages
    This document discusses waiting line analysis and queuing theory. It describes key concepts like arrival rates, service rates, single-server and multiple-channel models. It also provides examples to demonstrate how to calculate operating characteristics for queuing systems like average wait times, number of customers in line, and server utilization probability.

    Original Description:

    hhhhh

    Original Title

    7. Chp 7 Waiting Line Model

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses waiting line analysis and queuing theory. It describes key concepts like arrival rates, service rates, single-server and multiple-channel models. It also provides examples to demonstrate how to calculate operating characteristics for queuing systems like average wait times, number of customers in line, and server utilization probability.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    373 views15 pages

    CHP 7 Waiting Line Model

    Uploaded by

    Firdaus Lasnang
    This document discusses waiting line analysis and queuing theory. It describes key concepts like arrival rates, service rates, single-server and multiple-channel models. It also provides examples to demonstrate how to calculate operating characteristics for queuing systems like average wait times, number of customers in line, and server utilization probability.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 15

    BJQP 2023

    MANAGEMENT
    SCIENCE
    o Significant amount of time spent in waiting lines
    by people, products, etc.
    o Providing quick service is an important aspect of
    quality customer service.
    o The basis of waiting line analysis is the trade-off
    between the cost of improving service and the
    costs associated with making customers wait.
    o Queuing analysis is a probabilistic form of
    analysis.
    o The results are referred to as operating
    characteristics.
    o Results are used by managers of queuing
    operations to make decisions.
    Overview
    o Waiting lines form because people or things arrive at a service faster
    than they can be served.
    o Most operations have sufficient server capacity to handle customers
    in the long run.
    o Customers however, do not arrive at a constant rate nor are they
    served in an equal amount of time.
    o Waiting lines are continually increasing and decreasing in length.and
    approach an average rate of customer arrivals and an average
    service time, in the long run.
    o Decisions concerning the management of waiting lines are based on
    these averages for customer arrivals and service times.
    o They are used in formulas to compute operating characteristics of
    the system which in turn form the basis of decision making.
    Elements of Waiting Line Analysis
    Waiting lines are commonly found in a wide range of
    production and service systems that encounter variable
    arrival rates and service times.
    First come, first served (FCFS)
    Priority Classification
    o Components of a waiting line system include
    arrivals (customers), servers, (cash
    register/operator), customers in line form a waiting
    line.
    o Customers may also: balking, reneging and
    jockeying
    o Factors to consider in analysis:
    o The queue discipline.
    o The nature of the calling population
    o The arrival rate
    o The service rate.
    The Single-Server Waiting Line System
    o Assumptions of the basic single-server model:
    o An infinite calling population
    o A first-come, first-served queue discipline
    o Poisson arrival rate
    o Exponential service times
    o Symbols:
    o = the arrival rate (average number of
    arrivals/time period)
    o = the service rate (average number
    served/time period)
    o Customers must be served faster than they arrive (
    < ) or an infinitely large queue will build up.
    Single-Server Waiting Line System
    Single-Server Model
    Lq = the average number waiting for service
    L = the average number in the system (i.e.,
    waiting for service or being served)
    P
    0
    = the probability of zero units in the system
    = the system utilization (percentage of time
    servers are busy serving customers)
    W
    q =
    the average time customers must wait for
    service
    W = the average time customers spend in the
    system (i.e., waiting for service and service
    time)
    A customer service counter is a single-server system. If the
    arrival rate is 24 customers per hour arrive at checkout
    counter and 30 customers per hour can be checked out,
    compute:
    a) Probability that no customers are in the waiting line
    system
    b) Average number in the waiting line system
    c) Average number in the waiting line
    d) Average time a customer spends in the total queuing
    system
    e) Average time a customer spends waiting in the queue to
    be served
    f) Probability that the server is busy
    g) Probability that the server is idle
    The multiple-channel model is appropriate when
    these conditions exist:
    1. A Poisson arrival rate.
    2. A negative exponential service time.
    3. First-Come, first-served processing order.
    1. More than one server.
    1. An infinite calling population.
    2. No upper limit on queue length.
    3. The same mean service rate for all servers.

    The Student Travel Agency opened 2 counters
    at DKG 1 to help students purchase bus tickets.
    Students arrive at the rate of 4 per hour
    according to a Poisson distribution and each
    counter spends an average 12 minutes for the
    transaction.

    Determine the operating charateristics (P
    0
    , L,
    L
    q
    , W, W
    q
    and P
    w
    ) for this system.

    You might also like