1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Queueing theory problem

  1. Oct 24, 2017 #1
    1. The problem statement, all variables and given/known data
    Anyone know anything about queueing theory? would really appreciate some help.
    the question goes as follows:
    The annual S&C Christmas sale is so popular that it is necessary to limit the number of customers who can be inside the store simultaneously; this limit is set at 60 people, with other customers having to queue on the street outside until somebody leaves the store. It is projected that when the store opens at 9am, there will already be 100 customers wanting to enter immediately, with further customers arriving thereafter as a Poisson process at rate 150 per hour until noon, and 50 per hour after that. Once a customer does get inside, the time they spend there is thought to be exponentially distributed with mean 30 minutes.
    (a) Describe this queueing system in Kendall notation.

    2. Relevant equations

    not really any relevant equations I don't think, not even a precalc question but i didnt know where to post it


    3. The attempt at a solution
    From the question I can see that λ=150 customers / hour initially after the people waiting get in and λ=50 customers / hour after noon. also μ = 1/0.5 = 2 customers / hour / server
    and i can see that the queue is an M/M/something queue C being the number of servers but im not sure how to work that out.
    by the way λ and μ are arrival rate and service rate respectively.

     
  2. jcsd
  3. Oct 24, 2017 #2

    StoneTemplePython

    User Avatar
    Gold Member

    All inter-arrival periods are exponential, on both the in-processing and out processing -- the one exception to this is the discontiunities -- i.e. when the store starts up and again at noon but setting those aside, they are memoryless. So M/M seems about right.

    - - - -
    What does this tell you with respect to servers / processing capacity?

     
  4. Oct 24, 2017 #3
    Is that limit of 60 people including the servers? I cant see how I could derive how many servers there are from the information given unless i just guess and say 60 people in the store / 2 customers served per hour = 30 servers ?
     
  5. Oct 24, 2017 #4
    or just 60 customers + however many servers since the question says "limit the number of customers"?
     
  6. Oct 24, 2017 #5

    Ray Vickson

    User Avatar
    Science Advisor
    Homework Helper

    You said that "once a customer gets into the store, the time they spend there is expl(30 min). That is, the "service time" of a customer does not depend in any way on the number of other customers in the store. It is as though there are enough servers to serve however many customers are inside the store --- a 60-server queue (or, alternatively, a self-service system in which each customer serves itself).

    So, it looks to me like an M/M/60 queue with no "capacity" restrictions. Up to a total customer content of 60 there is no queue---everybody is in service. For more than 60 customers, a "queue" begins; these are the customers lined up on the sidewalk outside the store. (If you did have a finite capacity restriction, that would not be the "60"; rather, it would be a restriction on the number of people that could line up outside the store.)
     
  7. Oct 24, 2017 #6
    Right so it is an M/M/60 queue. But just so I understand, I know once a customer gets into the store, the time they spend there is expl(30 min) which is 1/half an hour or 1/0.5 = 2 customers per minute = μ. but you said "that is, the "service time" of a customer does not depend in any way on the number of other customers in the store." Which I can see why that is, because why would the service differ depending on the amount of customers right? so does the fact that its exponentially distributed infer that ? or is that just the case all the time? Im still confused though how you can get from the fact that the service time doesn't depend on the amount of customers in the store to the fact that there are 60 servers? couldn't there be 30 servers or 50 or any number between 1 and 60?
     
  8. Oct 24, 2017 #7

    StoneTemplePython

    User Avatar
    Gold Member

    the fact that when customers are in queue -- they are treated as iid, which implies that.

    the problem states 60 customers in a store at once, max. That is your capacity.
    - - -
    edit: I'm a bit concerned I overloaded the word "capacity" here. The problem is set up so that customers (aka packets) get "serviced" when in the store. Once in the store, each servicing is iid (with the exponential distribution). The store never tells people to 'wait' unless it is full. The store gets full at 60 people. This is equivalent to saying there are 60 servers running. If the store told people to wait outside when only 50 customers were inside, then the number of servers would be 50.

    you may want to look at example 2.3.1 on page 17, and example 2.4.1 on page 19 of here:

    https://ocw.mit.edu/courses/electri...ring-2011/course-notes/MIT6_262S11_chap02.pdf

    - - - -
    In the real world, of course, the more customers in the store, the longer you may spend waiting in line at the checkout counter, for instance.
     
    Last edited: Oct 24, 2017
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: Queueing theory problem
  1. Number theory problem (Replies: 9)

  2. Set Theory Problem (Replies: 3)

  3. Number theory problem (Replies: 11)

Loading...