A manufacturing system consists of 3 machines. Parts arriv the shops where they will be processed, each part will be tm the need of a resource) and the move time takes UNIF(2. 31

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Choose the correct options
A manufacturing system consists of 3 machines. Parts arrive following EXPO(4) distribution. Upon arrival, the parts will be send to
the shops where they will be processed, each part will be transported individually (assume the parts move by themselves without
the need of a resource) and the move time takes UNIF(2, 3) minutes. Once the parts arrive at the shop station the parts are
distributed among the machines by selecting the machine with the shortest queue, if there are ties, then the tie breaker is the
machine index (Machine 1 is prioritized over machine 2, and 3, and machine 2 is prioritized over machine 3). There is no maximum
buffer capacity to be considered. Processing time for each machine is constant and is equal to 8 minutes. All three machines have
failure modes; the machines have up times and down time as following: Machine 1 Up Time expo(120) min, Down Time UNIF(5,10)
min, Machine 2 up time EXPO(100) min and down time UNIF(5,15) + TRIA(1,2,3) while for machine 3 up time EXPO(50) and down
time UNIF(8,10). Do 20 replications of 200 hours and select the correct answers only:
Source of the variability in this model is from the arrival process
The maximum number waiting for each machine is less than 10.
Machine 1 has the highest utilization of about 89%
The average WIP is less than 10 parts.
Machine 2 is failed about 11% of the time.
Machine 3 is Idle 32% of the time
Transcribed Image Text:A manufacturing system consists of 3 machines. Parts arrive following EXPO(4) distribution. Upon arrival, the parts will be send to the shops where they will be processed, each part will be transported individually (assume the parts move by themselves without the need of a resource) and the move time takes UNIF(2, 3) minutes. Once the parts arrive at the shop station the parts are distributed among the machines by selecting the machine with the shortest queue, if there are ties, then the tie breaker is the machine index (Machine 1 is prioritized over machine 2, and 3, and machine 2 is prioritized over machine 3). There is no maximum buffer capacity to be considered. Processing time for each machine is constant and is equal to 8 minutes. All three machines have failure modes; the machines have up times and down time as following: Machine 1 Up Time expo(120) min, Down Time UNIF(5,10) min, Machine 2 up time EXPO(100) min and down time UNIF(5,15) + TRIA(1,2,3) while for machine 3 up time EXPO(50) and down time UNIF(8,10). Do 20 replications of 200 hours and select the correct answers only: Source of the variability in this model is from the arrival process The maximum number waiting for each machine is less than 10. Machine 1 has the highest utilization of about 89% The average WIP is less than 10 parts. Machine 2 is failed about 11% of the time. Machine 3 is Idle 32% of the time
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY