hw2 solutions

Post on 24-Dec-2015

292 Views

Category:

Documents

0 Downloads

Preview:

Click to see full reader

DESCRIPTION

hw2 solutions

TRANSCRIPT

University of Toronto Department of Mechanical and Industrial Engineering

MIE468: Facility Planning (Winter 2014)

Homework #2 Solutions

Problem 1 All Ik values are rounded up.

𝐼𝑋𝐢 =𝑂𝑋

(1 βˆ’ 𝑑𝑋𝐢)=

100,000

0.97= 103,093

𝐼𝑋𝐡 =𝑂𝑋

(1 βˆ’ 𝑑𝑋𝐢)(1 βˆ’ 𝑑𝑋𝐡)=

100,000

0.97 Γ— 0.96= 107,389

𝐼𝑋𝐴 =𝑂𝑋

(1 βˆ’ 𝑑𝑋𝐢)(1βˆ’ 𝑑𝑋𝐡)(1 βˆ’ 𝑑𝑋𝐴)=

100,000

0.97 Γ— 0.96 Γ— 0.95= 113,041

πΌπ‘ŒπΆ =π‘‚π‘Œ

(1 βˆ’ π‘‘π‘ŒπΆ)=

200,000

0.97= 206,186

𝐼𝑋𝐴 =π‘‚π‘Œ

(1 βˆ’ π‘‘π‘ŒπΆ)(1 βˆ’ π‘‘π‘Œπ΄)=

200,000

0.97 Γ— 0.95= 217,038

𝐼𝑋𝐡 =π‘‚π‘Œ

(1 βˆ’ π‘‘π‘ŒπΆ)(1 βˆ’ π‘‘π‘Œπ΄)(1 βˆ’ π‘‘π‘Œπ΅)=

200,000

0.97 Γ— 0.95 Γ— 0.96= 226,081

Setup times are identical for machines A, B and C for a particular product. The setup time for product X on each machine is 20 mins; the setup time for product Y on each machine is 40 mins. Assuming a single setup is needed to produce the annual requirement of a product on a machine, the number of machines required is determined as follows:

𝑭𝑨 =𝟎.πŸπŸ“ Γ— πŸπŸπŸ‘,πŸŽπŸ’πŸ

(𝟎.πŸ–πŸ“)(πŸπŸ”πŸŽπŸŽ)(𝟎.πŸ—πŸ“)+

𝟎.𝟏𝟎 Γ— πŸπŸπŸ•,πŸŽπŸ‘πŸ–(𝟎.πŸ–πŸ“)(πŸπŸ”πŸŽπŸŽ)(𝟎.πŸ—πŸ“)

+𝟐𝟎 + πŸ’πŸŽ

(πŸ”πŸŽ)(πŸπŸ”πŸŽπŸŽ)Γ— 𝑭𝑨

𝑭𝑨 = πŸπŸ—.πŸ—πŸ’ β†’ πŸ‘πŸŽ 𝐦𝐚𝐜𝐑𝐒𝐧𝐞𝐬

𝑭𝑩 =𝟎.πŸπŸ“ Γ— πŸπŸŽπŸ•,πŸ‘πŸ–πŸ—

(𝟎.πŸ—πŸŽ)(πŸπŸ”πŸŽπŸŽ)(𝟎.πŸ—πŸŽ)+

𝟎.𝟏𝟎 Γ— πŸπŸπŸ”,πŸŽπŸ–πŸ(𝟎.πŸ—πŸŽ)(πŸπŸ”πŸŽπŸŽ)(𝟎.πŸ—πŸŽ)

+𝟐𝟎 + πŸ’πŸŽ

(πŸ”πŸŽ)(πŸπŸ”πŸŽπŸŽ)Γ— 𝑭𝑩

𝑭𝑩 = πŸ‘πŸ–.πŸπŸ– β†’ πŸ‘πŸ— 𝐦𝐚𝐜𝐑𝐒𝐧𝐞𝐬

𝑭π‘ͺ =𝟎.𝟏𝟎 Γ— πŸπŸŽπŸ‘,πŸŽπŸ—πŸ‘

(𝟎.πŸ—πŸ“)(πŸπŸ”πŸŽπŸŽ)(𝟎.πŸ–πŸ“)+

𝟎.πŸπŸ“ Γ— πŸπŸŽπŸ”,πŸπŸ–πŸ”(𝟎.πŸ—πŸ“)(πŸπŸ”πŸŽπŸŽ)(𝟎.πŸ–πŸ“)

+𝟐𝟎 + πŸ’πŸŽ

(πŸ”πŸŽ)(πŸπŸ”πŸŽπŸŽ)Γ— 𝑭π‘ͺ

𝑭π‘ͺ = πŸ‘πŸ.πŸ—πŸ’ β†’ πŸ‘πŸ 𝐦𝐚𝐜𝐑𝐒𝐧𝐞𝐬 If setups occur more frequently, then additional machines might be required due to the lost production cost by setups.

University of Toronto Department of Mechanical and Industrial Engineering

MIE468: Facility Planning (Winter 2014)

