Computationally Automated Questioning Strategies for Fast Cost Functions Convergence at Supply Chain Stockout Evaluation.
Integrated Computer-Aided Engineering 20(1):235–258.
Applying the Threshold Accepting metaheuristic to curriculum based course timetabling – A contribution to the Second International Timetabling Competition ITC 2007.
Annals of Operations Research 194(1):189–202.
On Heuristic Search for the Single Machine Total Weighted Tardiness Problem – Some Theoretical Insights and their Empirical Verification.
European Journal of Operational Research 207(3):1235–1243.
Decision Support for Multi-Objective Flow Shop Scheduling by the Pareto Iterated Local Search Methodology
Computers & Industrial Engineering , 61(3):805–812.
I am a full professor of Business Administration/ Logistics Management at HSU Hamburg.
October–December 2014: M.Sc. course "Operative Planung und Scheduling", M.Sc. seminar "Logistik-Management".
I am interested in (NP-) hard combinatorial optimization problems with applications in routing, scheduling, and timetabling. In this context, I am particularly focussing on (i) multi-criteria issues, (ii) interactive methods and decision support systems, and (iii) the efficient implementation of modern heuristics in running systems.
With respect to the physical distribution of goods (transportation), recent research activities are dedicated towards the development of planning approaches for multi-objective inventory routing problems and other rich vehicle routing problems. We have also contributed to the better understanding and the solution of disjoint path planning problems.
Another important application is the single machine total weighted tardiness problem, a notoriously difficult planning problem, for which we formulated new challenging benchmark instances. More general production scheduling problems are investigated also, namely the multi-objective flow shop scheduling problem and the multi-mode resource constrained multi-project project scheduling problem.
Moreover, a visual example of an application is found in the area of employee rostering, where members of staff have to be assigned to shifts such that some optimization function is minimized. Besides, we work on timetabling problems arising in higher education (university timetabling).