Scribd Logo
Upload

Welcome to Scribd!

  • 120 views

    AE4-Activity 9 - Problem On Queuing Theory

    Uploaded by

    Lyka mae Labadan
    The document discusses two queuing theory problems: 1) a single clerk system with an average arrival of 2 customers per hour and service rate of 30 customers per hour. It asks to calculate average customers in system, waiting, and times spent in system and queue as well as system busy percentage. 2) A multi-server bank system with 3 loan officers serving 4 customers per hour on average and 10 average arrivals per hour, asking to calculate probability of empty system, average customers in system and queue, and average times in system and queue as well as probability all servers busy.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    AE4-Activity 9 - Problem On Queuing Theory

    Uploaded by

    Lyka mae Labadan
    120 views1 page
    The document discusses two queuing theory problems: 1) a single clerk system with an average arrival of 2 customers per hour and service rate of 30 customers per hour. It asks to calculate average customers in system, waiting, and times spent in system and queue as well as system busy percentage. 2) A multi-server bank system with 3 loan officers serving 4 customers per hour on average and 10 average arrivals per hour, asking to calculate probability of empty system, average customers in system and queue, and average times in system and queue as well as probability all servers busy.

    Original Description:

    Original Title

    AE4-Activity 9 - Problem on Queuing Theory (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses two queuing theory problems: 1) a single clerk system with an average arrival of 2 customers per hour and service rate of 30 customers per hour. It asks to calculate average customers in system, waiting, and times spent in system and queue as well as system busy percentage. 2) A multi-server bank system with 3 loan officers serving 4 customers per hour on average and 10 average arrivals per hour, asking to calculate probability of empty system, average customers in system and queue, and average times in system and queue as well as probability all servers busy.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    120 views1 page

    AE4-Activity 9 - Problem On Queuing Theory

    Uploaded by

    Lyka mae Labadan
    The document discusses two queuing theory problems: 1) a single clerk system with an average arrival of 2 customers per hour and service rate of 30 customers per hour. It asks to calculate average customers in system, waiting, and times spent in system and queue as well as system busy percentage. 2) A multi-server bank system with 3 loan officers serving 4 customers per hour on average and 10 average arrivals per hour, asking to calculate probability of empty system, average customers in system and queue, and average times in system and queue as well as probability all servers busy.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    Problem on Queuing Theory

    I. Single-channel/Single Phase System


    A clerk can serve thirty (30) customers per hour on the average. Twenty (2) customers
    arrive each hour on average. Compute:
    1. The average number of customers in the system (Ls)
    2. The average number of just waiting in line (Lq)
    3. The average customer time spent in the system (Ws)
    4. The average customer time spent in the queue (Wq)
    5. The percentage of time the system is busy.

    II. Multi-channel/Single-Phase System


    A bank has three (3) loan officers on duty, each of whom can serve four (4) customers
    per hour. Every hour, ten (10) loan applicants arrive at the loan department and join a
    common queue. What are the system’s operating characteristics?
    1. The probability of zero (0) customer in the system (P0)
    2. Average number of customers in the system (Ls)
    3. Average number of customers in the queue (Lq)
    4. Average waiting time of each customer in the system (Ws)
    5. Average waiting time of each customer in the queue (Wq)
    6. The probability that all the system servers are currently busy (P w)

    You might also like