The Doctor Rostering Problem - Asser Fahrenholz

Appendix A. Implementation 65
51 series3 = new XYSeries (" Working vio ");
52 series4 = new XYSeries (" Working score ");
53 seriesCol . addSeries ( series );
54 seriesCol . addSeries ( series2 );
55 seriesCol . addSeries ( series3 );
56 seriesCol . addSeries ( series4 );
57
58
59 startTime = System . currentTimeMillis ();
60 boolean test = ( super . type . compareTo ( Type . Rounds ) == 0) ? (
loopCounter < maxRounds ) : ( System . currentTimeMillis () - startTime ) <
getTimeToRun ();
61 while ( test ) {
62 localLoopCounter = 0;
63 int progress = ( super . type . compareTo ( Type . Rounds ) == 0) ? (100 *
64
loopCounter / maxRounds ) : ( int ) (100 * ( System . currentTimeMillis () -
startTime ) / getTimeToRun ());
65 setProgress ( progress );
66 working = getInitialSchedule ();
67 /* GREEDY */
68 {
69 Day day ;
70 Shift s;
71 Doctor d;
72 for ( int i = 0; i < working . size (); i ++) {
73 day = working . getDay (i);
74 if (!( day . isWeekend () || day . isHoliday ())) {
75 if ( getDoS (). compareTo ( DayOrShift . Day ) == 0) {
76 Change change = working . getBestChange ( day .
getDayID () , RCLsize , minimize , getRules ());
77 working . performChange ( change , false );
78 continue ;
79 }
80 for ( int j = 0; j < day . size (); j ++) {
81 s = day . getShift (j);
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
91 /* LOCAL SEARCH : */
92 double timeToRunLocal = getTimeToRun () / 5;
93 int newLocalScore ;
94 {
95 double startTimeLocal = System . currentTimeMillis ();
96 boolean test2 = ( super . type . compareTo ( Type . Rounds ) == 0) ? (
localLoopCounter < maxLocalLoops ) : ( System . currentTimeMillis () -
startTimeLocal ) < timeToRunLocal ;