The Doctor Rostering Problem - Asser Fahrenholz

Appendix A
Implementation
This appendix lists the implementation of key points in the implementation of the heuris-
tics and methods they use.
A.1 Neighborhoods
A.1.1 Inversion neighborhood
1 package changes ;
2
3 import java . util . LinkedHashSet ;
4
5 import ds.Day ;
6 import ds. Doctor ;
7 import ds. Schedule ;
8 import ds. Shift ;
9
10 public class N_invertion extends Change {
11
12 private static final long serialVersionUID = -717097533016180053 L;
13
14 public N_invertion ( int maxRotation , RotationInt rotationInt ) {
15 setChangeType ( ChangeType . nRotation );
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 invert
59