2 papers
math.OC2025
Computing an optimal single machine schedule with sequence dependent setup times using shortest path computations
Dominik Leib, Till Heller, Raphael Kühn
We study a single-machine scheduling problem with sequence dependent setup times, motivated by applications in manufacturing and service industries - in particular, the calendering…
math.OC2025
Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem
Dominik Leib, Susanne Fritzler, Neele Leithäuser
In this paper, we address a bicriteria network design problem that arises from practical applications in urban and rural public transportation planning. We establish the problem's…