IE484 Exam I Solution PDF

Preview

Summary

Download IE484 Exam I Solution PDF

Description

IE 484 – Integrated Production Systems II

IE484 Exam I (50 minutes, total 100 points) 3/17/2021 Last Name:

First Name:

.

1. (25 points) A company produces three products and have a plan for a new factory. The factory will have four departments (A, B, C, and D) with the following area requirement: A = 6 grids, B = 9 grids, C = 4 grids, and D = 6 grids. The table below shows the product ID, production quantity, routing information, and movement factor. Product ID 1 2 3

Production Quantities (per day) 40 60 10

Movement Factor 1 0.5 2

Routing A-C-D B-C-D C-A-B-D

a. Draw a from-to chart. From\To A B C

A -

B 20 -

C 40 30 -

20

D

D 20 40+30=7 0 -

b. Design a layout in the figure below and compute its adjacency-based objective. A

A

B

B

B

A

A

B

B

B

A

A

B

B

B

D

D

D

C

C

D

D

D

C

C

Adjacency-based objective: 4

4

Z =∑ ∑ f ij x ij=20∗1+ 40∗0+ 30∗1 +20∗1 +70∗1+ 20∗0 = 140 i=1 j=1

1 of 4

IE 484 – Integrated Production Systems II

2. (25 points) Consider a manufacturing facility with five departments. The department names, their number of grids, and the from-to chart are shown in the below table. In addition, the below figure shows the initial layout of the facility. We are considering the CRAFT to optimize the layout.

C l culate the distance-based objective of the initial layout.

A B C D E

A

B

C

D

-

3 -

4

5.5 2.5

4

-

3.5 -

E X 1.5 3 -

A B C D E

distance matrix

A

B

C

D

-

10 -

15

20 5

5

-

15 -

E = 15 40 -

B

-

60

12.5

C D E

20

-

52.5 -

22.5 120 -

the from-to chart

Distance-based objective 5

5

Z =∑ ∑ f ij c ij d ij=f ij d ij =30+110 +60 + 12.5 + 20 + 52.5 + 22.5 + 120= 427.5 i=1 j=1

b. List all possible exchanges. 7 pairs: A-B, A-C, B-C, B-D, C-D, C-E, D-E

c. Make a layout resulting from exchanging D and E. E

D

D

D

D

E

E

C

C

C

B

B

C

C

C

B

B

A

A

A

B

B

A

A

A

3. (25 points) Answer the following questions for Multiple. The department names, their number of grids, and the from-to chart are shown in the below table. Note that the locations of departments D 2 of 4

IE 484 – Integrated Production Systems II & E are fixed.

C

t e the distance-based objective of the layout for the sequence A-B-C. b. Considering that the initial layout is A-B-C, make a layout resulting from exchanging B and C and compute its adjacency-based objective.

- Centroids of each department: A (1.5, 1), B (2.5, 2.5), C (4, 1), D (1.5, 4), E (4, 4) - Rectilinear distance matrix of the initial layout: A B C D A 0 2.5 2.5 3 B 0 3 2.5 C 0 5.5 D 0 E

E 5.5 3 3 2.5 0

- The distance-based objective of the layout for the sequence A-B-C (part a). ∑ ∑ f ij c ij d ij=15 ×2.5+5 × 3+5× 5.5+20 ×3+10 × 2.5+ 30 × 5.5+45 × 2.5= 442.5 i ∈ {A ,… , E } j ∈ {A , …, E }

- The adjacency-based objective of the layout for the sequence A-C-B (part b) ∑ ∑ f ij xij=15 × 1+5 × 0+5 ×0+ 20 × 1+ 10 × 0+30 ×1+45 × 1=110 i ∈ {A ,… , E } j ∈ {A , …, E }

4. (25 points) Assume that we are applying the Multiple algorithm to our smart factory project. For consistency with the Multiple algorithm, we assume that machines are located in the cells of a 5*5 grid, not on the vertices.

3 of 4

IE 484 – Integrated Production Systems II a. Draw an SFC in the grid below with 25 cells.

b. We are defining 5 departments (1, 2, 3, 4, 5) according to operation type, i.e., department 1 for operation 1, department 2 for operation 2, and so on. Develop a layout for the sequence 24153 using the SFC you designed above. Your layout should show the locations of all the 25 machines.

-

There exist multiple possible space-filling curves for a 5x5 space. The following SFC with the starting from left bottom space shows one possible answer for this problem. You have to specify where your starting point is.

-

4 of 4...