Scheduling

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging
April 2019, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
PDF Cite
Automated Calculation of Optimal Adjustment Parameters for Myoelectric Hand Prostheses
March 2019, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
PDF Cite
Methods for Intraday Scheduling in Particle Therapy
November 2018, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and J. Maschler
PDF Cite
Local Search Methods for the Particle Therapy Patient Scheduling Problem
September 2018, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and J. Maschler
PDF Cite
An Iterative Time-Bucket Refinement Algorithm for High Resolution Scheduling Problems
October 2017, Master’s thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl, M. Riedler, and J. Maschler
PDF Cite
Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics
Proceedings of Matheuristics 2016: 6th International Workshop on Model-Based Metaheuristics (T. Stützle and V. Maniezzo), pages 104-107, 2016.
PDF Cite
Solving the Travelling Thief Problem with an Evolutionary Algorithm
September 2015, Master’s thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and B. Hu
PDF Cite
Electric Vehicles Recharge Scheduling with Logic-Based Benders Decomposition
July 2015, Master’s thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and M. Riedler
PDF Cite
Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem
Central European Journal of Operations Research, volume 23, number 1, pages 89-113, 2015.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/hiermann-13.pdf
Cite
Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization
Annals of Operations Research, volume 194, number 1, pages 325-339, 2012.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/nothegger-12.pdf
Cite