Operator-Machine Assignment Problem: Dr. Stafford's MSC 600 Spring 2005 Assignment 01, Assignments of Production and Operations Management

The solution to dr. Stafford's operator-machine assignment problem for his msc 600 course in spring 2005. The problem involves calculating the optimal number of machines and the corresponding costs for a given number of operators and machines. The computations for part i (one operator to one machine) and part ii (one operator to multiple machines), as well as sensitivity analysis.

Typology: Assignments

Pre 2010

Uploaded on 07/23/2009

koofers-user-b69
koofers-user-b69 🇺🇸

10 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Assignment 01 Operator-Machine Assignment Problem Dr. Stafford MSC 600 Spring 2005 Page 2
KEY: Operator-Machine Assignment Problem Assignment
MSC 600 Dr. Stafford Spring 2005
Question 1 Version A
Answer Item Computations for Answer
Part I 1 operator to 1 machine
C = R + S = 13 + 3 = 16 Minutes Q = 60KU/C = (60)(1)(3)/16 = 11.25 unit/hr
Z = L + KP = 14 + (1)(37) = $51 per hr
$4.533 1 T(K) = Z/Q = $51/11.25 = $4.533 per unit
48.75 2 Since K = 1, W = R = 13 min/cycle = 13(60/16) = 48.75 min/hr
90 3 Output/shift = (8 hr/shift) x (11.25 unit/hr) = 90 unit/shift
04
Since W > 0, M = 0 min/cycle
16 min 5 See computation above
Part II 1 operator to K machines R/S + 1 = 13/3 + 1 = 5.333
Thus K = 5 and K’ = 6
56
T(5) = [(R+S)/(60U)][(L/K) + P] = [16/{60(3)}][(14/5) + 37] = (.08888)(39.8) = $3.537
T(6) = [(K’S)/(60U)][(L/K’) + P] = [{(6)(3)}/{60(3)}][(14/6) + 37] = $3.933
Hence optimal number of machines is 5
$3.537 7 See item 6 above
16 min 8 C = R + S = 16 min
1 min 9 W = MAX{[R - (K-1)S];0} = Max{[13 - (4)(3)]; 0} = Max{1; 0} = 1 min per cycle
010
Since W > 0, M = 0 min/cycle, /hr, and /shift because WM = 0
2 Min 11 For K = 6, M = MAX{[(K-1)S - R]; 0} = Max{[(5)(3) - 13]; 0} = 2 min per cycle per machine
C = KS = (6)(3) = 18 min, and M/hr = (2)(60/18) = 6.67 min/hr per machine
26.25 min 12 W = MAX{[R - (K-1)S]; 0} = MAX{[13 - (2)(3)]; 0} = 7 min per cycle; and for K = 3, C = R+S = 16
min; so W per hr = (7)(60/16) = 26.25 min per hr
21 min 13 For K = 7, C = KS = (7)(3) = 21 min because (K-1)S = 6(3) = 16 > R = 13 min
Sensitivity Analysis
T[5] < T[6] T[5] < T[6]
[(R+S)/(60U)][L/K +P] < [(K’S/60U][L/K’ + P] [(R+S)/(60U)][L/K +P] < [(K’S/60U][L/K’ + P]
60U’s cancel 60U’s cancel
16[L/5 + 37] < 18[L/6 + 37] 16[14/5 +P] < 18[14/6 +P]
3.2L - 3L < 18(37) - 16(37) 16(14/5) - 18(14/6) < 18P - 16P
0.2L < 74, or (3.2 - 3)(14) < 2P
0 < L < $370 2P > 2.8, or 1.40 < P < infinity
pf3
pf4

Partial preview of the text

Download Operator-Machine Assignment Problem: Dr. Stafford's MSC 600 Spring 2005 Assignment 01 and more Assignments Production and Operations Management in PDF only on Docsity!

KEY: Operator-Machine Assignment Problem Assignment

MSC 600 Dr. Stafford Spring 2005

Question 1 Version A

Answer Item Computations for Answer Part I 1 operator to 1 machine C = R + S = 13 + 3 = 16 Minutes

Q = 60KU/C = (60)(1)(3)/16 = 11.25 unit/hr Z = L + KP = 14 + (1)(37) = $51 per hr $4.533 (^1) T(K) = Z/Q = $51/11.25 = $4.533 per unit 48.75 2 Since K = 1, W = R = 13 min/cycle = 13(60/16) = 48.75 min/hr (^90 3) Output/shift = (8 hr/shift) x (11.25 unit/hr) = 90 unit/shift 0 4 Since W > 0, M = 0 min/cycle 16 min 5 See computation above Part II 1 operator to K machines R/S + 1 = 13/3 + 1 = 5. Thus K = 5 and K’ = 6 5 6 T(5) = [(R+S)/(60U)][(L/K) + P] = [16/{60(3)}][(14/5) + 37] = (.08888)(39.8) = $3. T(6) = [(K’S)/(60U)][(L/K’) + P] = [{(6)(3)}/{60(3)}][(14/6) + 37] = $3. Hence optimal number of machines is 5 $3.537 7 See item 6 above 16 min 8 C = R + S = 16 min 1 min 9 W = MAX{[R - (K-1)S];0} = Max{[13 - (4)(3)]; 0} = Max{1; 0} = 1 min per cycle 0 10 Since W > 0, M = 0 min/cycle , /hr, and /shift because WM = 0 2 Min (^11) For K = 6, M = MAX{[(K-1)S - R]; 0} = Max{[(5)(3) - 13]; 0} = 2 min per cycle per machine C = KS = (6)(3) = 18 min, and M/hr = (2)(60/18) = 6.67 min/hr per machine 26.25 min 12 W = MAX{[R - (K-1)S]; 0} = MAX{[13 - (2)(3)]; 0} = 7 min per cycle; and for K = 3, C = R+S = 16 min; so W per hr = (7)(60/16) = 26.25 min per hr 21 min 13 For K = 7, C = KS = (7)(3) = 21 min because (K-1)S = 6(3) = 16 > R = 13 min

Sensitivity Analysis

T[5] < T[6] T[5] < T[6]

[(R+S)/(60U)][L/K +P] < [(K’S/60U][L/K’ + P] [(R+S)/(60U)][L/K +P] < [(K’S/60U][L/K’ + P]

60U’s cancel 60U’s cancel

16[L/5 + 37] < 18[L/6 + 37] 16[14/5 +P] < 18[14/6 +P]

3.2L - 3L < 18(37) - 16(37) 16(14/5) - 18(14/6) < 18P - 16P

0.2L < 74, or (3.2 - 3)(14) < 2P

0 < L < $370 2P > 2.8, or 1.40 < P < infinity

Question 1 Version B

Answer Item Computations for Answer Part I 1 operator to 1 machine C = R + S = 19 + 5 = 24 Minutes

Q = 60KU/C = (60)(1)(2)/24 = 5 unit/hr Z = L + KP = 30 + (1)(25) = $55 per hr $11.00 1 T(K) = Z/Q = $55/5 = $11.00 per unit 47.5 2 Since K = 1, W = R = 19 min/cycle = 19(60/24) = 47.5 min/hr (^40 3) Output/shift = (8 hr/shift) x (5 unit/hr) = 40 unit/shift 0 4 Since W > 0, M = 0 min/cycle 24 min 5 See computation above Part II 1 operator to K machines R/S + 1 = 19/5 + 1 = 4. Thus K = 4 and K’ = 5 5 6 T(4) = [(R+S)/(60U)][(L/K) + P] = [24/{60(2)}][(30/4) + 25] = (.2)(32.5) = $6. T(5) = [(K’S)/(60U)][(L/K’) + P] = [{(5)(5)}/{60(2)}][(30/5) + 25] = .20833)(31) = $6. Hence optimal number of machines is 5 $6.46 7 See item 6 above 25 min 8 C = K’S = (5)(5) = 25 min 0 min 9 W = MAX{[R - (K-1)S];0} = Max{[19 - (5)(5)]; 0} = Max{-6; 0} = 0 min per cycle 2.4 m/hr 10 M=MAX{[(K-1)S-R];0} = MAX{[(4)(5)-19];0} = MAX{1,0} = 1 min/cycle x (60/25) = 2.4 min/hr 6 Min 11 For K = 6, M = MAX{[(K-1)S - R]; 0} = Max{[(5)(5) - 19]; 0} = 6 min per cycle per machine C = KS = (6)(5) = 30 min, and M/hr = (6)(60/30) = 12 min/hr per machine 22.5 min (^12) W = MAX{[R - (K-1)S]; 0} = MAX{[19 - (2)(5)]; 0} = 9 min per cycle; and for K = 3, C = R+S = 24 min; so W per hr = (9)(60/24) = 22.5 min per hr 35 min 13 For K = 7, C = KS = (7)(5) = 35 min because (K-1)S = 6(5) = 30 > R = 19 min

Sensitivity Analysis

T[5] < T[4] T[5] < T[4]

[(K’S/60U][L/K’ + P] < [(R+S)/(60U)][L/K +P] [(K’S/60U][L/K’ + P] < [(R+S)/(60U)][L/K +P]

60U’s cancel 60U’s cancel

25[L/5 + 25] < 24[L/4 + 25] 25[30/5 + P] < 24[30/4 + P]

5L + 625 < 6L + 600 150 + 25P < 180 + 24P

25 < L, or P < 30, or

25 < L < infinity 0 < P < 30