The Doctor Rostering Problem - Asser Fahrenholz

Appendix A. Implementation 71
19 Vector >> bestDocs = new Vector > >();
20 Pair < Integer , Pair < HashMap < Shift , HashSet >>, HashMap
< Shift , HashSet >>>> sol ;
21 int vio ;
22
23 myFore :
24 for ( Doctor d : docs ) {
25
26 int score = 0;
27 if ( this . isThisDoctorAroundThisShift (d, shift )) {
28 continue myFore ;
29 }
30 sol = this . getShiftValue (d, day . getDayID () , shift . getShiftInt () ,
false , false , true , true );
31 score = sol . getE ();
32 vio = sol . getV (). getE (). size ();
33
34 if ( bestDocs . size () == 0) {
35 bestDocs . add ( new Pair < Doctor , Pair < Integer , Integer > >(d, new Pair
< Integer , Integer >( score , vio )));
36 } else {
37 int size = bestDocs . size ();
38 myFor :
39 for ( int i = 0; i <
40 size ; i ++) {
41 Pair < Doctor , Pair < Integer , Integer >> docScore = bestDocs . get (
i);
42 if ( vio < docScore . getV (). getV ()) {
43 bestDocs . add ( bestDocs . indexOf ( docScore ),
44 new Pair < Doctor , Pair < Integer , Integer > >(d, new
Pair < Integer , Integer >( score , vio )));
45 break myFor ;
46 } else if ( vio == docScore . getV (). getV () && ( docScore . getV ().
getE () = score && minimize )
)) {
47 bestDocs . add ( bestDocs . indexOf ( docScore ),
48 new Pair < Doctor , Pair < Integer , Integer > >(d, new
Pair < Integer , Integer >( score , vio )));
49 break myFor ;
50 } else {
51 bestDocs . add ( new Pair < Doctor , Pair < Integer , Integer > >(d,
new Pair < Integer , Integer >( score , vio )));
52 break myFor ;
53 }
54 }
55 }
56 }
57
58 switch ( RCLsize ) {
59 case Best :
60 bestDocs . setSize (1) ;
61 break ;
62 case Fifty :
63 bestDocs . setSize (( int ) ( bestDocs . size () * 0.5) );