• 2016-2019: Research Associate, Chair of Decision Science & Systems, Technical University of Munich
• 2011-2016: Research Associate, Group of Combinatorial Optimization, University of Osnabrück
• 2007-2010: Student Assistant, Intelligent Autonomous Systems Group, Technical University of Munich
• 2004-2010: Diploma Mathematics, Technical University of Munich

M. Bichler, S. Waldherr. Competitive equilibria in combinatorial exchanges with financially constrained buyers: Computational hardness and algorithmic solutions. 20th ACM Conference on Economics and Computation, 2019

 

P. Sutterer, S. Waldherr, M. Bichler. Are truthful bidders paying too much? Efficiency and revenue in display ad auctions. ACM Transactions on Management Information Systems, 2019, forthcoming.

 

S. Knust, N.V. Shakhlevich, S. Waldherr, S. Weiß. Shop scheduling problems with pliable jobs. Journal of Scheduling, 2019, forthcoming.

 

M. Bultmann, S. Knust, S.Waldherr. Synchronous flow shop scheduling with pliable jobs. European Journal of Operational Research 270, 943-956, 2018.

 

M. Bultmann, S. Knust, S.Waldherr. Flow shop scheduling with flexible processing times. OR Spectrum 40, 809-829, 2018.

 

M. Bichler, S. Waldherr. Core and pricing equilibria in combinatorial exchanges. Economics Letters 157, 145-147, 2017.

 

S. Waldherr, S. Knust. Decomposition algorithms for synchronous flow shop problems with additional resources and setup times. European Journal of Operational Research 259, 847-863, 2017.

S. Waldherr, S. Knust, and D. Briskorn. Synchronous flow shop problems: How much can we gain by leaving machines idle? Omega 72, 15-24, 2017.

C. Weiß, S. Waldherr, S. Knust, N.V. Shakhlevich. Open shop scheduling with synchronization. Journal of Scheduling 20(6), 557-581, 2017.

C. Weiß, S. Knust, N.V. Shakhlevich, S. Waldherr. The assignment problem with nearly Monge arrays and incompatible partner indices. Discrete Applied Mathematics 211, 183-203, 2016

M. Kampmeyer, S. Knust, S. Waldherr. Solution algorithms for synchronous flow shop problems with two dominating machines. Computers and Operations Research 74, 42-52, 2016

S. Waldherr, S. Knust, S. Aust. Message scheduling for real-time interprocessor communication. Journal of Systems Architecture 61, 374-382, 2015

S. Waldherr, J. Poppenborg, S. Knust. The bottleneck transportation problem with auxiliary resources.  4OR - A Quarterly Journal of Operations Research 13, 279-292, 2015

S. Waldherr, S. Knust. Complexity results for flow shop problems with synchronous movement. European Journal of Operational Research 242, 34-44, 2015

S. Waldherr, S. Knust. Two-stage scheduling in shelf-board production: A case study. International Journal of Production Research 52, 4078-4092, 2014

Thesis

S. Waldherr. Scheduling of flow shops with synchronous movement. PhD Thesis, University of Osnabrück, Germany, 2015 [link]