The Doctor Rostering Problem - Asser Fahrenholz

Appendix B. GAMS Model 78
46 c(day , shift , doctor ) define requests for days off or shifts off
( meaning you can have a shift up to or af
ter a shift off )
47 /(8.3. jst ) 1, (9.3. jst ) 1, (16.3. jst ) 1,
48 (9.3. pzh ) 1, (19.3. pzh ) 1,
49 (1.3. hp) 1, (4.3. hp) 1, (9.3. hp) 1, (18.3. hp) 1, (23.3. hp) 1,
50 (1.3. sda ) 1, (9.3. sda ) 1, (12.3. sda ) 1, (15.2. sda ) 1, (15.3. sda )
1, (26.2. sda ) 1, (26.3. sda ) 1,
51 (8.2. hmm ) 1, (8.3. hmm ) 1, (9.2. hmm ) 1, (9.3. hmm ) 1, (10.2. hmm ) 1,
(10.3. hmm ) 1, (11.2. hmm ) 1, (11.3. hmm ) 1,
(12.2. hmm ) 1, (12.3. hmm ) 1,
GAMS Rev 140 Sun Sparc / SOLAR
10/28/08 18:25:02 Page 2
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
C o m p i l a t i o n
52 (13.2. hmm ) 1, (13.3. hmm ) 1, (14.2. hmm ) 1, (14.3. hmm ) 1,
53 (1.2. osj ) 1, (1.3. osj ) 1, (2.2. osj ) 1, (2.3. osj ) 1, (3.2. osj ) 1,
(3.3. osj ) 1, (4.2. osj ) 1, (4.3. osj ) 1, (5.
2. osj ) 1, (5.3. osj ) 1, (6.2. osj ) 1,
54 (6.3. osj ) 1, (7.2. osj ) 1, (7.3. osj ) 1
55 /
56 s(day , shift ) define extra doctor demands
57 /(1.2) 1, (8.2) 1, (15.2) 1, (22.2) 1/
58
59 VARIABLES
60 x(day , shift , doctor ) doctors on shifts
61 y(day , shift , doctor , index ) counting var
62 z solution value
63 k(day , shift , doctor , index ) counter the the y- vars
64 dmax doctor max
65 dmin doctor min ;
66
67
68 BINARY VARIABLE x(day , shift , doctor ), y(day , shift , doctor , index ), k(day , shift
, doctor , index );
69 POSITIVE VARIABLE dmax , dmin ;
70
71 EQUATIONS
72 VALUE define objective function
73
74 H0a no two assignment shifts in a row
75 H0b no eveningshift after an afternoonshift
76 H0c no nightshift before a noonshift
77 H1 doctor cannot have a noon shift after an evening
shift
78 H2 doctor cannot have a noon shift nor an afternoon
shift after a night shift
79 H3a no shifts must be granted that has been blocked
80 H3b no shifts must be granted that has requested off
81 H4 doctor demands
82 H5 no other assignments
83