Flow-between matrix layout problem, Computer Engineering

Assignment Help:

Solve the problem in page 346 of the paper on cell formation by Boctor using the MIP method.  Use 4 cells and no more than 3 machines per cell.

Solve the problem using the MIP method and report the flow-distance score of the layout.  There are no building restrictions.  Assume the following dimensions for the departments.

Dept

Area (squares)

X-Dimension

Y-Dimension

A

24

4

6

B

16

4

4

C

36

9

4

D

24

6

4

Solve problem 9 again and report the flow-distance score of the layout, now assuming that the X- and Y- dimensions of department C are interchangeable, as necessary.

You are given the following flow-between matrix for a six department layout problem:

Dept

A

B

C

D

E

F

A

--

0

8

0

4

0

B

 

--

0

5

0

2

C

 

 

--

0

1

0

D

 

 

 

--

6

0

E

 

 

 

 

--

4

F

 

 

 

 

 

--

Solve the problem using the MIP method.  Assume that departments A and F have to be 2 x 2.  Departments C and D could either be 2 x 3 or 3 x 2.  Departments B and E may be 2 x 4 or 4 x 2.  Draw the optimal layout and find the resulting flow-distance score.


Related Discussions:- Flow-between matrix layout problem

The goal of hashing, The goal of hashing is to produce a search that takes ...

The goal of hashing is to produce a search that takes   O(1) time

Flynn’s classification, Flynn's Classification  This classification was...

Flynn's Classification  This classification was early proposed and studied by Michael Flynn in 1972. Flynn did not believe the machine architecture for organization of parallel

Drawbacks, drawbacks of shadow paging

drawbacks of shadow paging

Eliminating data hazards - computer architecture, Eliminating data hazards:...

Eliminating data hazards: Forwarding NOTE: In the following instance, computed values are in bold, whereas Register numbers are not. Forwarding involves adding output

New execution of listpermutations, Update the permutation algorithm from th...

Update the permutation algorithm from the text to obtainthe correct list of permutations even if the string haves repeated letters. For example, if you call ListPermutations on the

Determine the example of timescale, Determine the Example of timescale ...

Determine the Example of timescale 'timescale 10ns / 1ps Indicates delays are in 10 nanosecond units with 3 decimal points of precision (1 ps is 1/1000ns which is .001 ns).

Explain simplifying the sop boolean expression using k-map, Explain Simplif...

Explain Simplifying the SOP f the Boolean expression using the K-Map? To simplify the SOP of the Boolean expression using the K map, first identify all the input combinations tha

What is reification and behaviour, What is reification and behaviour? R...

What is reification and behaviour? Reification is the promotion of something that is not an object into an object. Behavior usually requires this description. It isn't usually

Ia-32 support, In order to support IA-32, the Itanium can switch into 32-bi...

In order to support IA-32, the Itanium can switch into 32-bit mode with special jump escape instructions. The IA-32 instructions have been mapped to the Itanium's functional units.

Prove boolean identities using boolean algebra, Prove the following Boolean...

Prove the following Boolean identities using the laws of Boolean algebra: ABC + AB ‾C + ABC ‾ = A(B + C) Ans. ABC+AB'C+ABC'=A(B + C) LHS AC(B+B')+AB(C+C') OR  AC+AB OR  A(B

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd