$Q(4)$: Assume that a single LUL is added to the given system, i$.$e$.,$ the rout of each

product becomes a loop by adding one LUL station either before or after every route.

a$.$ Construct the distance matrix for the following machine position assignment:

$(i)=\{\begin{array}{ccc}i+1& ifiis\text{o}\text{d}\text{d}& \\ i& ifiis\text{e}\text{v}\text{e}\text{n}& \end{array}$

Machines with same positions, lower machine order should be sequenced first.

b$.$ Calculate the total flow distance, using the data given in table $1,$ and part $($a$).$

Q$(5)$: Cellular layout $2($what if we make a cellular layout?$)$:

Create a cellular layout for the data given in Table $1$ using the DCA algorithm. If

there are any bottlenecks, then generate alternative solutions or duplicate minimum

number of machines to resolve the bottlenecks.