The entire Logistics Management 344 module summarized in 11 pages. Queuing Theory, Simulation, Chi^2 Test & Linear Programming are all covered with the required information to pass the module comfortably. Excel templates are also provided for each of the above topics. Good luck!
Logistics Management 344
Queuing Theory, Simulation, Chi^2 Test & Linear
Programming
1. Queuing Theory
Key terms:
Wq Time in the queue (e.g. time waiting to be serviced)
Ws Time in service (e.g. time spent at the counter/washbay)
W Time in the system (e.g. time spent in the premises)
Lq Number of vehicles in the queue (e.g. number of vehicles waiting to be
served)
Ls Number of vehicles in the service (e.g. number of vehicles at the washbay)
L Number of vehicles in the system (e.g. number of vehicles in the premises)
p Utilization factor
P0 Probability is ‘idle’
Kendall-Lee notation:
a Nature of the interarrival times
b Nature of the service times
c Number of service points
d Queuing rules
e Number of customers allowable in the system
f Number of customers in the calling population
GD=FIFO
Base assumptions for a M/M/1/GD/∞/∞ queuing model:
1. Queuing rules follow FIFO – first in first out
2. No balking or reneging
, 3. Interarrival times are mutually independent & follow the exponential
distribution with lambda being known
4. Service times are mutually independent & follow the exponential
distribution with mu being known
5. Calling population in infinitely large & there is no space constraint
6. Lambda < mu
Base assumptions for a M/M/3/GD/∞/∞ queuing model:
1. Queuing rules follow FIFO – first in first out
2. No balking or reneging
3. Interarrival times are mutually independent & follow the exponential
distribution with lambda being known
4. Service times are mutually independent & follow the exponential
distribution with mu being known
5. Calling population in infinitely large & there is no space constraint
6. Lambda < mu
Base assumptions for a M/M/1/GD/9/9 queuing model:
1. Queuing rules follow FIFO – first in first out
2. No balking or reneging
3. Service times are mutually independent & follow the exponential
distribution with mu being known
4. The calling population in finite
5. Arrival times follow the poisson distribution
, Calculations/formulas:
*NB do all calculations using below formulas on excel to determine values!
*Determine probability that ‘1’ or more of the scanners are busy P = ’1’ – P0
*Average number of ships being serviced at any time = L – Lq
M/M/1/GD/∞/∞
M/M/3/GD/∞/∞
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through EFT, credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying this summary from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller 18251536. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy this summary for R120,00. You're not tied to anything after your purchase.