Problem 2

I =O

(1 βˆ’ d) =7500.80

= 937.5 β†’ 938

𝑭 =𝑺𝑸𝑬𝑯𝑹

=(πŸπŸ“πŸ”πŸŽ) Γ— πŸ—πŸ‘πŸ–

οΏ½πŸπŸ“πŸπŸŽοΏ½ Γ— πŸ• Γ— 𝟏= πŸ’πŸ’.πŸ”πŸ• β†’ πŸ’πŸ“ 𝐦𝐚𝐜𝐑𝐒𝐧𝐞𝐬

Alternatively, you could say that the loss of one hour per shift is reduction in the reliability:

𝑭 =𝑺𝑸𝑬𝑯𝑹

=(πŸπŸ“πŸ”πŸŽ) Γ— πŸ—πŸ‘πŸ–

οΏ½πŸπŸ“πŸπŸŽοΏ½ Γ— πŸ– Γ— (πŸ•πŸ–)= πŸ’πŸ’.πŸ”πŸ• β†’ πŸ’πŸ“ 𝐦𝐚𝐜𝐑𝐒𝐧𝐞𝐬

Problem 3 1

Machine 1 2 3 4 5 6

Part

1 1 1 1 2 1 1 3 1 1 1 4 1 1 5 1 1 6 1 1 7 1 1 1 8 1 1 9 1 1 1

2. DCA a. Tabulate Sums

Machine sum 1 2 3 4 5 6

Part

1 1 1 1 3 2 1 1 2 3 1 1 1 3 4 1 1 2 5 1 1 2 6 1 1 2 7 1 1 1 3 8 1 1 2 9 1 1 1 3

Sum 4 2 4 4 4 4

University of Toronto Department of Mechanical and Industrial Engineering

MIE468: Facility Planning (Winter 2014)

b. Sort Sums

Machine sum 2 6 5 4 3 1 Pa

rt

9 1 1 1 3 7 1 1 1 3 3 1 1 1 3 1 1 1 1 3 8 1 1 2 6 1 1 2 5 1 1 2 4 1 1 2 2 1 1 2

Sum 2 4 4 4 4 4 c. Sort Columns

Machine 6 1 4 5 3 2

Part

9 1 1 1 7 1 1 1 3 1 1 1 1 1 1 1 8 1 1 6 1 1 5 1 1 4 1 1 2 1 1

d. Sort Rows

Machine 6 1 4 5 3 2

Part

9 1 1 1 3 1 1 1 6 1 1 5 1 1 4 1 1 7 1 1 1 1 1 1 1 8 1 1 2 1 1

Group machines (6, 1, 4) and machines (5, 3, 2) 2. SCA Iteration 1 Machine pair SC Combine? {1,2} 0

{1,3} 0 {1,4} 3/5

University of Toronto Department of Mechanical and Industrial Engineering

MIE468: Facility Planning (Winter 2014)

{1,5} 0 {1,6} 3/5 {2,3} 1/2 {2,4} 0 {2,5} 1/2 {2,6} 0 {3,4} 0 {3,5} 1 Yes {3,6} 0 {4,5} 0 {4,6} 3/5 {5,6} 0 => Combine (3,5)

Iteration 2 Machine pair SC Combine?

{1,2} 0 {1,(3,5)} 0 {1,4} 3/5 Yes {1,6} 3/5 Yes {2,(3,5)} 1/2 {2,4} 0 {2,6} 0 {(3,5),4} 0 {(3,5),6} 0 {4,6} 3/5 Yes => Combine (1,4,6)

Iteration 3 Machine pair SC Combine?

{(1,4,6),2} 0 {(1,4,6),(3,5)} 0 {2,(3,5)} 1/2 Yes => Combine (2,3,5)

Group machines (1,4,6) and machines (2,3,5) 3

1.0

0.8

0.5

0.33

0

2 3 5 1 4 6

Part-Machine Relationship 1 2 3 4 5 6 7

1 1 0 0 1 0 1 0

2 0 1 1 0 1 0 0

3 0 0 0 1 0 1 0

4 0 1 1 0 0 0 0

5 0 0 1 0 0 0 1

Calculating the matrix

dij 1 2 3 4 5

1 0 6 1 5 5

2 6 0 5 1 3

3 1 5 0 4 4

4 5 1 4 0 2

5 5 3 4 2 0

Distance Matrix

dij 1 2 3 4 5

1 0 6 1 5 5

2 6 0 5 1 3

3 1 5 0 4 4

4 5 1 4 0 2

5 5 3 4 2 0

Variables:

Part, i 1 2 3 4 5 each part at most selected once

1 0 0 1 0 0 1

2 0 0 0 1 0 1

3 0 0 1 0 0 1

4 0 0 0 1 0 1

5 0 0 0 1 0 1

2

Objective 4.000001

family, j

number of families

Derya
Text Box
Problem 4 No standard solution. Problem 5
Derya
Text Box
First part family (P1, P3) corresponds to machines 1,4 and 6 Second part family (P2, P4, P5) corresponds to machines 2,3,5,7

top related