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

Determine the equivalent binary form of decimal number, Solve the equation ...

Solve the equation 23.6 10 = X 2 for X Ans. 23.6 10 = X 2 So as to find X, firstly convert the Decimal number 23.610 in its Binary form. After that take the decimal inte

Difference between synchronous and asynchronous updates, What is the differ...

What is the difference between Synchronous and Asynchronous updates? A program asks the system to perform a particular task, and then either waits or doesn't wait for the task

What are kinds of processors, Processors can broadly be seperated into the ...

Processors can broadly be seperated into the categories of: CISC, RISC, hybrid, and special purpose.

What is guard bits, What is guard bits? Guard bits are extra bits which...

What is guard bits? Guard bits are extra bits which are produced while the intermediate steps to yield maximum accuracy in the final results.

Explain sequential sharing, Explain Sequential Sharing In this sharing ...

Explain Sequential Sharing In this sharing method, a file can be shared by just one program at a time, i.e. file accesses by P1 and P2 are spaced out over time. A lock field ca

Differentiate aggregation and containment, Aggregation is the relationship ...

Aggregation is the relationship among the whole and a part. We can add/subtract some properties in the part (slave) side. It won't affect the entire part. Best example is Car,

Explain the low level language - computer programming, Explain the Low Leve...

Explain the Low Level Language - Computer Programming? An assembly language or a machine language is known as Low-level language which are closer to the hardware than are high-

Write a perl script, Write a PERL script which takes a file named input.txt...

Write a PERL script which takes a file named input.txt as an input and processes it. The input file has the following format: firstname lastname: pass/fail score%. A sample input f

Explain about zip drive, Q. Explain about Zip Drive? Zip Drive: Loads...

Q. Explain about Zip Drive? Zip Drive: Loads of files, Volumes of data have definitely increased onus on today's computer user and protection of this data is what bugs every

What are the methods for handling deadlocks, What are the methods for handl...

What are the methods for handling deadlocks?  The deadlock problem can be dealt with in one of the three ways:  a. Use a protocol to prevent or avoid deadlocks, make sure th

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