The Doctor Rostering Problem - Asser Fahrenholz

Appendix A. Implementation 61
16 setRotationInt ( rotationInt );
17 setN ( maxRotation );
18 }
19
20 public Change nextChange ( Schedule s) {
21
22 Change c = new Change ();
23
24 LinkedHashSet < Shift > list = new LinkedHashSet < Shift >() ;
25
26 // find shifts to swap around
27 // Random up to N and only N - size
28 Day randDay ;
29 Shift randShift ;
30 int randomSize ;
31 if ( getRotationInt (). compareTo ( RotationInt . RandomUpToN ) == 0) {
32 randomSize = ( int ) ( Math . random () * getN ());
33 } else {
34 randomSize = getN ();
35 }
36 while ( list . size () < randomSize ) {
37 randDay = s. get (( int ) Math . floor ( Math . random () * s. size ()));
38 randShift = randDay . getShift (( int ) Math . floor ( Math . random () * randDay
. size ()));
39 if ( randShift . isMiddayShift () && ! randDay . isWeekend () && randShift .
isSet () && ! randDay . isHoliday ()) {
40 list . add ( randShift );
41 }
42 }
43
44 // rotate doctors
45 Object [] al = list . toArray ();
46
47 for ( int i = 0; i < al. length ; i ++) {
48 Shift shi = ( Shift ) al[i];
49 // Shift is the first element : Doc should be moved to the shift of
50 // the last element
51 if ( shi == al[al. length - 1]) {
52 Doctor d = (( Shift ) al [0]) . getDoctor ();
53 c. put (shi , d);
54 } else {
55 Doctor d = (( Shift ) al[i + 1]) . getDoctor ();
56 c. put (shi , d);
57 }
58 }
59 return c;
60 }
61 }
A.2 Construction heuristic
1 package heuristic . construction ;