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

Define general purpose register architecture, Q. Define General Purpose Reg...

Q. Define General Purpose Register Architecture? General Purpose Register (GPR) Architecture: A register is a word of internal memory similar to the accumulator. GPR architec

Importance of using module-instance parameter, Using Module-Instance Parame...

Using Module-Instance Parameter: Parameter values can be overridden while a module is instantiated. New parameter values are passed at the time of module instantiation. Top-

Optimum solution based on constraint problems, Optimum solution based on co...

Optimum solution based on constraint problems: Whether depending on what solver you are using so there constraints are often expressed as relationships between variables as e.

Explain sequential sharing, Explain Sequential sharing. Sequential s...

Explain Sequential sharing. Sequential sharing: In this technique of sharing, a file can be shared through only one program at a time, it is file accesses by P1 and P2 are

Evaluation functions, Evaluation Functions: Evaluation functions calcu...

Evaluation Functions: Evaluation functions calculate approximately the score which can be prove of guaranteed if a particular world state is reached. Same like in chess, evalu

Distinguish between http and true streaming, Question: 1. Distinguish ...

Question: 1. Distinguish between HTTP and True streaming, stating the advantages and disadvantages of both type of media streaming. 2. Name two online services which provi

Branch (control) hazards in computer architecture, Branch (control) hazards...

Branch (control) hazards in computer architecture : Branching hazards (also called control hazards) take place when the processor is told to branch -for example, if a defin

What is the basic workflow order for color match, Question: (a) What is...

Question: (a) What is the difference between the Color Pass and the Color Replace effects? (b) What is the basic workflow order for Color Match? (c) Explain clearly the

Show basic concepts of permutation, Q. Show Basic concepts of permutation? ...

Q. Show Basic concepts of permutation? Let us look at the basic concepts of permutation with respect to interconnection network.  Let us say the network has set of n input node

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