5607 2015 eng reportzib 0 2015-07-09 2015-07-09 -- Duty rostering problems occur in different application contexts and come in different flavors. They give rise to very large scale integer programs which ypically have lots of solutions and extremely fractional LP relaxations. In such a situation, heuristics can be a viable algorithmic choice. We propose an mprovement method of the Lin-Kernighan type for the solution of duty rostering problems. We illustrate its versatility and solution quality on three different applications in public transit, vehicle routing, and airline rostering with a focus on the management of preferences, fairness, and fatigue, respectively. 1438-0064 urn:nbn:de:0297-zib-56070 Ralf Borndörfer Thomas Schlechte Markus Reuther Thomas Schlechte Christof Schulz Elmar Swarat Steffen Weider 15-44 OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING Mathematical Optimization Borndörfer, Ralf Schlechte, Thomas Schulz, Christof Swarat, Elmar Weider, Steffen LHS-CS MODAL-RailLab TOLLCONTROLOPT MODAL-Gesamt Reuther, Markus Applied Optimization https://opus4.kobv.de/opus4-zib/files/5607/ZR-15-44.pdf