13 citations · 36 across the 9 of their papers we have counts for
10 papers
Optimizing Travel Time and Regenerative Energy for Periodic Timetables
Sarah Roth, Sven Jäger, Niels Lindner +1
Regenerating braking energy is one major pathway to make rail traffic energy-efficient. It is therefore desirable to design timetables that exploit this feature. However, timetable…
Quantum Computing for Discrete Optimization: A Highlight of Three Technologies
Alexey Bochkarev, Raoul Heese, Sven Jäger +2
Quantum optimization has emerged as a promising frontier of quantum computing, providing novel numerical approaches to mathematical optimization problems. The main goal of this pap…
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
Sven Jäger, Alexander Lindermayr, Nicole Megow
The Polytope Scheduling Problem (PSP) was introduced by Im, Kulkarni, and Munagala (JACM 2018) as a very general abstraction of resource allocation over time and captures many well…
An Equilibrium Model for Schedule-Based Transit Networks with Hard Vehicle Capacities
Tobias Harks, Sven Jäger, Michael Markl +1
Modelling passenger assignments in public transport networks is a fundamental task for city planners, especially when deliberating network infrastructure decisions. A key aspect of…
An Optimization Case Study for solving a Transport Robot Scheduling Problem on Quantum-Hybrid and Quantum-Inspired Hardware
Dominik Leib, Tobias Seidel, Sven Jäger +5
We present a comprehensive case study comparing the performance of D-Waves' quantum-classical hybrid framework, Fujitsu's quantum-inspired digital annealer, and Gurobi's state-of-t…
Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs
Sven Jäger, Philipp Warode
We consider the precedence-constrained scheduling problem to minimize the total weighted completion time. For a single machine several -approximation algorithms are known, which…
Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt +1
We study kill-and-restart and preemptive strategies for the fundamental scheduling problem of minimizing the sum of weighted completion times on a single machine in the non-clairvo…
On orthogonal symmetric chain decompositions
Karl Däubel, Sven Jäger, Torsten Mütze +1
The -cube is the poset obtained by ordering all subsets of by inclusion, and it can be partitioned into chains, which is the min…
Gray codes and symmetric chains
Petr Gregor, Sven Jäger, Torsten Mütze +2
We consider the problem of constructing a cyclic listing of all bitstrings of length with Hamming weights in the interval , where , by…
Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
Sven Jäger, Martin Skutella
Minimizing the sum of weighted completion times on identical parallel machines is one of the most important and classical scheduling problems. For the stochastic variant where…