
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.

Applying the Threshold Accepting metaheuristic to curriculum based course timetabling – A contribution to the Second International Timetabling Competition ITC 2007.
Annals of Operations Research ![]()

Decision Support for Multi-Objective Flow Shop Scheduling by the Pareto Iterated Local Search Methodology
Computers & Industrial Engineering
, 61(3):805–812.

On operators and search space topology in multi-objective flow shop scheduling.
European Journal of Operational Research
181(1):195–206.
![]() |
| ||||||||||||
I am a full professor in Business Administration/ Logistics Management at HSU Hamburg.
I am interested in (NP-) hard combinatorial planning problems with applications in routing, scheduling, and timetabling. In this context, I am particularly focussing on (i) multi-criteria issues, (ii) planning under uncertainty and dynamics (also robust planning), and (iii) interactive methods and decision support systems.
Some applications:
A visual example 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).
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.
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.
