Hello,
i= operator i=1,…,58
j=day j=1,…,30
k=shift k=1,2,3
Ai= experience level of operators
Ai is as follows;
1 10
2 7
3 4
4 5
5 5
6 14
7 3
8 8
9 10
10 14
11 6
12 7
13 9
14 2
15 16
16 8
17 7
18 9
19 8
20 2
21 2
22 11
23 11
24 12
25 7
26 5
27 1
28 10
29 4
30 9
31 13
32 7
33 8
34 4
35 2
36 3
37 12
38 14
39 7
40 7
41 11
42 13
43 8
44 10
45 13
46 3
47 12
48 13
49 8
50 12
51 4
52 5
53 4
54 10
55 5
56 13
57 2
58 5
Xijk=1 if operator i is assigned in day j, shift k, 0 otherwise
vjk= negative deviation from the goal
wjk= positive deviation from the goal
The objective is to assign the operators with the most experienced and the operators with the least experienced to the same shift as possible.
minimize z= sum( (j,k)) , vjk+wjk)
GOAL CONSTRAINT
sum (i, Ai*Xijk) + vjk-wjk = ? for all j and k
CAN YOU HELP ME WITH THAT GOAL CONSTRAINT
