Bauerhenne, Carolin;Kolisch, Rainer;Schulz, Andreas S.
Robust Appointment Scheduling with Waiting Time Guarantees
Manufacturing & Service Operations Management
2026

Giannakopoulos, Yiannis;Grosz, Alexander;Melissourgos, Themistoklis
On the Smoothed Complexity of Combinatorial Local Search
Mathematics of Operations Research
2025

von Aspern, Maximilian;Buld, Felix;Klein, Nicklas;Pinedo, Michael
Flow shops with reentry: The total weighted completion time objective
Journal of Scheduling
2025
28
3

Buld, Felix;Schulz, Andreas S.
Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model
Frontiers of Algorithmics
Springer Nature Singapore
2025

Rohwedder, Lars;Schnaars, Leander
3.415-Approximation for Coflow Scheduling via Iterated Rounding
CoRR
2025

Borgwardt, Steffen;Brugger, Matthias
Circuits in extended formulations
Discrete Optimization
2024
52
100825

von Aspern, Maximilian; Buld, Felix; Klein, Nicklas;Pinedo, Michael
Flow shops with reentry: The total weighted completion time objective
CoRR
2024

Brandl, Lukas;Schulz, Andreas S.
Primal Separation and Approximation for the {0,1/2}-closure
Operations Research Letters
2024
57
107156

Giannakopoulos, Yiannis;Grosz, Alexander;Melissourgos, Themistoklis
On the Smoothed Complexity of Combinatorial Local Search
The 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP)
Tallinn, Estonia
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2024

Schulz, Andreas S.;Telha, Claudio
On the complexity of a maintenance problem for hierarchical systems
Operations Research Letters
2024
107117