Minimizing inter cell moves

1
1

5(1)

6(4)
1

1
1

4
1

4
5

2
3

To ensure that only one process plan is chosen for parts 1 and 4, we
replace the constraint Y11 + Y12 = 1 and Y51 + Y52 = 1 with the constraint
Y11 + Y12 + Y51 + Y52 = 1 and we replace the constraints Y41 + Y42 = 1
and Y61 + Y62 = 1 with the constraint Y41 + Y42 + Y61 + Y62 = 1. The
optimum solution is given by X11 = X31 = X51 = X22 = X42 = 1; Y11 = Y61
= Y22 = Y32 = 1 with Z = 8.

1
3
5
2
4

1
1
1
1

6
1
1
1

1
1

1
1
1

Modifying p median formulation

he two constraints X11 + X55 1 and X44 + x66 1

e that both 1 and 5 cannot be medians and both 4 and 6
e medians. We also modify two constraints to
12 + X13 + X14 + X15 + X16 + X51 + X52 + X53 + X54 + X55 + X56
+ X42 + X43 + X44 + X45 + X46 + X61 + X62 + X63 + X64 + X65 + X
e that we choose only one out of process plans 1 and 5 and
out of process plans 4 and 6.

1
2
3
4
5

--

0
--

1
3

3
2

-4

6
0

--

--

--

--

Machine duplication
p

X
k =1

ik

The additional machines due to duplication is

m

( X
i =1 k =1

ik

1)

p = 2 and we can duplicate only one machine, we have the

constraints
X11 + X12 1; X21 + X22 1; X31 + X32 1; X41 + X42 1;
X51 + X52 1; X61 + X62 1 and X11 + X12 + X21 + X22 + X31
+ X32 + X41 + X42 + X51 + X52 + X61 + X62 7.
The optimal solution to the problem that minimizes inter cell
moves is given by X11 = X31 = X51 = X61 = X22 = X52 = X62 =
1. Y11 = Y41 = Y51 = Y61 = Y22 = Y32 = Y72 = Y82 = 1 with Z =
11. We also have Z551 = Z552 = Z261 = Z262 = Z612 = Z621 =

Part subcontracting
Subject to

1 m n p
aij X ik Y jk

2 i =1 j =1 k =1

Minimize

and Maximize
p

X
k =1

ik

=1

Y
j =1 k =1

jk

Y
k =1

jk

Xik, Yjk = 0,1

We convert this problem to a single objective problem by treating the second
objective as a constraint.

1
3
4
2
5
6

1
1
1
1

4
1
1

5
1
1

6
1
1
1
1

1
1

1
1
1

1
1

1
1
1

1
1
1

Since there are two groups, we add the constraint Y11 + Y12 +
Y21 + Y22 + Y31 + Y32 + Y41 + Y42 + Y51 + Y52 + Y61 + Y62
+ Y71 + Y72 + Y81 + Y82 7
The optimal solution to the problem is given by X11 = X31 = X41
= X22 = X52 = X62 = 1.
Y11 = Y41 = Y51 = Y22 = Y32 = Y72 = Y82 = 1 with Z = 11.
We also have Z161 = Z262 = Z361 = Z461 = Z551 = Z552 =
Z611 = Z612 = Z641 = Z642 = Z662 = 1 giving an objective
function value of 11.

1
1

2
6

Remainder cells
Minimize

1 m n p
aij X ik Y jk
2 i =1 j =1 k =1

Subject to

Y
k =1

Xik, Yjk = 0,1

jk

a
j =1

ij

X i , p +1

nd term of the objective function is the term -4X13-4X23-3X33-3X43-5X53-7X63.

subscript represents the third machine cell which is the remainder cell.

maximum of two machines are allowed in the remainder cell, we have the

nt -X13 + X23 + X33 + X43 + X53 + X63 2.

mal solution is given by X11 = X22 = X31 = X52 = X43 = X63 = 1 indicating that

s 4 and 6 are in the remainder cell. We also have Y11 = Y41 = Y61 = Y22 = Y32 =

2 = Y82 = 1 with Z = 4. We also have Z151 = Z152 = Z261 = Z262 = Z411 = Z452

622 = Z632 = Z641 = Z661 = Z672 = Z682 = 1 giving an objective function value o

k diagonal structure corresponding to the machine and part families are

table 5.28. There are two inter cell moves and 10 moves to the remainder cell.

1
3
2
5
4
6

1
1
1

1
1

4
1
1

5
1

1
1
1

6
1
1
1
1
1

1
1

1
1

1
1