The Doctor Rostering Problem - Asser Fahrenholz

Appendix A. Implementation 63
54 {
55 Day day ;
56 Shift s;
57 Doctor d;
58 for ( int i = 0; i < working . size (); i ++) {
59
60 setProgress (100 * i / working . size ());
61 oldScore = newScore ;
62 workingSol = working . getSolutionValue ( false , getRules ());
63 newScore = workingSol . getE ();
64 newVio = workingSol . getV (). getE (). size ();
65 newSoftVio = workingSol . getV (). getV (). size ();
66 firePropertyChange (" score ", oldScore , newScore );
67 firePropertyChange (" violations ", null , newVio );
68 firePropertyChange (" violationsSoft ", null , newSoftVio );
69 day = working . getDay (i);
70 if (!( day . isWeekend () || day . isHoliday ())) {
71
72 if ( getDoS (). compareTo ( DayOrShift . Day ) == 0) {
73 Change c = working . getBestChange ( day . getDayID () ,
RCLsize , minimize , getRules ());
74 working . performChange (c, false );
75 continue ;
76 }
77
78 Shift :
79 for ( int j = 0; j < day . size (); j ++) {
80 s = day . getShift (j);
81
82 if (s. isMiddayShift ()) {
83 d = working . getBestDoctor (day , s, RCLsize ,
minimize , getRules ());
84 working . assignDoctor2Shift (day , d, s. getShiftInt
() , false );
85 }
86 }
87 }
88 }
89 }
90 working . setConstructorID ( this . hashCode ());
91 working . setRCL ( RCLsize );
92 working . setDoS ( dos );
93
94 setBestSchedule ( working );
95
96 } catch ( Exception e) {
97 System . out . println (" Caught e: " + e. getCause ());
98 e. printStackTrace ();
99 }
100 return null ;
101 }
102 }