Scribd
Upload
67 views

4-1 Introduction To Queuing Theory - Week 4 - Queueing Theory - Manufacturing Systems I - Edx

Uploaded by

Galacaesar Khambali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
67 views

4-1 Introduction To Queuing Theory - Week 4 - Queueing Theory - Manufacturing Systems I - Edx

Uploaded by

Galacaesar Khambali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

MITx 2.854.

1x Help gakhambali
Manufacturing Systems I
Course Progress Dates Discussion Handout

Audit Access Expires Jul 21, 2021

You lose all access to this course, including your progress, on Jul 21, 2021.

Upgrade by Jun 23, 2021 to get unlimited access to the course as long as it exists on the site. Upgrade now

Course / Week 4: Queueing Theory / Introduction to Queuing Theory


Previous Next
Concept Check 1
Bookmark this page
Question 1
1 point possible (ungraded)
Queuing theory (Check all that apply):
Is a mathematical theory often used to predict what resources are needed to provide a service.
Is used in many contexts, such as calls waiting at call centers, data packets in computer networks, traffic at an
intersection, and telecommunication.
Describes the energy loss in resonant cavities.
Can be used to evaluate performance measures such as factory capacity utilization and storage.

Submit You have used 0 of 3 attempts

Question 2
1 point possible (ungraded)
M/M/1 Queues (check all that apply):
Are systems that have M number of servers.
Are systems that have have one server.
Are systems where arrivals are determined by a Poisson process.
Are systems where arrival times are exponentially distributed.
Are systems that have average arrival rate, .
Are systems that have a time-varying service rate, .
Are systems where job service times are exponentially distributed.
Are systems whose processes are Markovian.

Submit You have used 0 of 5 attempts

Question 3
0.0/1.0 point (ungraded)
Which of the following is most likely to happen if in a system with an infinite queue? ( is the utilization of the
system.)
The line will go to 0
The line will grow to infinity
The wait time will go to 0.
Submit You have used 0 of 2 attempts

Discussion Hide Discussion


Topic: Week 4
/ Concept Check 1
Add a Post
Show all posts by recent activity
There are no posts in this topic yet.

Previous Next

All Rights Reserved

Learn About Verified Certificates

edX
About
Affiliates
edX for Business
Open edX
Careers
News
Legal
Terms of Service & Honor Code
Privacy Policy
Accessibility Policy
Trademark Policy
Sitemap
Connect
Blog
Contact Us
Help Center
Media Kit
Donate
© 2021 edX Inc. All rights reserved.

深圳市恒宇博科技有限公司 粤ICP备17044299号-2

You might also like