We use X=[x i,j ]∈{0,1} M×N to denote the assignment matrix where x i,j =1 if TP j is assigned to cell i and x i,j =0 otherwise.
ThIf increanys computational complexity and as such, it is important to minimize the amount of overlap.
Actually, M1 is assigned to cell 3 just to satisfy the constraint of the lower bound of the cell size.
Y jk = 1 if machine j is assigned to cell k 0 otherwise Open image in new window.
A user location, k, is assigned to cell i if the latter is the one providing the minimum propagation losses.
X ik = 1 if part i is assigned to cell k 0 otherwise Open image in new window.
If TP (jin {mathcal {N}}) is assigned to cell (iin {mathcal {M}}), then all users in the respective subarea associated with TP j are served by cell j.
In the first period, machine types 4, 5, and 1 are assigned to cell 1 and in locations 1, 4, and 7, respectively.
Furthermore, in the first period machine types 5, 2, and 3 are assigned to cell 2 and in locations 2, 5, and 8, respectively.
For instance, one unit of machine types 1, 2, and 4 is assigned to cell 1 and one unit of machine types 1, 2, and 3 is assigned to cell 2. In the second period, cell 2 is eliminated to decrease manufacturing capacity of the system due to the reduced demand.
