The Doctor Rostering Problem - Asser Fahrenholz

Appendix B. GAMS Model 77
2
3 option iterlim =999999999; // avoid limit on iterations
4 option reslim =50000; // timelimit for solver
5 option optcr =0.0; // gap tolerance
6 option solprint = OFF ; // include solution print in . lst file
7 option limrow =0; // limit number of rows in . lst file
8 option limcol =0; // limit number of columns in . lst file
9
//------------------------------------------------------------------------------
10 SETS
11 day days / 1 * 28 /
12 mondays ( day ) mondays / 1, 8,
15 , 22 /
13 fridays ( day ) fridays / 5, 12 ,
19 , 26 /
14 weekend ( day ) weekends / 6, 7,
13 , 14 , 20 , 21 , 27 , 28 /
15 workingdays ( day )
16 shift shifts / 1 * 4 /
17 nightshift ( shift ) night shifts / 1 /
18 noonshift ( shift ) noon shift / 2 /
19 afternoonshift ( shift ) afternoon shift / 3 /
20 eveningshift ( shift ) evening shift / 4 /
21 assignmentshifts ( shift )
22 nonshifts ( shift )
23 doctor doctors / jst , pzh
, hp , sda , hmm , osj /
24 index counting vars for the b-eq ’s / 0 * 7 /
25 index0 ( index ) / 0 /
26 index1 ( index ) / 1 /
27 index2 ( index ) / 2 /
28 index3 ( index ) / 3 /
29 index4 ( index ) / 4 /
30 index6a ( index ) / 6 /
31 index6b ( index ) / 7 /;
32 nonshifts ( shift ) = nightshift ( shift ) + eveningshift
( shift );
33 assignmentshifts ( shift ) = noonshift ( shift ) +
afternoonshift ( shift );
34 workingdays ( day ) = day ( day ) - weekend ( day );
35
36 display workingdays ;
37
38 PARAMETERS
39 b(day , shift , doctor ) define evening and night shifts
40 /(4.4. jst ) 1, (13.2. jst ) 1, (13.3. jst ) 1, (14.2. jst ) 1,
41 (2.4. pzh ) 1, (8.2. pzh ) 1, (8.3. pzh ) 1,
42 (15.4. hp) 1, (19.2. hp) 1, (19.3. hp) 1,
43 (20.2. sda ) 1, (20.3. sda ) 1, (21.4. sda ) 1,
44 (1.4. hmm ) 1, (6.2. hmm ) 1, (6.3. hmm ) 1, (7.2. hmm ) 1, (11.4. hmm ) 1,
(16.2. hmm ) 1, (16.3. hmm ) 1, (20.2. hmm ) 1,
(20.3. hmm ) 1, (21.2. hmm ) 1,
45 (25.4. hmm ) 1/