Consider a two-station production line in which no inventory is allowed between stations (i. e., the stations are tightly coupled). Station 1 consists of a single machine that has potential daily production of one, two, three, four, five, or six units, each outcome being equally likely (i. e., potential production is determined by the roll of a single die). Station 2 consists of a single machine that has a potentialdaily production of eitther three or four units both which are equally likely (i. e. it produces three units if a fair coin comes up heads and four units if ir comes up tails). Required:
a. Compute the capacity of each station (units per day). Is the line balanced (do both stations have the same capacity)?
b. Compute the expected throughput of the line. Does this diifer from a.?
c. Suppose a second identical machine is added to station 1 and station 2. What is the expected throughput of the line. How does this compare to previous throughput.

a) Capacities : station 1 = 3.5 , station 2 = 3.5

  Both stations have the same capacity

b) 3.5 ( it does not differ from a )

c) The value will double i.e. 3.5 * 2 = 7

Step-by-step explanation:

a) compute the capacity of each station and show if the line is balanced

for station 1

Units :            1 ,2 ,3, 4 ,5, 6

probabilities :   1/6 ( same value for all units )

for station 2

units :             3, 4

probabilities :  1/2   1/2

Capacity of station 1= ( 1/6 * 1 ) + ( 1/6 *2 ) + ( 1/6 *3) + (1/6 *4) + (1/6*5) + (1/6*6 )

                                =  3.5  

Capacity of station 2 = ( 1/2 * 3 ) + ( 1/2 * 4 )

                                  = 3.5

∴ both stations have the same capacity

B) Expected throughput of the line

= Min( capacity of station 1 , capacity of station 2 )

= 3.5  ( It does not differ from a )

C) When an additional identical machine is added to both stations the expected throughput of the line will be doubled

i.e. expected throughput = ( 3.5 ) * 2 = 7

equal to

step-by-step explanation:

answer: it's upside down and i can't read it

step-by-step explanation: