- since 10/2017: AdONE associated researcher (Junior Advisor), TUM
- since 2016: Research Associate, Chair of Decision Science & Systems, TUM
- 2011-2016: Research Associate, Group of Combinatorial Optimization, University of Osnabrück (Dissertation 2015)
- 2007-2010: Student Assistant, Intelligent Autonomous Systems Group, TUM
- 2004-2010: Diploma Mathematics, TUM
Operations Research and Combinatorial Optimization, particularly with applications in Market Design and Scheduling.
M. Bichler, S. Waldherr: Core and pricing equilibria in combinatorial exchanges. Economics Letters 157 (2017), 145-147.
S. Waldherr, S. Knust: Decomposition algorithms for synchronous flow shop problems with additional resources and setup times. European Journal of Operational Research 259 (2017), 847-863.
S. Waldherr, S. Knust, and D. Briskorn: Synchronous flow shop problems: How much can we gain by leaving machines idle? Omega 72 (2017), 15-24.
C. Weiß, S. Waldherr, S. Knust, N.V. Shakhlevich: Open shop scheduling with synchronization. Journal of Scheduling, doi:10.1007/s10951-016-0490-0 C.
Weiß, S. Knust, N.V. Shakhlevich, S. Waldherr: The assignment problem with nearly Monge arrays and incompatible partner indices. Discrete Applied Mathematics 211 (2016), 183-203.
M. Kampmeyer, S. Knust, S. Waldherr: Solution algorithms for synchronous flow shop problems with two dominating machines. Computers and Operations Research 74 (2016), 42-52.
S. Waldherr, S. Knust, S. Aust: Message scheduling for real-time interprocessor communication. Journal of Systems Architecture 61 (2015), 374-382.
S. Waldherr, J. Poppenborg, S. Knust. The bottleneck transportation problem with auxiliary resources. 4OR - A Quarterly Journal of Operations Research 13 (2015), 279-292.
S. Waldherr, S. Knust. Complexity results for flow shop problems with synchronous movement. European Journal of Operational Research 242 (2015), 34-44.
S. Waldherr, S. Knust. Two-stage scheduling in shelf-board production: A case study. International Journal of Production Research 52 (2014), 4078-4092.