The Doctor Rostering Problem - Asser Fahrenholz

Appendix A. Implementation 72
64 break ;
65 case TwentyFive :
66 bestDocs . setSize (( int ) ( bestDocs . size () * 0.25) );
67 break ;
68 case SeventyFive :
69 bestDocs . setSize (( int ) ( bestDocs . size () * 0.75) );
70 break ;
71 default :
72 break ;
73 }
74
75 double randDoc = Math . random () * bestDocs . size ();
76 Doctor bestDoc = bestDocs . get (( int ) randDoc ). getE ();
77 return bestDoc ;
78 }
Listing A.1: Shift assignments
A.5.2 Permutations of size k chosen from N elements
1 package basic ;
2
3 import java . util . ArrayList ;
4 import ds. Doctor ;
5
6 /* ******************************************************************************
7 * Compilation : javac Perm . java Execution : java Permutations N k
8 *
9 * Enumerates all permutations of size k chosen from N elements . % java
10 * Permutations 4 2 | sort ab ac ad ba bc bd ca cb cd da db dc
11 *
12 * Limitations ----------- * Assumes N > res ;
18
19 private ArrayList < ArrayList < Doctor >> enumerate2 ( ArrayList < Doctor > b, int n,
20
int r) {
21 if (r == 0) {
22 ArrayList < Doctor > subres = new ArrayList < Doctor >() ;
23 for ( int i = n; i < b. size (); i ++) {
24 subres . add (b. get (i));
25 }
26 res . add ( subres );
27
28 } else {
29 for ( int i = 0; i < n; i ++) {
30 swap2 (b, i, n - 1);
31 enumerate2 (b, n - 1, r - 1);
32 swap2 (b, i, n - 1);